DagSemProc.08241.2.pdf
- Filesize: 57 kB
- 3 pages
Document
08241 Summary – Transactional Memory : From Implementation to Application
Authors
-
Part of:
Volume:
Dagstuhl Seminar Proceedings, Volume 8241
Series: Dagstuhl Seminar Proceedings (DagSemProc) - License:
Creative Commons Attribution 4.0 International license
- Publication Date: 2008-12-10
Cite AsGet BibTex
Christof Fetzer, Tim Harris, Maurice Herlihy, and Nir Shavit. 08241 Summary – Transactional Memory : From Implementation to Application. In Transactional Memory : From Implementation to Application. Dagstuhl Seminar Proceedings, Volume 8241, pp. 1-3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)
https://doi.org/10.4230/DagSemProc.08241.2
https://doi.org/10.4230/DagSemProc.08241.2
Abstract
A goal of current multiprocessor software design is to introduce parallelism into software applications by allowing operations that do not conflict in accessing memory to proceed concurrently. The key tool in designing concurrent data structures has been the use of locks. Unfortunately, course grained locking is easy to program with, but provides very poor performance because of limited parallelism. Fine-grained lock-based concurrent data structures perform exceptionally well, but designing them has long been recognized as a difficult task better left to experts. If concurrent programming is to become ubiquitous,
researchers agree that one must develop alternative approaches that simplify code design and verification.
Keywords
- Multiprocessors
- Multi-core machines
- Concurrent Programming
- Parallel Programming
- Synchronization
- Transactional Memory
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads