LEDA-SM Extending LEDA to Secondary Memory

During the last years, many software libraries for in-core computation have been developed. Most internal memory algorithms perform very badly when used in an external memory setting. We introduce LEDA-SM that extends the LEDA-library [22] towards secondary memory computation. LEDA-SM uses I/O-efficient algorithms and data structures that do not suffer from the so called I/O bottleneck. LEDA is used for in-core computation. We explain the design of LEDA-SM and report on performance results.

[1]  Kurt Mehlhorn,et al.  The LEDA Platform of Combinatorial and Geometric Computing , 1997, ICALP.

[2]  William L. Ditto,et al.  Principles and applications of chaotic systems , 1995, CACM.

[3]  Yi-Jen Chiang,et al.  Dynamic and i/o-efficient algorithms for computational geometry and graph problems: theoretical and experimental results , 1995 .

[4]  Jeffrey Scott Vitter,et al.  External-Memory Algorithms for Processing Line Segments in Geographic Information Systems , 1996 .

[5]  John Wilkes,et al.  An introduction to disk drive modeling , 1994, Computer.

[6]  Lars Arge,et al.  Efficient External-Memory Data Structures and Applications , 1996, BRICS Dissertation Series.

[7]  Roberto Grossi,et al.  A fully-dynamic data structure for external substring search , 1995, STOC '95.

[8]  Mihalis Yannakakis,et al.  The input/output complexity of transitive closure , 1990, SIGMOD '90.

[9]  S. Muthukrishnan,et al.  Overcoming the memory bottleneck in suffix tree construction , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[10]  Kurt Mehlhorn,et al.  LEDA: a platform for combinatorial and geometric computing , 1997, CACM.

[11]  Peter Sanders,et al.  Fast priority queues for cached memory , 1999, JEAL.

[12]  Eugene W. Myers,et al.  Suffix arrays: a new method for on-line string searches , 1993, SODA '90.

[13]  Edward F. Grove,et al.  Simple Randomized Mergesort on Parallel Disks , 1997, Parallel Comput..

[14]  Kurt Mehlhorn,et al.  Kürzeste-Wege-Berechnung bei sehr großen Datenmengen , 1997 .

[15]  R. Bayer,et al.  Organization and maintenance of large ordered indices , 1970, SIGFIDET '70.

[16]  Jyh-Jong Tsay,et al.  External-memory computational geometry , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[17]  Kurt Mehlhorn,et al.  Faster algorithms for the shortest path problem , 1990, JACM.

[18]  Paolo Ferragina,et al.  On Constructing Suffix Arrays in External Memory , 1999, ESA.

[19]  Lars Arge.  External-Memory Algorithms with Applications in Geographic Information Systems , 1997 .

[20]  Gerth Stølting Brodal,et al.  Worst-Case External-Memory Priority Queues , 1998, SWAT.

[21]  Kurt Mehlhorn,et al.  On the performance of LEDA-SM , 1998 .

[22]  Ronald Fagin,et al.  Extendible hashing—a fast access method for dynamic files , 1979, ACM Trans. Database Syst..

[23]  Peter Sanders.  Fast Priority Queues for Cached Memory , 1999, ALENEX.

[24]  Ricardo A. Baeza-Yates,et al.  Hierarchies of Indices for Text Searching , 1994, Inf. Syst..

[25]  Klaus H. Hinrichs,et al.  Efficient Bulk Operations on Dynamic R-Trees , 1999, Algorithmica.

[26]  J. Sack,et al.  Early Experiences in Implementing the Buffer Tree , 1997, WAE.

[27]  Darren Erik,et al.  Supporting I/O-Efficient Scientific Computation In TPIE* , 1995 .

[28]  Thomas H. Cormen,et al.  ViC*: a compiler for virtual-memory C* , 1998, Proceedings Third International Workshop on High-Level Parallel Programming Models and Supportive Environments.

[29]  Edward F. Grove,et al.  External-memory graph algorithms , 1995, SODA '95.