| 000 -LEADER |
|---|
| fixed length control field |
06692nam a2200757 i 4500 |
| 001 - CONTROL NUMBER |
|---|
| control field |
6813142 |
| 003 - CONTROL NUMBER IDENTIFIER |
|---|
| control field |
IEEE |
| 005 - DATE AND TIME OF LATEST TRANSACTION |
|---|
| control field |
20200413152859.0 |
| 006 - FIXED-LENGTH DATA ELEMENTS--ADDITIONAL MATERIAL CHARACTERISTICS |
|---|
| fixed length control field |
m eo d |
| 007 - PHYSICAL DESCRIPTION FIXED FIELD--GENERAL INFORMATION |
|---|
| fixed length control field |
cr cn |||m|||a |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION |
|---|
| fixed length control field |
101013s2010 caua foab 000 0 eng d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
|---|
| International Standard Book Number |
9781608450121 (electronic bk.) |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
|---|
| Canceled/invalid ISBN |
9781608450114 (pbk.) |
| 024 7# - OTHER STANDARD IDENTIFIER |
|---|
| Standard number or code |
10.2200/S00253ED1V01Y201009DCT004 |
| Source of number or code |
doi |
| 035 ## - SYSTEM CONTROL NUMBER |
|---|
| System control number |
(CaBNVSL)gtp00544197 |
| 035 ## - SYSTEM CONTROL NUMBER |
|---|
| System control number |
(OCoLC)707877302 |
| 040 ## - CATALOGING SOURCE |
|---|
| Original cataloging agency |
CaBNVSL |
| Transcribing agency |
CaBNVSL |
| Modifying agency |
CaBNVSL |
| 050 #4 - LIBRARY OF CONGRESS CALL NUMBER |
|---|
| Classification number |
QA76.642 |
| Item number |
.G846 2010 |
| 082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER |
|---|
| Classification number |
005.2 |
| Edition number |
22 |
| 100 1# - MAIN ENTRY--PERSONAL NAME |
|---|
| Personal name |
Guerraoui, Rachid. |
| 245 10 - TITLE STATEMENT |
|---|
| Title |
Principles of transactional memory |
| Medium |
[electronic resource] / |
| Statement of responsibility, etc. |
Rachid Guerraoui and Michał Kapałka. |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. |
|---|
| Place of publication, distribution, etc. |
San Rafael, Calif. (1537 Fourth Street, San Rafael, CA 94901 USA) : |
| Name of publisher, distributor, etc. |
Morgan & Claypool, |
| Date of publication, distribution, etc. |
c2010. |
| 300 ## - PHYSICAL DESCRIPTION |
|---|
| Extent |
1 electronic text (xii, 179 p. : ill.) : |
| Other physical details |
digital file. |
| 490 1# - SERIES STATEMENT |
|---|
| Series statement |
Synthesis lectures on distributed computing, |
| International Standard Serial Number |
2155-1634 ; |
| Volume/sequential designation |
# 4 |
| 538 ## - SYSTEM DETAILS NOTE |
|---|
| System details note |
Mode of access: World Wide Web. |
| 538 ## - SYSTEM DETAILS NOTE |
|---|
| System details note |
System requirements: Adobe Acrobat Reader. |
| 500 ## - GENERAL NOTE |
|---|
| General note |
Part of: Synthesis digital library of engineering and computer science. |
| 500 ## - GENERAL NOTE |
|---|
| General note |
Series from website. |
| 504 ## - BIBLIOGRAPHY, ETC. NOTE |
|---|
| Bibliography, etc. note |
Includes bibliographical references (p. 171-178). |
| 505 0# - FORMATTED CONTENTS NOTE |
|---|
| Formatted contents note |
1. Introduction -- Problems with explicit locking -- Transactional memory -- Scope of this book -- Contents -- |
| 505 0# - FORMATTED CONTENTS NOTE |
|---|
| Formatted contents note |
Part I. Basics -- 2. Shared memory systems -- Basic abstractions -- Processes and shared objects -- Shared object implementations -- Executions of concurrent algorithms -- Histories -- Semantics of base objects -- Configurations and indistinguishability -- Asynchrony and wait-freedom -- Computability questions -- Summary of notation -- |
| 505 0# - FORMATTED CONTENTS NOTE |
|---|
| Formatted contents note |
3. Transactional memory: a primer -- TM shared object -- Transactions -- T-objects and their semantics -- TM histories -- Status of transactions -- Real-time order -- Conflicts -- Restrictions -- High-level TM API -- Discussion -- Nested transactions -- Non-transactional access to T-objects -- False conflicts -- A transaction abstraction -- Summary of notation -- |
| 505 0# - FORMATTED CONTENTS NOTE |
|---|
| Formatted contents note |
4. TM correctness issues -- Atomicity of committed transactions -- Real-time order -- Precluding inconsistent views -- |
| 505 0# - FORMATTED CONTENTS NOTE |
|---|
| Formatted contents note |
5. Implementing ATM -- General idea -- (Read-write) try-locks -- Phase locking TM algorithm -- An improved TM algorithm -- Alternative implementation techniques -- Obstruction-free mechanisms -- Validation heuristics -- Contention management -- Multi-version schemes -- Deferred updates -- |
| 505 0# - FORMATTED CONTENTS NOTE |
|---|
| Formatted contents note |
6. Further reading -- Shared memory systems -- Transactional memory -- |
| 505 0# - FORMATTED CONTENTS NOTE |
|---|
| Formatted contents note |
Part II. Safety -- 7. Opacity -- Opacity step by step -- Definition of opacity -- Examples -- |
| 505 0# - FORMATTED CONTENTS NOTE |
|---|
| Formatted contents note |
8. Proving opacity: an example -- Preliminaries -- A graph characterization of opacity -- 2-phase locking TM -- TM with invisible reads -- |
| 505 0# - FORMATTED CONTENTS NOTE |
|---|
| Formatted contents note |
9. Opacity vs. atomicity -- Properties of TM implementations -- Complexity lower bound -- Circumventing the lower bound -- |
| 505 0# - FORMATTED CONTENTS NOTE |
|---|
| Formatted contents note |
10. Further reading -- The roots of opacity -- Alternatives and extensions of opacity -- |
| 505 0# - FORMATTED CONTENTS NOTE |
|---|
| Formatted contents note |
Part III. Progress -- 11. The liveness of ATM -- |
| 505 0# - FORMATTED CONTENTS NOTE |
|---|
| Formatted contents note |
12. Lock-based TMs -- Strong progressiveness -- Verifying strong progressiveness -- Strong try-locks -- Reduction theorem -- Examples -- The computational power of a lock-based TM -- Equivalence between lock-based TMs and try-locks -- The computational power of a strong try-lock -- Weakening strong progressiveness -- |
| 505 0# - FORMATTED CONTENTS NOTE |
|---|
| Formatted contents note |
13. Obstruction-free TMs -- Obstruction-freedom -- Implementing an OFTM -- The computational power of an OFTM -- Definition of an Fo-consensus object -- Implementing an OFTM from fo-consensus objects -- Equivalence between OFTMs and Fo-consensus objects -- The power of an Fo-consensus object -- Impossibility of strict disjoint-access-parallelism -- Alternative forms of obstruction-freedom -- |
| 505 0# - FORMATTED CONTENTS NOTE |
|---|
| Formatted contents note |
14. General liveness of TMs -- High-level liveness of a TM -- Preliminaries -- Definition of (high-level) TM liveness -- Examples of TM liveness properties -- Classes of TM liveness properties -- Impossibility result -- Ensuring non-(n - 1), prioritizing TM liveness properties -- Summary and discussion -- |
| 505 0# - FORMATTED CONTENTS NOTE |
|---|
| Formatted contents note |
15. Further reading -- |
| 505 0# - FORMATTED CONTENTS NOTE |
|---|
| Formatted contents note |
16. Conclusions -- Bibliography -- Authors' biographies. |
| 506 1# - RESTRICTIONS ON ACCESS NOTE |
|---|
| Terms governing access |
Abstract freely available; full-text restricted to subscribers or individual document purchasers. |
| 510 0# - CITATION/REFERENCES NOTE |
|---|
| Name of source |
Compendex |
| 510 0# - CITATION/REFERENCES NOTE |
|---|
| Name of source |
INSPEC |
| 510 0# - CITATION/REFERENCES NOTE |
|---|
| Name of source |
Google scholar |
| 510 0# - CITATION/REFERENCES NOTE |
|---|
| Name of source |
Google book search |
| 520 3# - SUMMARY, ETC. |
|---|
| Summary, etc. |
Transactional 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. |
| 530 ## - ADDITIONAL PHYSICAL FORM AVAILABLE NOTE |
|---|
| Additional physical form available note |
Also available in print. |
| 588 ## - SOURCE OF DESCRIPTION NOTE |
|---|
| Source of description note |
Title from PDF t.p. (viewed on October 13, 2010). |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name entry element |
Transaction systems (Computer systems) |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name entry element |
Threads (Computer programs) |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name entry element |
Synchronization. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name entry element |
Parallel programming (Computer science) |
| 653 ## - INDEX TERM--UNCONTROLLED |
|---|
| Uncontrolled term |
transactional memory |
| 653 ## - INDEX TERM--UNCONTROLLED |
|---|
| Uncontrolled term |
concurrent programming |
| 653 ## - INDEX TERM--UNCONTROLLED |
|---|
| Uncontrolled term |
shared memory |
| 653 ## - INDEX TERM--UNCONTROLLED |
|---|
| Uncontrolled term |
theory |
| 700 1# - ADDED ENTRY--PERSONAL NAME |
|---|
| Personal name |
Kapałka, Michał. |
| 830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE |
|---|
| Uniform title |
Synthesis digital library of engineering and computer science. |
| 830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE |
|---|
| Uniform title |
Synthesis lectures on distributed computing theory, |
| International Standard Serial Number |
2155-1634 ; |
| Volume/sequential designation |
# 4. |
| 856 42 - ELECTRONIC LOCATION AND ACCESS |
|---|
| Materials specified |
Abstract with links to resource |
| Uniform Resource Identifier |
http://ieeexplore.ieee.org/servlet/opac?bknumber=6813142 |
