ACM Home Page
Please provide us with feedback. Feedback
Digital Library logoTake a look at the new version of this page: [ beta version ]. Tell us what you think.
A new look at the roles of spinning and blocking
Full text PdfPdf (288 KB)
Source Data Management On New Hardware archive
Proceedings of the Fifth International Workshop on Data Management on New Hardware table of contents
Providence, Rhode Island
SESSION: Exploiting parallel hardware table of contents
Pages: 21-26  
Year of Publication: 2009
ISBN:978-1-60558-701-1
Authors
Ryan Johnson  Carnegie Mellon University, Pittsburgh, PA and École Polytechnique Fédérale de Lausanne, Lausanne
Manos Athanassoulis  École Polytechnique Fédérale de Lausanne, Lausanne
Radu Stoica  École Polytechnique Fédérale de Lausanne, Lausanne
Anastasia Ailamaki  École Polytechnique Fédérale de Lausanne, Lausanne
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 12,   Downloads (12 Months): 55,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1565694.1565700
What is a DOI?

ABSTRACT

Database engines face growing scalability challenges as core counts exponentially increase each processor generation, and the efficiency of synchronization primitives used to protect internal data structures is a crucial factor in overall database performance. The trade-offs between different implementation approaches for these primitives shift significantly with increasing degrees of available hardware parallelism. Blocking synchronization, which has long been the favored approach in database systems, becomes increasingly unattractive as growing core counts expose its bottlenecks. Spinning implementations improve peak system throughput by a factor of 2x or more for 64 hardware contexts, but suffer from poor performance under load.

In this paper we analyze the shifting trade-off between spinning and blocking synchronization, and observe that the trade-off can be simplified by isolating the load control aspects of contention management and treating the two problems separately: spinning-based contention management and blocking-based load control. We then present a proof of concept implementation that, for high concurrency, matches or exceeds the performance of both user-level spin-locks and the pthread mutex under a wide range of load factors.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
2
 
3
 
4
5
 
6
B. He, W. N. Scherer III, and M. L. Scott. "Preemption adaptivity in time-published queue-based spin locks." In Proc. HiPC, 2005.
7
8
9
 
10
Nokia. Network Database Benchmark. Specification and reference implementation available online at http://hoslab.cs.helsinki.fi/homepages/ndbbenchmark/

Collaborative Colleagues:
Ryan Johnson: colleagues
Manos Athanassoulis: colleagues
Radu Stoica: colleagues
Anastasia Ailamaki: colleagues