(Enter summary)
Abstract: Blockwise access to data is a central theme in the design of efficient external
memory (EM) algorithms. A second important issue, when more than one disk
is present, is fully parallel disk I/O. In this paper we present a simple, deterministic
simulation technique which transforms certain Bulk Synchronous Parallel (BSP)
algorithms into efficient parallel EM algorithms. It optimizes blockwise data access
and parallel disk I/O and, at the same time, utilizes multiple processors connected
via a... (Update)
Cited by: More
DOI: 10.1007/s00453-006-1213-2 - Algorithmica Algorithmica Springer
(Correct)
Guest Editor's Introduction - Dehne (2006)
(Correct)
Similar documents (at the sentence level): More
31.1%: Parallel Algorithms in External Memory - Hutchinson (2000)
(Correct)
17.1%: DOI: 10.1007/s00224-002-1066-2 - Theory Comput Systems
(Correct)
11.7%: Reducing I/O Complexity by Simulating Coarse.. - Dehne.. (1999)
(Correct)
Active bibliography (related documents): More All
0.5: Efficient External Memory Algorithms by Simulating.. - Dehne, Dittrich, al. (2003)
(Correct)
0.5: DOI: 10.1007/s00453-002-1009-y - Algorithmica Algorithmica..
(Correct)
0.5: Efficient External-Memory Data Structures and Applications - Arge (1996)
(Correct)
Similar documents based on text: More All
0.2: A Randomized Parallel Three-Dimensional Convex Hull.. - Dehne, Deng, Dymond, al. (1997)
(Correct)
0.1: Efficient Parallel Graph Algorithms for.. - Dehne, Ferreira.. (2002)
(Correct)
0.1: Verifying Functional Bulk Synchronous Parallel Programs Using .. - Gava, Loulergue (2003)
(Correct)
Related documents from co-citation: More All
2: Scalable Parallel Geometric Algorithms for Coarse Grained Multicomputers
- Dehne, Fabri et al. - 1993
2: Parallel rolap data cube construction on shared-nothing multiprocessors
- Chen, Dehne et al. - 2002
2: Efficient parallel graph algorithms for coarse grained multicomputers and BSP
- Caceres, Dehne et al. - 1997
BibTeX entry: (Update)
F. Dehne, W. Dittrich, D. Hutchinson, and A. Maheshwari. Bulk synchronous parallel algorithms for the external memory model. Theory of Computing Systems, 35(6):567--598, 2002. http://citeseer.ist.psu.edu/dehne02bulk.html More
@misc{ dehne02bulk,
author = "F. Dehne and W. Dittrich and D. Hutchinson and A. Maheshwari",
title = "Bulk synchronous parallel algorithms for the external memory model",
text = "F. Dehne, W. Dittrich, D. Hutchinson, and A. Maheshwari. Bulk synchronous
parallel algorithms for the external memory model. Theory of Computing Systems,
35(6):567--598, 2002.",
year = "2002",
url = "citeseer.ist.psu.edu/dehne02bulk.html" }
Citations (may not include all citations):
3972
Introduction to Algorithms (context) - Cormen, Leiserson et al. - 1990 ACM
981
An Introduction to Parallel Algorithms and Architectures (context) - Leighton - 1992
735
A bridging model for parallel computation (context) - Valiant - 1990
218
Parallelism in random access machines (context) - Fortune, Wyllie - 1978 ACM DBLP
177
Direct bulk-synchronous parallel algorithms
- Gerbessiotis, Valiant - 1994 ACM DBLP
141
Synthesis of Parallel Algorithms (context) - Reif - 1993 ACM
135
An Introduction to Parallel Algorithms (context) - Jaja - 1992
121
External-memory computational geometry
- Goodrich, Tsay et al. - 1993
109
inputoutput complexity sorting and related problem (context) - Vitter, output et al. - 1988
107
External-memory graph algorithms
- Chiang, Goodrich et al. - 1995
106
Advanced Programming in the Unix Environment (context) - Stevens - 1995 ACM
83
Handbook of Discrete and Computational Geometry (context) - Goodman, O'Rurke - 1997 ACM
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 DBLP
64
Scalable parallel computational geometry for coarse grained ..
- Dehne, Fabri et al. - 1996 DBLP
59
Deterministic distribution sort in shared and distributed me.. (context) - Nodine, Vitter - 1993 ACM DBLP
50
External memory algorithms (context) - Vitter - 1998 ACM DBLP
50
External-memory algorithms for processing line segments in g..
- Arge, Vengroff et al. - 1995
48
Efficient parallel graph algorithms for coarse grained multi..
- Caceres, Dehne et al. - 1997
45
convex hull algorithm for coarse grained multicomputers (context) - Dehne, Deng et al. - 1995
42
Efficient External-Memory Data Structures and Applications
- Arge - 1996
40
Truly efficient parallel algorithms: c-optimal multisearch f.. (context) - Baumker, Dittrich et al. - 1995
40
Improved algorithms and data structures for solving graph pr..
- Kumar, Schwabe - 1996 ACM
38
Asymptotically tight bounds for performing BMMC permutations..
- Cormen, Sundquist et al. - 1994 ACM DBLP
36
Efficient external memory algorithms by simulating coarsegra..
- Dehne, Dittrich et al. - 1997
35
Permuting information in idealized two-level storage (context) - Floyd - 1972
35
Practical parallel algorithms for personalized communication..
- Bader, Helman et al. - 1996 ACM DBLP
31
Algorithms for parallel memory (context) - Vitter, Shriver - 1994
30
BSP-like external-memory computation
- Sibeyn, Kaufmann - 1997 ACM DBLP
30
The buffer tree: a new technique for optimal I/O-algorithms (context) - Arge - 1995
26
complexity of graph algorithms (context) - Munagala, Ranade - 1999
24
complexity of ordered binary-decision diagram manipulation (context) - Arge, O- - 1995
21
Optimal parallel sorting in multi-level storage
- Aggarwal, Plaxton - 1994
20
Greed sort: optimal deterministic sorting on parallel disks (context) - Nodine, Vitter - 1995 DBLP
18
Paradigms for optimal sorting with multiple disks (context) - Nodine, Vitter - 1993
17
the parallel decomposability of geometric problems (context) - Atallah, Tsay - 1992
17
Strategic directions in storage I/O issues in large-scale co.. (context) - Gibson, Vitter et al. - 1996 ACM DBLP
15
Annals of Mathematics and Artificial Intellegence (context) - Ullman, Yannakakis et al. - 1991
15
Models and resource metrics for parallel and distributed com..
- Li, Mills et al. - 1996 ACM DBLP
14
A general lower bound on the I/O-complexity of comparisonbas..
- Arge, Knudsen et al. - 1993
13
An external memory data structure for shortest path queries
- Hutchinson, Maheshwari et al. - 1999 ACM DBLP
9
Blocking in parallel multisearch problems (context) - Dittrich, Hutchinson et al. - 2001
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
ACMWorkshop on Strategic Directions in Computing Research: w.. (context) - Cormen, Goodrich - 1996
7
Personal communication (context) - Cormen - 1997
5
Randomized external memory algorithms for geometric problems (context) - Crauser, Ferragina et al. - 1998
3
Personal communication (context) - Vitter - 1998
2
Algorithmic Foundations of Geographic Information Systems (context) - van Kreveld, Nievergelt et al. - 1997
Documents on the same site (http://134.117.206.249:8000/www/publications/index.htm): More
Parallelizing the Data Cube - Dehne, Eavis, Hambrusch, Rau-Chaplin (2002)
(Correct)
Parallelizing the Data Cube - Dehne, Eavis, Hambrusch, Rau-Chaplin (2002)
(Correct)
Coarse-Grained Parallel Geometric Search - Chan, Dehne, Rau-Chaplin (1999)
(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