Lars Arge, Jeff Chase, Jeffrey S. Vitter, Rajiv Wickremesinghe  Home/Search
Context Related
| duke.edu/~rajiv/papers/waesort.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: duke.edu/~rajiv/papers...rajivown (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Modern computer systems have increasingly complex memory systems.Common machine models for algorithm analysis do not reflect many of the features... (Update)
Context of citations to this paper: More
...the focus of PhD student Wei Jin s dissertation. The TerraFlow watershed modeling software [5] and a study of cache efficient sorting [6] are other recent products of these collaborations. We increasingly focus on wide area sharing of data repositories, a problem that has much...
...each array separately, etc. While we cannot measure exactly how much we gain from this approach, studies of cache aware algorithms [1, 13, 21 23, 45] indicate that the gain is likely to be substantial factors of anywhere from 2 to 40 have been reported. New memory hierarchies...
Cited by: More
Industrial Applications of High-Performance Computing for.. - Bader, Moret, Vawter (2001) (Correct)
Reconstructing Optimal Phylogenetic Trees: A Challenge in.. - Moret, Warnow (Correct)
High-Performance Algorithm Engineering for Computational.. - Moret, Bader, Warnow (2002) (Correct)
Similar documents (at the sentence level):
23.4%: Copyright C - By Rajiv Wickremesinghe (Correct)
21.6%: Efficient Sorting Using Registers and Caches - Wickremesinghe, Arge, Chase.. (Correct)
Active bibliography (related documents): More All
0.5: Algorithm Engineering for Parallel Computation - Bader, Moret, Sanders (2002) (Correct)
0.4: Scanning Multiple Sequences Via Cache Memory - Mehlhorn, Sanders (2003) (Correct)
0.3: Algorithms and Experiments: The New (and Old) Methodology - Moret, Shapiro (Correct)
Similar documents based on text: More All
0.4: Distributed Computing with Load-Managed Active Storage - Wickremesinghe, Chase, Vitter (2002) (Correct)
0.2: Flow Computation on Massive Grid Terrains - Arge, Chase, Halpin, Toma.. (2001) (Correct)
0.2: Flow Computation on Massive Grids - Toma, Wickremesinghe, Arge, Chase.. (2001) (Correct)
Related documents from co-citation: More All
7: The influence of caches on the performance of heaps - LaMarca, Ladner - 1996
4: A new implementation and detailed study of breakpoint analysis - Moret, Wyman et al. - 2001
4: The cache performance of traversals and random accesses (context) - Ladner, Fix et al. - 1999
BibTeX entry: (Update)
L. Arge, J. Chase, J. Vitter, and R. Wickremesinghe, "Efficient sorting using registers and caches," in Proceedings of the 4th Workshop on Algorithm Engineering (WAE 2000), Springer-Verlag, (Saarbrucken, Germany), Sept. 2000. http://citeseer.ist.psu.edu/arge00efficient.html More
@article{ arge01efficient,
author = "Lars Arge and Jeff Chase and Jeffrey S. Vitter and Rajiv Wickremesinghe",
title = "Efficient Sorting Using Registers and Caches",
journal = "Lecture Notes in Computer Science",
volume = "1982",
pages = "51--??",
year = "2001",
url = "citeseer.ist.psu.edu/arge00efficient.html" }
Citations (may not include all citations):1575 Computer Architecture: A Quantitative Approach (context) - Hennessy, Patterson - 1995
376 The cache performance and optimizations of blocked algorithm.. (context) - Lam, Rothberg et al. - 1991
250 volume 3 of The Art of Computer Programming (context) - Knuth, Searching - 1998
158 Improving register allocation for subscripted variables - Callahan, Carr et al. - 1990
121 Continuous profiling: Where have all the cycles gone - Anderson, Berc et al. - 1997
109 InputOutput complexity sorting and related problem (context) - Vitter, Output et al. - 1988
82 A model for hierarchical memory (context) - Aggarwal, Alpern et al. - 1987
40 The influence of caches on the performance of sorting - LaMarca, Ladner - 1997
19 Fast priority queues for cached memory - Sanders - 1999
19 Towards a theory of cache-efficient algorithms - Sen, Chatterjee - 2000
8 Accessing multiple sequences through set associative caches - Sanders - 1999
5 Cache performance analysis of traversals and random accesses - Ladner, Fix et al. - 1999
3 Adapting radix sort to the memory hierarchy - Rahman, Raman - 2000
3 Analysing cache effects in distribution sorting (context) - Rahman, Raman - 1999
1 Digital Unix Documentation Library (context) - Guide
Documents on the same site (http://www.cs.duke.edu/~rajiv/papers/rajivown.html): More
The Link Database: Fast Access to Graphs of the Web - Randall, Stata.. (2001) (Correct)
The Performance of in-Memory Sorting - Wickremesinghe (1999) (Correct)
The Link Database: Fast Access to Graphs of the Web - Randall, Stata.. (2001) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC