Parallelization of bulk operations for STL dictionaries

Authors:
Leonor Frias;Johannes Singler
Affiliations:
Dep. de Llenguatges i Sistemes Informàtics, Universitat Politècnica de Catalunya;Institut für Theoretische Informatik, Universität Karlsruhe
Venue:
Euro-Par'07 Proceedings of the 2007 conference on Parallel processing
Year:
2007

Citing 7
Cited 0

Data structures and network algorithms

Data structures and network algorithms
Scheduling multithreaded computations by work stealing

Journal of the ACM (JACM)
Hoard: a scalable memory allocator for multithreaded applications

ASPLOS IX Proceedings of the ninth international conference on Architectural support for programming languages and operating systems
Parallel algorithms for red-black trees

Theoretical Computer Science
A dichromatic framework for balanced trees

SFCS '78 Proceedings of the 19th Annual Symposium on Foundations of Computer Science
STAPL: an adaptive, generic parallel C++ library

LCPC'01 Proceedings of the 14th international conference on Languages and compilers for parallel computing
MCSTL: the multi-core standard template library

Euro-Par'07 Proceedings of the 13th international Euro-Par conference on Parallel Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

STL dictionaries like map and set are commonly used in C++ programs. We consider parallelizing two of their bulk operations, namely the construction from many elements, and the insertion of many elements at a time. Practical algorithms are proposed for these tasks. The implementation is completely generic and engineered to provide best performance for the variety of possible input characteristics. It features transparent integration into the STL. This can make programs profit in an easy way from multi-core processing power. The performance measurements show the practical usefulness on real-world multi-core machines with up to eight cores.