Frank Dehne, David Hutchinson, Anil Maheshwari, Wolfgang Dittrich  Home/Search
Context Related
Links: ACM DBLP | 134.117.206.17/www/publicati...paper.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 for... (Update)
Cited by: More
Parallelizing the Data Cube - Dehne, Eavis, Hambrusch, Al. (2002) (Correct)
Similar documents (at the sentence level): More
59.0%: Reducing I/O Complexity by Simulating - Coarse Grained Parallel (Correct)
40.0%: Reducing I/O Complexity by Simulating Coarse Grained Parallel.. - Exte Nd Ed (Correct)
35.7%: Parallel Algorithms in External Memory - Hutchinson (2000) (Correct)
Active bibliography (related documents): More All
0.2: Blocking in Parallel Multisearch Problems (Extended.. - Dittrich, Hutchinson.. (1998) (Correct)
0.2: Efficient External-Memory Data Structures and Applications - Arge (1996) (Correct)
0.2: External-Memory Algorithms with Applications in Geographic.. - Arge (1997) (Correct)
Similar documents based on text: More All
1.5: Parallel Virtual Memory - Dehne Dittrich Hutchinson (1998) (Correct)
1.3: Efficient External Memory Algorithms by Simulating.. - Dehne, Dittrich.. (1997) (Correct)
1.0: 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 ACM DBLP
177 Direct Bulk-Synchronous Parallel Algorithms - GERBESSIOTIS, VALIANT - 1994 ACM DBLP
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 ACM DBLP
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 ACM DBLP
50 External memory algorithms (context) - VITTER - 1998 ACM DBLP
48 Efficient parallel graph algorithms for coarse grained multi.. - 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
38 Asymptotically tight bounds for performing BMMC permutations.. - CORMEN, SUNDQUIST et al. - 1994 ACM DBLP
36 Efficient external memory algorithms by simulating coarse-gr.. - DEHNE, DITTRICH et al. - 1997 ACM DBLP
35 Practical parallel algorithms for personalized communication.. - BADER, HELMAN et al. ACM DBLP
35 Permuting information in idealized two-level storage (context) - FLOYD - 1972
31 Algorithms for parallel memory (context) - VITTER, SHRIVER - 1994
30 Bsp-like externalmemory computation - SIBEYN, KAUFMANN - 1997
17 Strategic directions in storage i/o issues in large-scale co.. (context) - GIBSON, VITTER et al. - 1996 ACM DBLP
16 Can parallel algorithms enhance serial implementations - VISHKIN - 1996
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 ACM DBLP
11 From algorithm parallelism to instruction-level parallelism:.. - VISHKIN - 1997 DBLP
9 Blocking in parallel multisearch problems (context) - DITTRICH, HUTCHINSON et al. - 1998 DBLP
9 ACM Workshop on Strategic Directions in Computing Research: .. (context) - CORMEN, GOODRICH - 1996
9 II: Hierarchical multilevel memories (context) - VITTER, SHRIVER - 1994
7 Personal communication (context) - CORMEN - 1997
6 Dagstuhl seminar on data structures (context) - MEHLHORN - 1998
3 Personal communication (context) - VITTER - 1998
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, Dittrich.. (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