| 000 | 03993nam a22005295i 4500 | ||
|---|---|---|---|
| 001 | 978-3-031-02002-5 | ||
| 003 | DE-He213 | ||
| 005 | 20240730163751.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 220601s2010 sz | s |||| 0|eng d | ||
| 020 |
_a9783031020025 _9978-3-031-02002-5 |
||
| 024 | 7 |
_a10.1007/978-3-031-02002-5 _2doi |
|
| 050 | 4 | _aQA75.5-76.95 | |
| 072 | 7 |
_aUY _2bicssc |
|
| 072 | 7 |
_aCOM000000 _2bisacsh |
|
| 072 | 7 |
_aUY _2thema |
|
| 082 | 0 | 4 |
_a004 _223 |
| 100 | 1 |
_aGuerraoui, Rachid. _eauthor. _4aut _4http://id.loc.gov/vocabulary/relators/aut _980471 |
|
| 245 | 1 | 0 |
_aPrinciples of Transactional Memory _h[electronic resource] / _cby Rachid Guerraoui, Michael Kapalka. |
| 250 | _a1st ed. 2010. | ||
| 264 | 1 |
_aCham : _bSpringer International Publishing : _bImprint: Springer, _c2010. |
|
| 300 |
_aXIII, 179 p. _bonline resource. |
||
| 336 |
_atext _btxt _2rdacontent |
||
| 337 |
_acomputer _bc _2rdamedia |
||
| 338 |
_aonline resource _bcr _2rdacarrier |
||
| 347 |
_atext file _bPDF _2rda |
||
| 490 | 1 |
_aSynthesis Lectures on Distributed Computing Theory, _x2155-1634 |
|
| 505 | 0 | _aIntroduction -- Shared Memory Systems -- Transactional Memory: A Primer -- TM Correctness Issues -- Implementing a TM -- Further Reading -- Opacity -- Proving Opacity: An Example -- Opacity vs.\ Atomicity -- Further Reading -- The Liveness of a TM -- Lock-Based TMs -- Obstruction-Free TMs -- General Liveness of TMs -- Further Reading -- Conclusions. | |
| 520 | _aTransactional memory (TM) is an appealing paradigm for concurrent programming on shared memory architectures. With a TM, threads of an application communicate, and synchronize their actions, via in-memory transactions. Each transaction can perform any number of operations on shared data, and then either commit or abort. When the transaction commits, the effects of all its operations become immediately visible to other transactions; when it aborts, however, those effects are entirely discarded. Transactions are atomic: programmers get the illusion that every transaction executes all its operations instantaneously, at some single and unique point in time. Yet, a TM runs transactions concurrently to leverage the parallelism offered by modern processors. The aim of this book is to provide theoretical foundations for transactional memory. This includes defining a model of a TM, as well as answering precisely when a TM implementation is correct, what kind of properties it can ensure, what are the power and limitations of a TM, and what inherent trade-offs are involved in designing a TM algorithm. While the focus of this book is on the fundamental principles, its goal is to capture the common intuition behind the semantics of TMs and the properties of existing TM implementations. Table of Contents: Introduction / Shared Memory Systems / Transactional Memory: A Primer / TM Correctness Issues / Implementing a TM / Further Reading / Opacity / Proving Opacity: An Example / Opacity vs.\ Atomicity / Further Reading / The Liveness of a TM / Lock-Based TMs / Obstruction-Free TMs / General Liveness of TMs / Further Reading / Conclusions. | ||
| 650 | 0 |
_aComputer science. _99832 |
|
| 650 | 0 |
_aCoding theory. _94154 |
|
| 650 | 0 |
_aInformation theory. _914256 |
|
| 650 | 0 |
_aData structures (Computer science). _98188 |
|
| 650 | 1 | 4 |
_aComputer Science. _99832 |
| 650 | 2 | 4 |
_aCoding and Information Theory. _980472 |
| 650 | 2 | 4 |
_aData Structures and Information Theory. _931923 |
| 700 | 1 |
_aKapalka, Michael. _eauthor. _4aut _4http://id.loc.gov/vocabulary/relators/aut _980473 |
|
| 710 | 2 |
_aSpringerLink (Online service) _980474 |
|
| 773 | 0 | _tSpringer Nature eBook | |
| 776 | 0 | 8 |
_iPrinted edition: _z9783031008740 |
| 776 | 0 | 8 |
_iPrinted edition: _z9783031031304 |
| 830 | 0 |
_aSynthesis Lectures on Distributed Computing Theory, _x2155-1634 _980475 |
|
| 856 | 4 | 0 | _uhttps://doi.org/10.1007/978-3-031-02002-5 |
| 912 | _aZDB-2-SXSC | ||
| 942 | _cEBK | ||
| 999 |
_c84966 _d84966 |
||