Try Audiogalaxy. It's a lot sweeter than Napster and still evolving. Better yet, it has a Linux client and some GPL'd source code! Ryan Earl Software Engineer
The hardware on this test is in no way indicative of what even a low-end server would be comprised of. Barring the perverbial refurbished 386 email server, I'd expect the minimum configuration to have SCSI harddrives, hoping even Ultra2 10K drives, and 256MB of RAM to be anywhere close to a real-world server. If you want to do a load test, make sure you're not locked in hardware bottlenecks.
Yes, Dijkstra's Algorithm (and not just because I sat in on his lecture at my University - The University of Texas) and heaps. I want two types of heaps in that list, each with the word "Fibonacci" in them:
1) Fibonacci Heap (priority queue style) = fastest heap known to man. Amortized O(1) insert, theta(1) decrease key, O(ln n) insert, theta(ln g) removeMin, and a lot of other theta(1) and O(1)s. Makes Dijkstra's Algorithm run 2-16 times faster.
2) Fibonacci Buddy System - Heap memory allocation. Fast as Binary Buddy system O(ln freelist) but MUCH better memory fragmentation. Guess the list author's don't need dynamic memory allocation?
Being a graphics geek, what about the newest one's for graphics and games? I have a large liking for the progressive mesh technique (collapse list to scale polygon counts in realtime) using Quadric Error Metrics (Hoppes and Hughes of Micrsoft respectively... Oh, Stan Melax of BioWare rules).
Slashdot Mirror
Try Audiogalaxy. It's a lot sweeter than Napster and still evolving. Better yet, it has a Linux client and some GPL'd source code!
Ryan Earl
Software Engineer
The hardware on this test is in no way indicative of what even a low-end server would be comprised of. Barring the perverbial refurbished 386 email server, I'd expect the minimum configuration to have SCSI harddrives, hoping even Ultra2 10K drives, and 256MB of RAM to be anywhere close to a real-world server. If you want to do a load test, make sure you're not locked in hardware bottlenecks.
Ryan Earl
Software Engineer
Yes, Dijkstra's Algorithm (and not just because I sat in on his lecture at my University - The University of Texas) and heaps. I want two types of heaps in that list, each with the word "Fibonacci" in them:
1) Fibonacci Heap (priority queue style) = fastest heap known to man. Amortized O(1) insert, theta(1) decrease key, O(ln n) insert, theta(ln g) removeMin, and a lot of other theta(1) and O(1)s. Makes Dijkstra's Algorithm run 2-16 times faster.
2) Fibonacci Buddy System - Heap memory allocation. Fast as Binary Buddy system O(ln freelist) but MUCH better memory fragmentation. Guess the list author's don't need dynamic memory allocation?
Being a graphics geek, what about the newest one's for graphics and games? I have a large liking for the progressive mesh technique (collapse list to scale polygon counts in realtime) using Quadric Error Metrics (Hoppes and Hughes of Micrsoft respectively... Oh, Stan Melax of BioWare rules).
Ryan Earl
Software Engineer