Loading...
Please wait, while we are loading the content...
Similar Documents
Efficient Sorting Using Registers and Caches (2002)
| Content Provider | CiteSeerX |
|---|---|
| Author | Wickremesinghe, Rajiv Arge, Lars Chase, Jeff Vitter, Jeffrey Scott |
| Abstract | This paper explores the e#ect of memory system features on sorting performance. We introduce a new cache-conscious sorting algorithm, R-merge, which achieves better performance in practice over algorithms that are superior in the theoretical models. Rmerge is designed to minimize memory stall cycles rather than cache misses by considering features common to many system designs |
| File Format | |
| Volume Number | 7 |
| Journal | ACM Journal of Experimental Algorithmics |
| Language | English |
| Publisher Date | 2002-01-01 |
| Access Restriction | Open |
| Subject Keyword | Cache Miss Memory System Many System Design Memory Stall Cycle Theoretical Model New Cache-conscious Sorting Algorithm |
| Content Type | Text |
| Resource Type | Article |
