The GNU libstdc++ parallel mode: software engineering considerations
Proceedings of the 1st international workshop on Multicore software engineering
Algorithms and data structures for external memory
Foundations and Trends® in Theoretical Computer Science
On Computational Models for Flash Memory Devices
SEA '09 Proceedings of the 8th International Symposium on Experimental Algorithms
A Heuristic Strong Connectivity Algorithm for Large Graphs
SEA '09 Proceedings of the 8th International Symposium on Experimental Algorithms
Design and Engineering of External Memory Traversal Algorithms for General Graphs
Algorithmics of Large and Complex Networks
Flash memory efficient LTL model checking
Science of Computer Programming
Algorithm engineering: bridging the gap between algorithm theory and practice
Algorithm engineering: bridging the gap between algorithm theory and practice
An efficient strategy for storing and searching binary trees in WORM external memory
Journal of Information Science
Appearance-only SLAM at large scale with FAB-MAP 2.0
International Journal of Robotics Research
Parallel data cubes on multi-core processors with multiple disks
Proceedings of the 2011 Conference of the Center for Advanced Studies on Collaborative Research
Efficient external-memory bisimulation on DAGs
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
Parallel and I/O efficient set covering algorithms
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
A topological sorting algorithm for large graphs
Journal of Experimental Algorithmics (JEA)
Using TPIE for processing massive data sets in C++
SIGSPATIAL Special
Efficient processing of containment queries on nested sets
Proceedings of the 16th International Conference on Extending Database Technology
Self-adaptive containers: building resource-efficient applications with low programmer overhead
Proceedings of the 8th International Symposium on Software Engineering for Adaptive and Self-Managing Systems
External memory K-bisimulation reduction of big graphs
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
| Hi-index | 0.00 |
We present the software library STXXL that is an implementation of the C++ standard template library (STL) for processing huge data sets that can fit only on hard disks. It supports parallel disks, overlapping between disk I-O and computation and it is the first I-O-efficient algorithm library that supports the pipelining technique that can save more than half of the I-Os. STXXL has been applied both in academic and industrial environments for a range of problems including text processing, graph algorithms, computational geometry, Gaussian elimination, visualization, and analysis of microscopic images, differential cryptographic analysis, etc. The performance of STXXL and its applications are evaluated on synthetic and real-world inputs. We present the design of the library, how its performance features are supported, and demonstrate how the library integrates with STL. Copyright © 2007 John Wiley & Sons, Ltd. Now at mental images GmbH, Berlin, Germany.