| A new look at the roles of spinning and blocking |
| Full text |
Pdf
(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 |
|
| Bibliometrics |
Downloads (6 Weeks): 12, Downloads (12 Months): 55, Citation Count: 0
|
|
|
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
|
Michael J. Carey , David J. DeWitt , Michael J. Franklin , Nancy E. Hall , Mark L. McAuliffe , Jeffrey F. Naughton , Daniel T. Schuh , Marvin H. Solomon , C. K. Tan , Odysseas G. Tsatalos , Seth J. White , Michael J. Zwilling, Shoring up persistent applications, Proceedings of the 1994 ACM SIGMOD international conference on Management of data, p.383-394, May 24-27, 1994, Minneapolis, Minnesota, United States
|
| |
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
|
Ryan Johnson , Ippokratis Pandis , Nikos Hardavellas , Anastasia Ailamaki , Babak Falsafi, Shore-MT: a scalable storage manager for the multicore era, Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology, March 24-26, 2009, Saint Petersburg, Russia
[doi> 10.1145/1516360.1516365]
|
 |
9
|
|
| |
10
|
Nokia. Network Database Benchmark. Specification and reference implementation available online at http://hoslab.cs.helsinki.fi/homepages/ndbbenchmark/
|
|