David Alexander Hutchinson  Home/Search
Context
Related
| duke.edu/~hutchins/dhthesis.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: duke.edu/~hutchins...Publications (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: External memory (EM) algorithms are designed for computational problems in which the size of the internal memory of the computer is only a small fraction of the problem size. The Parallel Disk Model (PDM) of Vitter and Shriver is widely used to discriminate between external memory algorithms on the basis of input/output (I/O) complexity. Parallel algorithms are designed to efficiently utilize the computing power of multiple processing units, interconnected by a communication mechanism. A... (Update)
Similar documents (at the sentence level):
6.3%: Early Experiences in Implementing the Buffer Tree - Hutchinson, Maheshwari.. (1997) (Correct)
6.2%: Bulk Synchronous Parallel Algorithms for the.. - Dehne, Dittrich.. (2002) (Correct)
Active bibliography (related documents): More All
1.3: Blocking in Parallel Multisearch Problems (Extended.. - Dittrich, Hutchinson.. (1998) (Correct)
1.3: External-Memory Algorithms with Applications in Geographic.. - Arge (1997) (Correct)
0.8: Efficient External-Memory Data Structures and Applications - Arge (1996) (Correct)
Similar documents based on text: More All
1.3: Reducing I/O Complexity by Simulating Coarse.. - Dehne, Dittrich.. (1999) (Correct)
0.4: Parallel Implementation of Geometric Shortest Path Algorithms - Lanthier, Nussbaum, Sack (2003) (Correct)
0.3: Parallel Virtual Memory - Dehne Dittrich Hutchinson (1998) (Correct)
BibTeX entry: (Update)
@misc{ hutchinson-parallel,
author = "David Alexander Hutchinson",
title = "Parallel Algorithms in External Memory",
url = "citeseer.ist.psu.edu/hutchinson00parallel.html" }
Citations (may not include all citations):3972 Introduction to Algorithms (context) - Cormen, Leiserson et al. - 1990
2003 The Art of Computer Programming (context) - Knuth - 1973
735 A bridging model for parallel computation (context) - Valiant - 1990
375 Probability inequalities for sums of bounded random variable.. (context) - Hoeffding - 1963
375 LEDA: A platform for combinatorial and geometric computing - Mehlhorn, Naher - 1995
343 A case for redundant arrays of inexpensive disks (context) - Patterson, Gibson et al. - 1988
284 An introduction to disk drive modeling - Ruemmler, Wilkes - 1994
218 Parallelism in random access machines (context) - Fortune, Wyllie - 1978
210 Cooperating sequential processes (context) - Dijkstra - 1968
177 Direct Bulk-Synchronous Parallel Algorithms - Gerbessiotis, Valiant - 1994
156 reliable secondary storage (context) - Chen, Lee et al. - 1994
141 Synthesis of Parallel Algorithms (context) - Reif - 1993
121 External-memory computational geometry - Goodrich, Tsay et al. - 1993
113 Output complexity of sorting and related problems (context) - Aggarwal, Vitter - 1988
107 External-memory graph algorithms - Chiang, Goodrich et al. - 1995
106 Advanced Programming in the Unix Environment (context) - Stevens - 1995
91 Data Structures and Algorithms 1: Sorting and Searching (context) - Mehlhorn - 1984
83 Handbook of Discrete and Computational Geometry (context) - Goodman, O'Rourke - 1997
82 Hierarchical memory with block transfer (context) - Aggarwal, Chandra et al. - 1987
82 A model for hierarchical memory (context) - Aggarwal, Alpern et al. - 1987
77 Parallel sorting by regular sampling - Shi, Schaeffer - 1992
75 Communication efficient parallel sorting - Goodrich - 1996
72 Logp: A practical model of parallel computation (context) - Culler, Karp et al. - 1996
67 A new data structure for representing sorted lists (context) - Huddleston, Mehlhorn - 1982
67 Integrating theory and practice in parallel file systems - Cormen, Kotz - 1993
64 Scalable parallel computational geometry for coarse grained .. - Dehne, Fabri et al. - 1996
60 The buffer tree: A new technique for optimal I/O-algorithms (context) - Arge - 1995
60 The uniform memory hierarchy model of computation - Alpern, Carter et al. - 1994
59 Deterministic distribution sort in shared and distributed me.. (context) - Nodine, Vitter - 1993
57 Simple randomized mergesort on parallel disks - Barve, Grove et al. - 1997
50 External memory algorithms (context) - Vitter - 1998
49 Virtual Memory for Data Parallel Computing (context) - Cormen - 1992
48 Efficient parallel graph algorithms for coarse grained multi.. - C'aceres, Dehne et al. - 1997
46 Algorithmics: Theory and Practice (context) - Brassard, Bratley - 1988
45 convex hull algorithm for coarse grained multicomputers (context) - Dehne, Deng et al. - 1995
42 Efficient External-Memory Data Structures and Applications - Arge - 1996
41 Blocking for external graph searching - Nodine, Goodrich et al. - 1996
40 Truly efficient parallel algorithms: c-optimal multisearch f.. (context) - Baumker, Dittrich et al. - 1995
38 Asymptotically tight bounds for performing BMMC permutations.. - Cormen, Sundquist et al. - 1999
36 Efficient external memory algorithms by simulating coarse-gr.. - Dehne, Dittrich et al. - 1997
35 Practical parallel algorithms for personalized communication.. - Bader, Helman et al. - 1996
35 Permuting information in idealized two-level storage (context) - Floyd - 1972
33 Fast permuting on disk arrays (context) - Cormen - 1993
31 Algorithms for parallel memory (context) - Vitter, Shriver - 1994
31 Parallel dictionaries on 2-3 trees (context) - Paul, Vishkin et al. - 1983
30 Bsp-like external-memory computation - Sibeyn, Kaufmann - 1997
29 Communication Efficient Data Structures on the BSP Model wit.. - Gerbessiotis, Siniolakis - 1996
29 Batched dynamic solutions to decomposable searching problems (context) - Edelsbrunner, Overmars - 1985
26 efficiency of geometric algorithms: Distribution sweep vs (context) - Chiang, the - 1995
26 complexity of graph algorithms (context) - Munagala, Ranade - 1999
26 Fully dynamic search trees for an extension of the bsp model - Baumker, Dittrich - 1996
22 Early Experiences in Evaluating the Parallel Disk Model with.. - Cormen, Hirschl - 1997
22 range searching in external memory (context) - Vengroff, Vitter et al. - 1996
20 Greed sort: Optimal deterministic sorting on parallel disks (context) - Nodine, Vitter - 1995
18 Paradigms for optimal sorting with multiple disks (context) - Nodine, Vitter - 1993
18 Efficient Algorithms for Computational Geometry and Graph Pr.. (context) - Chiang, O- - 1995
18 BSP vs LogP - Bilardi, Herley et al. - 1996
18 Implementing data structures on a hypercube multiprocessor (context) - Dehne, Rau-Chaplin - 1990
18 MaxPlanckInstitut fur Informatik (context) - Crauser, Mehlhorn et al. - 1998
18 A transparent parallel I/O environment (context) - Vengroff - 1994
15 Multisearch techniques for implementing data structures on a.. (context) - Atallah, Dehne et al. - 1994
14 mpi-forum (context) - Interface, site et al.
14 Performing Out-of-Core FFTs on Parallel Disk Systems - Cormen, Nicol - 1998
13 Parallel virtual memory - Dehne, Dittrich et al. - 1998
13 A general lower bound on the I/Ocomplexity of comparison-bas.. (context) - Arge, Knudsen et al. - 1993
13 complexity by simulating coarse grained parallel algorithms (context) - Dehne, Dittrich et al. - 1999
12 efficient algorithms for contour-line extraction and planar .. (context) - Agarwal, Arge et al. - 1998
12 Caltech Concurrent Supercomputing Facilities (context) - Poole, of et al. - 1994
9 ACM Workshop on Strategic Directions in Computing Research: .. (context) - Cormen, Goodrich - 1996
9 efficient scientific computation in TPIE (context) - Vengroff, Vitter et al. - 1995
9 Blocking in parallel multisearch problems (context) - Dittrich, Hutchinson et al. - 1998
9 II: Hierarchical multilevel memories (context) - Vitter, Shriver et al. - 1994
9 Coarse grained parallel next element search (context) - Chan, Dehne et al. - 1997
9 Guest Editor's Introduction in IEEE Computer (context) - Patt, candidate et al. - 1994
6 Early experiences in implementing the buffer tree - Hutchinson, Maheshwari et al. - 1997
6 Multiprocessor Out-of-Core FFTs with Distributed Memory and .. - Cormen, Wegmann et al. - 1997
5 External memory algorithms with dynamically changing memory .. - Barve, Vitter - 1998
5 Available via WWW at http://www (context) - Vengroff, Manual et al. - 1995
4 A Compiler for Virtual-Memory C (context) - Colvin, Cormen - 1997
3 Efficient Parallel Data Structures (context) - Dittrich - 1997
2 An external-memory data structure for shortest path queries (context) - Zeh - 1998
2 Faster algorithms for the shortest path problem (context) - Ahulja, Mehlhorn et al. - 1990
1 CGM Algorithms as EM-CGM Algorithms (context) - Yogaratnam - 1998
1 Concurrent Supercomputing Consortium (context) - Initiative
1 On Parallel Data Structures and Parallel Geometric Applicati.. (context) - Rau-Chaplin - 1992
1 Design considerations for scalable parallel file systems (context) - Hellwagner - 1993
1 BSP vs LogP (context) - Alexandrov, Ionescu et al. - 1995
Documents on the same site (http://www.cs.duke.edu/~hutchins/Publications.html): More
Parallel Neighbourhood Modelling - Hutchinson, Lanthier, Maheshwari.. (Correct)
The Power of Duality for Prefetching and Sorting with.. - Hutchinson, Sanders.. (Correct)
Duality Between Prefetching and Queued Writing with.. - Hutchinson, Sanders.. (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