English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Report

On the performance of LEDA-SM

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;

/persons/resource/persons44003

Althaus,  Ernst
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons44179

Brengel,  Klaus
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons44196

Buchheit,  Thomas
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons44754

Keller,  Jörg
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons44849

Krone,  Henning
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons44879

Lambert,  Oliver
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45426

Schulte,  Ralph
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45615

Thiel,  Sven
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45735

Westphal,  Mark
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45752

Wirth,  Robert
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)

MPI-I-98-1-028.pdf
(Any fulltext), 432KB

Supplementary Material (public)
There is no public supplementary material available
Citation

Crauser, A., Mehlhorn, K., Althaus, E., Brengel, K., Buchheit, T., Keller, J., et al.(1998). On the performance of LEDA-SM (MPI-I-1998-1-028). Saarbrücken: Max-Planck-Institut für Informatik.


Cite as: https://hdl.handle.net/11858/00-001M-0000-0014-7B63-0
Abstract
We report on the performance of a library prototype for external memory algorithms and data structures called LEDA-SM, where SM is an acronym for secondary memory. Our library is based on LEDA and intended to complement it for large data. We present performance results of our external memory library prototype and compare these results with corresponding results of LEDAs in-core algorithms in virtual memory. The results show that even if only a small main memory is used for the external memory algorithms, they always outperform their in-core counterpart. Furthermore we compare different implementations of external memory data structures and algorithms.