David A. Hutchinson, Peter Sanders, Jeffrey Scott Vitter  Home/Search
Context Related
| duke.edu/~hutchins/duality.ps 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/~hutchins...Publications (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Parallel disks promise to be a cost effective means for achieving high bandwidth in applications involving massive data sets, but algorithms for parallel disks can be difficult to devise. To combat this problem, we define a useful and natural duality between writing to parallel disks and the seemingly more difficult problem of prefetching. We explore this duality for applications involving read-once accesses using parallel disks. We get a simple linear time algorithm for computing optimal... (Update)
Context of citations to this paper: More
...applications. Our analysis of RCD has subsequently been applied to optimal design and analysis of merge sort for parallel disks [12]. We can also use RCD to simulate a large class of algorithms for the Aggarwal Vitter I O model on the parallel disk model. In many cases, in...
.... approach the lower bound of 2N DB log M B N B I Os for sorting N elements using D disks, fast memory of size M , and blocks of size B [12]. These algorithms are so close to algorithms used in practice that theory and practice seem to be in harmony here. However, at least two...
Cited by: More
Scheduling with QoS in Parallel I/O systems - Gulati, Varman (2004) (Correct)
Algorithms for Scalable Storage Servers - Sanders (2004) (Correct)
Asynchronous Parallel Disk Sorting - Dementiev, Sanders (2003) (Correct)
Similar documents (at the sentence level):
7.5%: Duality Between Prefetching and Queued Writing with.. - Hutchinson, Sanders.. (2001) (Correct)
Active bibliography (related documents): More All
0.4: Distribution Sort with Randomized Cycling - Vitter, Hutchinson (2001) (Correct)
0.3: Foundations Of Time-Critical Scalable Computing - McColl (1998) (Correct)
0.3: The Power of Duality for Prefetching and Sorting with.. - Hutchinson, Sanders.. (Correct)
Similar documents based on text: More All
0.5: A Simple and Efficient Parallel Disk Mergesort - Barve, Vitter (1999) (Correct)
0.4: Simple Randomized Mergesort on Parallel Disks - Barve, Grove, Vitter (1996) (Correct)
0.4: Fast Concurrent Access to Parallel Disks - Sanders, Egner, Korst (1999) (Correct)
Related documents from co-citation: More All
3: Simple randomized mergesort on parallel disks - Barve, Grove et al. - 1996
3: Fast Concurrent Access to Parallel Disks - Sanders, Egner et al. - 1999
2: External memory algorithms and data structures: Dealing with MASSIVE DATA - Vitter - 2000
BibTeX entry: (Update)
D. A. Hutchinson, P. Sanders, and J. S. Vitter. Duality between prefetching and queued writing with applications to integrated caching and prefetching and to external sorting. In Proceedings of the European Symposium on Algorithms, volume 2161 of Lecture Notes in Computer Science, Arhus, Denmark, August 2001. Springer-Verlag. http://citeseer.ist.psu.edu/article/hutchinson01duality.html More
@article{ hutchinson01duality,
author = "David A. Hutchinson and Peter Sanders and Jeffrey Scott Vitter",
title = "Duality between Prefetching and Queued Writing with Parallel Disks",
journal = "Lecture Notes in Computer Science",
volume = "2161",
pages = "62--??",
year = "2001",
url = "citeseer.ist.psu.edu/article/hutchinson01duality.html" }
Citations (may not include all citations):735 A bridging model for parallel computation (context) - Valiant - 1994
232 A study of replacement algorithms for virtual storage comput.. (context) - Belady - 1966
159 Tight Bounds on the Complexity of Parallel Sorting (context) - Leighton - 1985
157 The Art of Computer Programming --- Sorting and Searching (context) - Knuth - 1998
109 InputOutput complexity sorting and related problem (context) - Vitter, Output et al. - 1988
78 Implementation and performance of integrated application-con.. - Cao, Felten et al. - 1996
59 Deterministic distribution sort in shared and distributed me.. (context) - Nodine, Vitter - 1993
59 External memory algorithms and data structures: Dealing with.. - Vitter - 1999
57 Simple randomized mergesort on parallel disks - Barve, Grove et al. - 1997
36 Efficient external memory algorithms by simulating coarse-gr.. - Dehne, Dittrich et al. - 1997
32 Near-optimal parallel prefetching and caching - Kimbrel, Karlin - 2000
30 BSP-like external-memory computation - Sibeyn, Kaufmann - 1997
22 Minimizing stall time in single and parallel disk systems - Albers, Garg et al. - 1998
21 Fast concurrent access to parallel disks - Sanders, Egner et al. - 2000
15 Greed Sort: An optimal sorting algorithm for multiple disks (context) - Nodine, Vitter - 1995
13 complexity by simulating coarse grained parallel algorithms (context) - Dehne, Hutchinson et al. - 1999
9 Optimal read-once parallel disk scheduling - Kallahalla, Varman - 1999
6 Optimal prefetching and caching for parallel I/O systems (context) - Kallahalla, Varman - 2001
6 A simple and efficient parallel disk mergesort - Barve, Vitter - 1999
5 Distribution sort with randomized cycling - Vitter, Hutchinson - 2001
3 A bridging model for parallel computation (context) - Cormen, Goodrich - 1996
1 29 Function throttledWriting (context) - Vitter, Shriver et al. - 1994
Documents on the same site (http://www.cs.duke.edu/~hutchins/Publications.html): More
Parallel Algorithms in External Memory - Hutchinson (2000) (Correct)
Parallel Neighbourhood Modelling - Hutchinson, Lanthier, Maheshwari.. (Correct)
The Power of Duality for Prefetching and Sorting with.. - Hutchinson, Sanders.. (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