STXXL: Standard Template Library for XXL data sets

Lecture Notes in Computer Science

Volumn 3669, Issue , 2005, Pages 640-651

  Dementiev, Roman ^a   Kettner, Lutz ^b   Sanders, Peter ^a  

^a UNIVERSITY OF KARLSRUHE   (Germany)

^b MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; COMPUTER SOFTWARE; DATA STORAGE EQUIPMENT; DATA STRUCTURES; INPUT OUTPUT PROGRAMS; OBJECT ORIENTED PROGRAMMING; PIPELINE PROCESSING SYSTEMS; TREES (MATHEMATICS);

DATA SETS; MEMORY COMPUTATIONS; MINIMUM SPANNING TREES; SOFTWARE LIBRARY;

LIBRARIES;

EID: 27144501107     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11561071_57     Document Type: Conference Paper

References (15)

1. Vitter, J.S., Shriver, E.A.M.: Algorithms for parallel memory, I/II. Algorithmica 12 (1994) 110-169
2. Meyer, U., Sanders, P., Sibeyn, J., eds.: Algorithms for Memory Hierarchies. Volume 2625 of LNCS Tutorial. Springer (2003)
3. Arge, L., Procopiuc, O., Vitter, J.S.: Implementing I/O-efficient Data Structures Using TPIE. In: 10th European Symposium on Algorithms (ESA). Volume 2461 of LNCS., Springer (2002) 88-100
4. Crauser, A.: LEDA-SM: External Memory Algorithms and Data Structures in Theory and Practice. PhD thesis, Universität des Saarlandes, Saarbrücken (2001) http://www.mpi-sb.mpg.de/~crauser/diss.pdf.
5. L. Arge, R. Barve, D. Hutchinson, O. Procopiuc, L. Toma, D. E. Vengroff, R. Wickeremesinghe: TPIE: User manual and reference. (2003)
6. Davidson, E.R., Cormen, T.H.: Building on a Framework: Using FG for More Flexibility and Improved Performance in Parallel Programs. (In: 19th International Parallel and Distributed Processing Symposium (IPDPS 2005)) to appear.
7. Dementiev, R., Sanders, P.: Asynchronous parallel disk sorting. In: 15th ACM Symposium on Parallelism in Algorithms and Architectures, San Diego (2003) 138-148
8. Dementiev, R., Mehnert, J., Kärkkäinen, J., Sanders, P.: Better External Memory Suffix Array Construction. In: Workshop on Algorithm Engineering & Experiments, Vancouver (2005) http://i10www.ira.uka.de/ dementiev/files/DKMS05.pdf
9. see also http://i10www.ira.uka.de/dementiev/esuffix/docu/data/diplom.pdf.
10. Dementiev, R., Kettner, L., Sanders, P.: Stxxl: Standard Template Library for XXL Data Sets. Technical Report 18, Fakultät für Informatik, University of Karlsruhe (2005)
11. Zeh, N.R.: I/O Efficient Algorithms for Shortest Path Related Problems. PhD thesis, Carleton University, Ottawa (2002)
12. Sanders, P.: Fast priority queues for cached memory. ACM Journal of Experimental Algorithmics 5 (2000)
13. Czarnecki, K., Eisenecker, U.: Generative Programming: Methods, Tools, and Applications. Addison Wesley Professional (2000)
14. Ajwani, D.: Design, Implementation and Experimental Study of External Memory BFS Algorithms. Master's thesis, Max-Planck-Institut für Informatik, Saarbrücken, Germany (2005)
15. Dementiev, R., Sanders, P., Schultes, D., Sibeyn, J.: Engineering an External Memory Minimum Spanning Tree Algorithm. In: IFIP TCS, Toulouse (2004) 195-208