STXXL

STXXL: Standard template library for XXL data sets 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 is the first external memory algorithm library that supports the pipelining technique that can save more than half of the I/Os. STXXL has already been used for the following applications: implementations of external memory algorithms for computing minimum spanning trees, connected components, breadth-first search decompositions, constructing suffix arrays, and computing social network analysis metrics for huge graphs.

Keywords for this software

Anything in here will be replaced on browsers that support the canvas element

References in zbMATH (referenced in 19 articles )

Showing results 1 to 19 of 19.
Sorted by year (citations)

  1. Dinklage, Patrick; Ellert, Jonas; Fischer, Johannes; Köppl, Dominik; Penschuck, Manuel: Bidirectional text compression in external memory (2019)
  2. Sanders, Peter; Mehlhorn, Kurt; Dietzfelbinger, Martin; Dementiev, Roman: Sequential and parallel algorithms and data structures. The basic toolbox (2019)
  3. Carstens, Corrie Jacobien; Hamann, Michael; Meyer, Ulrich; Penschuck, Manuel; Tran, Hung; Wagner, Dorothea: Parallel and I/O-efficient randomisation of massive networks using global curveball trades (2018)
  4. Broß, Jan; Gog, Simon; Hauck, Matthias; Paradies, Marcus: Fast construction of compressed web graphs (2017)
  5. Bingmann, Timo; Fischer, Johannes; Osipov, Vitaly: Inducing suffix and LCP arrays in external memory (2016)
  6. Kärkkäinen, Juha; Kempa, Dominik: LCP array construction in external memory (2016)
  7. Kovács, Annamária; Meyer, Ulrich; Ventre, Carmine: Mechanisms with monitoring for truthful RAM allocation (2015)
  8. Bertasi, Paolo; Bressan, Marco; Peserico, Enoch: PSort, yet another fast stable sorting software (2011) ioport
  9. Edelkamp, S.; Sulewski, D.; Barnat, J.; Brim, L.; Šimeček, P.: Flash memory efficient LTL model checking (2011)
  10. Chowdhury, Rezaul Alam; Ramachandran, Vijaya: The cache-oblivious Gaussian elimination paradigm: Theoretical framework, parallelization and Experimental evaluation (2010)
  11. Navarro, Gonzalo; Paredes, Rodrigo: On sorting, heaps, and minimum spanning trees (2010)
  12. Ajwani, Deepak; Meyer, Ulrich: Design and engineering of external memory traversal algorithms for general graphs (2009)
  13. Meyer, Ulrich: Via detours to I/O-efficient shortest paths (2009)
  14. Barnat, J.; Brim, L.; Šimeček, P.; Weber, M.: Revisiting resistance speeds up I/O-efficient LTL model checking (2008)
  15. Dementiev, R.; Kettner, L.; Sanders, P.: STXXL: Standard template library for XXL data sets (2008) ioport
  16. Hazel, Thomas; Toma, Laura; Vahrenhold, Jan; Wickremesinghe, Rajiv: Terracost: computing least-cost-path surfaces for massive grid terrains (2008)
  17. Ajwani, Deepak; Dementiev, Roman; Meyer, Ulrich: A computational study of external-memory BFS algorithms (2006)
  18. Dementiev, Roman: Processing huge graphs with STxxl (2006)
  19. Dementiev, Roman; Kettner, Lutz; Sanders, Peter: STXXL : Standard template library for XXL data sets (2005) ioport