English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Conference Paper

LEDA-SM : Extending LEDA to Secondary Memory

MPS-Authors
/persons/resource/persons44266

Crauser,  Andreas
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45021

Mehlhorn,  Kurt
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Crauser, A., & Mehlhorn, K. (1999). LEDA-SM: Extending LEDA to Secondary Memory. In Algorithm engineering (WAE-99): 3rd International Workshop, WAE'99 (pp. 228-242). Berlin, Germany: Springer.


Cite as: https://hdl.handle.net/11858/00-001M-0000-000F-3561-0
Abstract
During the last years, many software libraries for \emph{in-core} computation have been developed. Most internal memory algorithms perform very badly when used in an \emph{external memory} setting. We introduce LEDA-SM that extends the LEDA-library~\cite{LEDAbook} towards secondary memory computation. LEDA-SM uses I/O-efficient algorithms and data structures that do not suffer from the so called {\em I/O bottleneck}. LEDA is used for in-core computation. We explain the design of LEDA-SM and report on performance results.