See this document in CiteSeerX!

Efficient External Memory Algorithms by Simulating Coarse-Grained Parallel Algorithms (2003)  (Make Corrections)  (36 citations)
Frank Dehne, Wolfgang Dittrich, et al.
ACM Symposium on Parallel Algorithms and Architectures



  Home/Search   Context   Related

 
View or download:
134.117.206.249:8080/www/pub...138.pdf
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  134.117.206.249:8080/www/...index (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: External memory (EM) algorithms are designed for large-scale computational problems in which the size of the internal memory of the computer is only a small fraction of the problem size. Typical EM algorithms are specially crafted for the EM situation. In the past, several attempts have been made to relate the large body of work on parallel algorithms to EM, but with limited success. The combination of EM computing, on multiple disks, with multiprocessor parallelism has been posted as a... (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):
35.9%:   Efficient External Memory Algorithms by Simulating.. - Dehne, Dittrich, al. (2003)   (Correct)
35.9%:   DOI: 10.1007/s00453-002-1009-y - Algorithmica Algorithmica..   (Correct)
21.7%:   Parallel Algorithms in External Memory - Hutchinson (2000)   (Correct)

Active bibliography (related documents):   More   All
0.5:   Bulk Synchronous Parallel Algorithms for the.. - Dehne, Dittrich.. (2002)   (Correct)
0.4:   Blocking in Parallel Multisearch Problems (Extended.. - Dittrich, Hutchinson.. (1998)   (Correct)
0.3:   Reducing I/O Complexity by Simulating Coarse.. - Dehne, Dittrich.. (1999)   (Correct)

Similar documents based on text:
3.0:   Unknown -   (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/dehne03efficient.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/dehne03efficient.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
121   External-memory computational geometry - Goodrich, Tsay et al. - 1993
109   InputOutput complexity sorting and related problem (context) - Vitter, Output et al. - 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
75   Communication efficient parallel sorting - Goodrich - 1996
64   Scalable parallel computational geometry for coarse grained .. - Dehne, Fabri et al. - 1996
60   The uniform memory hierarchy model of computation - Alpern, Carter et al. - 1994
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
48   Efficient parallel graph algorithms for coarse grained multi.. - Caceres, Dehne et al. - 1997
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
35   Practical parallel algorithms for personalized communication.. - Bader, Helman et al. - 1996
31   Algorithms for parallel memory (context) - Vitter, Shriver - 1994
30   The buffer tree: a new technique for optimal I/O-algorithms (context) - Arge - 1995
30   BSP-like external-memory computation - Sibeyn, Kaufmann - 1997
26   Fully dynamic search trees for an extension of the BSP model - Baumker, Dittrich - 1996
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   Efficient Algorithms for Computational Geometry and Graph Pr.. (context) - Chiang, O- - 1995
17   the parallel decomposability of geometric problems (context) - Atallah, Tsay - 1992
11   The deterministic complexity of parallel multisearch (context) - Baumker, Dittrich et al. - 1996
9   Coarse grained parallel next element search (context) - Chan, Dehne et al. - 1997
9   efficient scientific computation in TPIE (context) - Vengroff, Vitter et al. - 1995
5   ACM Symposium on Principles of Database Systems (context) - Vitter, algorithms - 1998
5   Report of the working group on storage I/O issues in large-s.. - Gibson, Vitter et al. - 1996
4   ACM--SIAM Symposium on Discrete Algorithms (context) - Munagala, Ranade et al. - 1999
4   Available via WWW httpwww (context) - User, Reference et al. - 1995



The graph only includes citing articles where the year of publication is known.


Documents on the same site (http://134.117.206.249:8080/www/publications/index.html):   More
Parallel CLUSTAL W for PC Clusters - Cheetham, Dehne, Pitre.. (2003)   (Correct)
Coarse-Grained Parallel Geometric Search - Chan, Dehne, Rau-Chaplin (1999)   (Correct)
"The Big Sweep": On the Power of the Wavefront Approach to.. - Dehne, Klein (1992)   (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