Frank Dehne, Wolfgang Dittrich, David Hutchinson  Home/Search
Context Related
| unipaderborn.de/~alcom...extmem.ps.gz unipaderborn.de/f...rich.97.spaa.ps.gz scs.carleton.ca/~hutchi...ddh97_spaa.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: unipaderborn.de/~alco...Publ1997 (more) From: unipaderborn.de/sfb376/p...node9 (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. For certain large scale applications this is necessarily true. Typically, the cost models proposed for external memory algorithms have measured only the number of I/O operations, and the algorithms have been specially crafted for the EM situation. In the past, several attempts have been made to relate the large body of... (Update)
Cited by: More
Algorithmica (1999) 24: 173--176 - Algorithmica Springer-Verlag New (Correct)
Reducing I/O Complexity by Simulating - Coarse Grained Parallel (Correct)
Parallelizing the Data Cube - Dehne, Eavis, Hambrusch, Al. (2002) (Correct)
Similar documents (at the sentence level): More
24.5%: Efficient External Memory Algorithms by Simulating.. - Dehne, Dittrich, al. (2003) (Correct)
24.5%: DOI: 10.1007/s00453-002-1009-y - Algorithmica Algorithmica.. (Correct)
20.2%: Parallel Algorithms in External Memory - Hutchinson (2000) (Correct)
Active bibliography (related documents): More All
0.4: External-Memory Algorithms with Applications in Geographic.. - Arge (1997) (Correct)
0.3: Efficient External-Memory Data Structures and Applications - Arge (1996) (Correct)
0.3: Early Experiences in Implementing the Buffer Tree - Hutchinson, Maheshwari.. (1997) (Correct)
Similar documents based on text: More All
1.3: Reducing I/O Complexity by Simulating Coarse.. - Dehne.. (1999) (Correct)
0.5: Coarse-Grained Parallel Geometric Search - Chan, Dehne, Rau-Chaplin (1999) (Correct)
0.4: Coarse Grained Parallel On-Line Analytical Processing.. - Dehne, Eavis.. (2001) (Correct)
Related documents from co-citation: More All
24: BSP-like ExternalMemory Computation - Sibeyn, Kaufmann
19: External memory algorithms (context) - Vitter - 1998
17: A bridging model for parallel computation (context) - Valiant - 1990
BibTeX entry: (Update)
F. Dehne, W. Dittrich, and D. Hutchinson. Efficient external memory algorithms by simulating coarsegrained parallel algori thms. ACM Symposium on Parallel Algorithms and Architectures, pp. 106--115, 1997. http://citeseer.ist.psu.edu/article/dehne97efficient.html More
@inproceedings{ dehne97efficient,
author = "Frank K. H. A. Dehne and Wolfgang Dittrich and David Hutchinson",
title = "Efficient External Memory Algorithms by Simulating Coarse-Grained Parallel Algorithms",
booktitle = "{ACM} Symposium on Parallel Algorithms and Architectures",
pages = "106-115",
year = "1997",
url = "citeseer.ist.psu.edu/article/dehne97efficient.html" }
Citations (may not include all citations):735 A Bridging Model for Parallel Computation (context) - Valiant - 1990
375 Probability inequalities for sums of bounded random variable.. (context) - Hoeffding - 1963
177 Direct BulkSynchronous Parallel Algorithms - Gerbessiotis, Valiant - 1994
121 External Memory Computational Geometry - Goodrich - 1993
113 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 - 1995
60 The Uniform Memory Hierarchy Model of Computation - Alpern - 1994
60 The Buffer Tree: A New Technique for Optimal I/O-Algorithms (context) - Arge - 1995
50 External-Memory Algorithms for Processing Line Segments in G.. - Arge, Vengroff et al. - 1995
49 Virtual Memory for Data Parallel Computing (context) - Cormen - 1992
48 range Tree: A New Data Structure for Range Searching in Seco.. (context) - Subramanian, Ramaswamy - 1995
47 Scalable and Architecture Independent Parallel Geometric Alg.. - Dehne, Fabri et al. - 1994
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
31 Algorithms for Parallel Memory (context) - Vitter, Shriver - 1994
31 Efficient Scientific Computation Using TPIE (context) - Vengroff, Vitter et al. - 1995
30 BSP-like ExternalMemory Computation - Sibeyn, Kaufmann
23 Large Scale Sorting in Uniform Memory Hierarchies - Vitter, Nodine - 1993
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 - 1995
16 Parallel Algorithms for Image Processing: Practical Algorith.. (context) - Baumker, Dittrich - 1996
16 Trees and Their Applications (context) - Callahan, Goodrich et al. - 1995
11 The Deterministic Complexity of Parallel Multisearch (context) - Baumker, Dittrich et al. - 1996
7 TPIE User Manual and Reference (context) - Vengroff - 1995
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.uni-paderborn.de/~alcom-it/publications/1997/Publ1997.html): More
Experimental Validation of Parallel Computation Models on the.. - Ben Juurlink (1998) (Correct)
Playing Tetris on Meshes and Multi-Dimensional SHEARSORT - Kutylowski, Wanka (1997) (Correct)
Exploiting Locality for Data Management in Systems .. - Maggs, der Heide, .. (1997) (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