Kurt Mehlhorn, Peter Sanders  Home/Search
Context Related
| mpisb.mpg.de/~sander...icalpfull.ps.gz 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: mpisb.mpg.de/~sanders/pa...index (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We consider the simple problem of scanning multiple sequences. There are k sequences of total length N which are to be scanned concurrently. One pointer into each sequence is maintained and an adversary specifies which pointer is to be advanced. The concept of scanning multiple sequence is ubiquitous in algorithms designed for hierarchical memory. (Update)
Cited by: More
Super Scalar Sample Sort - Sanders, Winkel (2004) (Correct)
Similar documents (at the sentence level):
78.7%: Scanning Multiple Sequences Via Cache Memory - Kurt Mehlhorn Peter (2003) (Correct)
Active bibliography (related documents): More All
0.8: Accessing Multiple Sequences Through Set Associative Caches - Sanders (1999) (Correct)
0.4: Efficient Sorting Using Registers and Caches - Arge, Chase, Vitter.. (2000) (Correct)
0.2: Towards a Theory of Cache-Efficient Algorithms - Sen, Chatterjee, Dumir (1999) (Correct)
Similar documents based on text: More All
0.3: A Parallelization of Dijkstra's Shortest Path Algorithm - Crauser, Mehlhorn, Meyer.. (1998) (Correct)
0.2: Basic Approaches to Optimization Problems - Sanders (Correct)
0.2: All-Pairs Shortest-Paths Computation in the.. - Mehlhorn, Priebe, .. (2001) (Correct)
BibTeX entry: (Update)
K. Mehlhorn and P. Sanders. Scanning multiple sequences via cache memory. Algorithmica, 35(1):75--93, 2003. http://citeseer.ist.psu.edu/article/mehlhorn03scanning.html More
@misc{ mehlhorn03scanning,
author = "K. Mehlhorn and P. Sanders",
title = "Scanning multiple sequences via cache memory",
text = "K. Mehlhorn and P. Sanders. Scanning multiple sequences via cache memory.
Algorithmica, 35(1):75--93, 2003.",
year = "2003",
url = "citeseer.ist.psu.edu/article/mehlhorn03scanning.html" }
Citations (may not include all citations):1575 Computer Architecture a Quantitative Approach (context) - Hennessy, Patterson - 1996
196 How to emulate shared memory (context) - Ranade - 1991
107 External memory graph algorithms - Chiang, Goodrich et al. - 1995
106 Microprocessor User's Manual (context) - Technologies - 1998
64 Cache-oblivious algorithms (context) - Frigo, Leiserson et al. - 1999
61 Alphasort: A RISC machine sort (context) - Nyberg, Barclay et al. - 1994
57 Simple randomized mergesort on parallel disks - Barve, Grove et al. - 1997
50 External memory algorithms (context) - Vitter
40 The influence of caches on the performance of sorting - LaMarca, Ladner - 1997
36 Efficient external memory algorithms by simulating coarse-gr.. - Dehne, Dittrich et al. - 1997
30 The buffer tree: A new technique for optimal I/O-algorithms (context) - Arge
30 BSP-like external-memory computation - Sibeyn, Kaufmann - 1997
19 Fast priority queues for cached memory - Sanders - 1999
19 Towards a theory of cache-efficient algorithms - Sen, Chatterjee - 2000
13 Information Processing Letters - Sanders, on et al. - 1998
9 From parallel to external list ranking (context) - Sibeyn - 1997
8 Accessing multiple sequences through set associative caches - Sanders - 1999
5 Cache performance analysis of traversals and random access - Ladner, Fix et al. - 1999
2 An analytical cache model - Fricker, Robert - 1991
1 Analysing cache effects in distributed sorting (context) - Rahman, Raman - 1999
1 Matrix multiplication: A case study of algorithm engineering - Eiron, Rodeh et al. - 1998
1 The flashsort1 algorithm (context) - Neubert - 1998
1 Granularity of memory in parallel computation (context) - Mehlhorn, Vishkin - 1984
Documents on the same site (http://www.mpi-sb.mpg.de/~sanders/papers/index.html): More
Better Algorithms for Parallel Backtracking - Sanders (1995) (Correct)
Asynchronous Random Polling Dynamic Load Balancing - Sanders (Correct)
A Parallelization of Dijkstra's Shortest Path Algorithm - Crauser, Mehlhorn, Meyer.. (1998) (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