Efficient Sorting Using Registers and Caches (2000)

View PDF

Download Links

by Lars Arge , Jeff Chase , Jeffrey S. Vitter , Rajiv Wickremesinghe
Venue:in Proceedings of the 4th Workshop on Algorithm Engineering (WAE 2000
Citations:19 - 4 self

Active Bibliography

Data Intensive Computation in a Compute/Storage Hierarchy – Rajiv Wickremesinghe - 2002
9 Efficient sorting using registers and caches – Rajiv Wickremesinghe, Lars Arge, Jeff Chase, Jeffrey Scott Vitter - 2000
Cache Analysis of Non-uniform Distribution Sorting Algorithms – Naila Rahman, Rajeev Raman - 2008
7 Scanning Multiple Sequences Via Cache Memory – Kurt Mehlhorn, Peter Sanders - 2003
© 2002 Springer-Verlag New York Inc. Scanning Multiple Sequences via Cache Memory1 – Kurt Mehlhorn, Peter S
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
The Performance of in-Memory Sorting – Rajiv Wickremesinghe - 1999
Abstract – Roy Armoni, Doron Bustan, Moshe Y. Vardi, Orna Kupferman
531 The Cache Performance and Optimizations of Blocked Algorithms – Monica S. Lam, Edward E. Rothberg, Michael E. Wolf - 1991