An Experimental Study of Sorting and Branch Prediction

Cached

Download Links

by Paul Biggar , Nicholas Nash , Kevin Williams , David Gregg
Citations:2 - 0 self

Active Bibliography

MACHINE LEARNING TECHNIQUES FOR CODE GENERATION AND OPTIMIZATION – Xiaoming Li - 2006
2 Redesigning the String Hash Table, Burst Trie, and BST to Exploit Cache – Nikolas Askitis, JUSTIN ZOBEL - 2011
Data Intensive Computation in a Compute/Storage Hierarchy – Rajiv Wickremesinghe - 2002
38 STXXL: Standard template library for XXL data sets – R. Dementiev, L. Kettner - 2005
Sorting in the Presence of Branch Prediction and Caches Fast Sorting on Modern Computers – Paul Biggar, David Gregg - 2005
102 GPUTeraSort: High Performance Graphics Coprocessor Sorting for Large Database Management – Naga K. Govindaraju, Jim Gray, Ritesh Kumar, Dinesh Manocha - 2006
10 Cache-oblivious algorithms and data structures – Gerth Stølting Brodal - 2004
8 Optimum Binary Search Trees On The Hierarchical Memory Model – Shripad Thite - 2001
14 Cache oblivious algorithms – Piyush Kumar - 2003
SORTING USING SIMD REGISTERS – Timothy Michael Furtak - 2007
112 The influence of caches on the performance of sorting – Anthony LaMarca, Richard E. Ladner - 1997
A Novel In-Place Sorting Algorithm with O(n log z) Comparisons and O(n log z) Moves – Hanan Ahmed Hosni Mahmoud, Nadia Al-Ghreimil - 2006
39 Introspective Sorting and Selection Algorithms – David Musser - 1997
The Performance of in-Memory Sorting – Rajiv Wickremesinghe - 1999
Chapter 1 Active Storage 1.1 Background – Active Storage Background
64 Scalable sweeping-based spatial join – Lars Arge, Octavian Procopiuc, Sridhar Ramaswamy, Torsten Suel, Jeffrey Scott Vitter - 1998
24 Cache Performance Analysis of Traversals and Random Accesses – Richard E. Ladner, James D. Fix, Anthony Lamarca - 1999
BY – Shripad Thite - 804
25 Engineering a cache-oblivious sorting algorithm – Gerth Stølting Brodal, Rolf Fagerberg Kristoffer Vinther - 2004