Efficient sorting using registers and caches (2000)

Cached

Download Links

by Rajiv Wickremesinghe , Lars Arge , Jeff Chase , Jeffrey Scott Vitter
Venue:WAE, WORKSHOP ON ALGORITHM ENGINEERING , LECTURE NOTES IN COMPUTER SCIENCE
Citations:9 - 0 self

Active Bibliography

Data Intensive Computation in a Compute/Storage Hierarchy – Rajiv Wickremesinghe - 2002
20 Efficient Sorting Using Registers and Caches – Lars Arge, Jeff Chase, Jeffrey S. Vitter, Rajiv Wickremesinghe - 2000
Abstract – Roy Armoni, Doron Bustan, Moshe Y. Vardi, Orna Kupferman
5 An Optimal Cache-Oblivious Priority Queue and its Application to Graph Algorithms – Lars Arge, Michael A. Bender, Erik D. Demaine, Bryan Holland-Minkley, J. Ian Munro - 2007
Cache-Oblivious Priority Queue and Graph Algorithm Applications \Lambda – unknown authors - 2003
Accepted to SIAM Journal on Computing – Lars Arge, Michael A. Bender, Erik D. Demaine, Bryan Holl, Minkley J. Ian Munro - 2006
9 Cache-oblivious algorithms and data structures – Gerth Stølting Brodal - 2004
Towards a Theory of Cache-Efficient Algorithms ∗ – unknown authors - 2000
18 The cost of cache-oblivious searching – Michael A. Bender, Gerth Stølting Brodal, Rolf Fagerberg, Dongdong Ge, Simai He, Haodong Hu, John Iacono , Alejandro López-Ortiz - 2003