Abstract
We present a software library Stxxl, that enables practice-oriented experimentation with huge data sets. Stxxl is an implementation of the C++ standard template library STL for external memory computations. It supports parallel disks, overlapping between I/O and computation, and pipelining technique that can save more than half of the I/Os. Stxxl has already been used for computing minimum spanning trees, connected components, breadth-first search decompositions, constructing suffix arrays, and computing social network analysis metrics.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Vitter, J.S., Shriver, E.A.M.: Algorithms for parallel memory, I/II. Algorithmica 12, 110–169 (1994)
Meyer, U., Sanders, P., Sibeyn, J. (eds.): Algorithms for Memory Hierarchies. LNCS, vol. 2625. Springer, Heidelberg (2003)
Arge, L., Procopiuc, O., Vitter, J.S.: Implementing I/O-efficient Data Structures Using TPIE. In: Möhring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol. 2461, pp. 88–100. Springer, Heidelberg (2002)
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
Arge, L., Barve, R., Hutchinson, D., Procopiuc, O., Toma, L., Vengroff, D.E., Wickeremesinghe, R.: TPIE: User manual and reference (2003)
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)
Dementiev, R., Sanders, P.: Asynchronous parallel disk sorting. In: 15th ACM Symposium on Parallelism in Algorithms and Architectures, San Diego, pp. 138–148 (2003)
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 see also http://i10www.ira.uka.de/dementiev/esuffix/docu/data/diplom.pdf
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)
Zeh, N.R.: I/O Efficient Algorithms for Shortest Path Related Problems. PhD thesis, Carleton University, Ottawa (2002)
Sanders, P.: Fast priority queues for cached memory. ACM Journal of Experimental Algorithmics 5 (2000)
Czarnecki, K., Eisenecker, U.: Generative Programming: Methods, Tools, and Applications. Addison Wesley Professional, Reading (2000)
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)
Dementiev, R., Sanders, P., Schultes, D., Sibeyn, J.: Engineering an External Memory Minimum Spanning Tree Algorithm. In: IFIP TCS, Toulouse, pp. 195–208 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dementiev, R., Kettner, L., Sanders, P. (2005). Stxxl: Standard Template Library for XXL Data Sets. In: Brodal, G.S., Leonardi, S. (eds) Algorithms – ESA 2005. ESA 2005. Lecture Notes in Computer Science, vol 3669. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11561071_57
Download citation
DOI: https://doi.org/10.1007/11561071_57
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29118-3
Online ISBN: 978-3-540-31951-1
eBook Packages: Computer ScienceComputer Science (R0)