Frank Dehne, Wolfgang Dittrich, David Hutchinson, Anil Maheshwari  Home/Search
Context Related
Links: ACM DBLP | 134.117.206.17/www/publ...paperlong.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: 134.117.206.17/www/public...index (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Block-wise 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 deterministic simulation technique which transforms parallel algorithms into (parallel) external memory algorithms. Specifically, we present a deterministic simulation technique which transforms Coarse Grained Multicomputer (CGM) algorithms into external memory algorithms... (Update)
Cited by: More
Parallelizing the Data Cube - Dehne, Eavis, Hambrusch, Al. (2002) (Correct)
Similar documents (at the sentence level): More
55.7%: Reducing I/O Complexity by Simulating Coarse Grained Parallel.. - Exte Nd Ed (Correct)
32.9%: Reducing I/O Complexity by Simulating - Coarse Grained Parallel (Correct)
28.9%: Parallel Algorithms in External Memory - Hutchinson (2000) (Correct)
Active bibliography (related documents): More All
0.5: Efficient External-Memory Data Structures and Applications - Arge (1996) (Correct)
0.4: External-Memory Algorithms with Applications in Geographic.. - Arge (1997) (Correct)
0.3: DOI: 10.1007/s00453-002-1009-y - Algorithmica Algorithmica.. (Correct)
Similar documents based on text: More All
1.2: Efficient External Memory Algorithms by Simulating.. - Dehne, Dittrich.. (1997) (Correct)
1.0: Parallel Virtual Memory - Dehne Dittrich Hutchinson (1998) (Correct)
0.9: Early Experiences in Implementing the Buffer Tree - Hutchinson, Maheshwari.. (1997) (Correct)
Related documents from co-citation: More All
4: BSP-like ExternalMemory Computation - Sibeyn, Kaufmann
4: Implementing data cubes efficiently - Harinarayan, Rajaraman et al. - 1996
4: Parallel virtual memory - Dehne, Dittrich et al. - 1998
BibTeX entry: (Update)
F. Dehne, D. Hutchinson, and A. Maheshwari, "Reducing i/o complexity by simulating coarse grained parallel algorithms," in Proc. 13th International Parallel Processing Symposium (IPPS'99), 1999, pp. 14--20. http://citeseer.ist.psu.edu/article/dehne99reducing.html More
@misc{ dehne99reducing,
author = "F. Dehne and D. Hutchinson and A. Maheshwari",
title = "Reducing i/o complexity by simulating coarse grained parallel algorithms",
text = "F. Dehne, D. Hutchinson, and A. Maheshwari, Reducing i/o complexity by
simulating coarse grained parallel algorithms, in Proc. 13th International
Parallel Processing Symposium (IPPS'99), 1999, pp. 14--20.",
year = "1999",
url = "citeseer.ist.psu.edu/article/dehne99reducing.html" }
Citations (may not include all citations):735 A bridging model for parallel computation (context) - Valiant - 1990
177 Direct Bulk-Synchronous Parallel Algorithms - Gerbessiotis, Valiant - 1994 ACM DBLP
121 External-memory computational geometry - Goodrich, Tsay et al. - 1993
109 The Input /Output complexity of sorting and related problems (context) - Aggarwal, Vitter - 1988
109 Scalable parallel geometric algorithms for coarse grained mu.. - Dehne, Fabri et al. - 1993
107 External-memory graph algorithms - Chiang, Goodrich et al. - 1995 ACM DBLP
106 Advanced Programming in the Unix Environment (context) - Stevens - 1995 ACM
75 Communication efficient parallel sorting - Goodrich - 1996
59 Deterministic distribution sort in shared and distributed me.. (context) - Nodine, Vitter - 1993
50 External-memory algorithms for processing line segments in g.. - Arge, Vengroff et al. - 1995
50 External memory algorithms (context) - Vitter - 1998 ACM DBLP
48 Efficient parallel graph algorithms for coarse grained multi.. - C'aceres, Dehne et al. - 1997 ACM DBLP
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 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
36 Efficient external memory algorithms by simulating coarse-gr.. - 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. ACM DBLP
31 Algorithms for parallel memory (context) - Vitter, Shriver - 1994
30 Bsp-like external-memory computation - Sibeyn, Kaufmann - 1997
30 The buffer tree: A new technique for optimal I/O-algorithms (context) - Arge - 1995
24 complexity of ordered binary-decision diagram manipulation (context) - Arge, The - 1995
21 Optimal parallel sorting in multi-level storage - Aggarwal, Plaxton - 1994 ACM DBLP
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
17 Strategic directions in storage i/o issues in large-scale co.. (context) - Gibson, Vitter et al. - 1996 ACM DBLP
17 the parallel decomposability of geometric problems (context) - Atallah, Tsay - 1992
16 Can parallel algorithms enhance serial implementations - Vishkin - 1996
15 Models and resource metrics for parallel and distributed com.. - Li, Mills et al. - 1996 ACM DBLP
15 Annals of Mathematics and Artificial Intellegence (context) - Ullman, Yannakakis - 1991
14 A general lower bound on the I/O-complexity of comparison-ba.. - Arge, Knudsen et al. - 1993 ACM DBLP
13 Parallel Virtual Memory - Dehne, Dittrich et al. - 1999
11 From algorithm parallelism to instruction-level parallelism:.. - Vishkin - 1997
9 ACM Workshop on Strategic Directions in Computing Research: .. (context) - Cormen, Goodrich - 1996
9 Blocking in parallel multisearch problems (context) - Dittrich, Hutchinson et al. - 1998 DBLP
9 II: Hierarchical multilevel memories (context) - Vitter, Shriver - 1994
7 Personal communication (context) - Cormen - 1997
6 Dagstuhl seminar on data structures (context) - Mehlhorn - 1998
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.17/www/publications/publ/2-50/index.html):
Reducing I/O Complexity by Simulating Coarse.. - Dehne.. (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