Flat combining and the synchronization-parallelism tradeoff (2010)
| Venue: | In SPAA ’10: Proceedings of the Twenty Third annual ACM Symposium on Parallelism in Algorithms and Architectures |
| Citations: | 10 - 2 self |
BibTeX
@INPROCEEDINGS{Hendler10flatcombining,
author = {Danny Hendler and Itai Incze and Moran Tzafrir and Nir Shavit},
title = {Flat combining and the synchronization-parallelism tradeoff},
booktitle = {In SPAA ’10: Proceedings of the Twenty Third annual ACM Symposium on Parallelism in Algorithms and Architectures},
year = {2010},
pages = {355--364}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Traditional data structure designs, whether lock-based or lock-free, provide parallelism via fine grained synchronization among threads. We introduce a new synchronization paradigm based on coarse locking, which we call flat combining. The cost of synchronization in flat combining is so low, that having a single thread holding a lock perform the combined access requests of all others, delivers, up to a certain non-negligible concurrency level, better performance than the most effective parallel finely synchronized implementations. We use flat-combining to devise, among other structures, new linearizable stack, queue, and priority queue algorithms that greatly outperform all prior algorithms.
