Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
Filter
Type of Medium
Language
Region
Library
Years
Person/Organisation
Subjects(RVK)
Access
  • 1
    Online Resource
    Online Resource
    San Rafael, Calif. : Morgan & Claypool
    UID:
    gbv_1653555335
    Format: XII, 179 S. , graph. Darst.
    Edition: Online-Ausg. Online-Ressource Synthesis digital library of engineering and computer science
    Edition: Computer & information science. collection three
    ISBN: 9781608450114
    Series Statement: Synthesis lectures on distributed computing theory 4
    Additional Edition: ISBN 9781608450121
    Additional Edition: Erscheint auch als Druck-Ausgabe Guerraoui, Rachid Principles of transactional memory [San Rafael, Calif.] : Morgan & Claypool, 2010 ISBN 9781608450114
    Language: English
    Subjects: Computer Science
    RVK:
    Keywords: Transaktionsverarbeitung ; Nebenläufigkeit ; Verteilter Speicher
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    Online Resource
    Online Resource
    [San Rafael, Calif.] : Morgan & Claypool Publishers
    UID:
    gbv_715251457
    Format: 1 Online-Ressource (xii, 179 Seiten)
    Edition: Electronic reproduction Available via World Wide Web
    ISBN: 9781608450121
    Series Statement: Synthesis lectures on distributed computing theory #4
    Content: Includes bibliographical references
    Content: pt. 1. Basics -- pt. 2. Safety -- pt. 3. Progress
    Content: 1. Introduction -- Problems with explicit locking -- Transactional memory -- Scope of this book -- Contents --
    Content: 10. Further reading -- The roots of opacity -- Alternatives and extensions of opacity --
    Content: 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 --
    Content: 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 --
    Content: 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 --
    Content: 15. Further reading --
    Content: 16. Conclusions -- Bibliography -- Authors' biographies
    Content: 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 --
    Content: 4. TM correctness issues -- Atomicity of committed transactions -- Real-time order -- Precluding inconsistent views --
    Content: 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 --
    Content: 6. Further reading -- Shared memory systems -- Transactional memory --
    Content: 8. Proving opacity: an example -- Preliminaries -- A graph characterization of opacity -- 2-phase locking TM -- TM with invisible reads --
    Content: 9. Opacity vs. atomicity -- Properties of TM implementations -- Complexity lower bound -- Circumventing the lower bound --
    Content: 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 --
    Content: Part II. Safety -- 7. Opacity -- Opacity step by step -- Definition of opacity -- Examples --
    Content: Part III. Progress -- 11. The liveness of ATM --
    Note: Description based upon print version of record , Acknowledgments; Introduction; Problems with Explicit Locking; Transactional Memory; Scope of this Book; Contents; Basics; 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; 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 APIDiscussion; Nested Transactions; Non-Transactional Access to T-Objects; False Conflicts; A Transaction Abstraction; Summary of Notation; TM Correctness Issues; Atomicity of Committed Transactions; Real-Time Order; Precluding Inconsistent Views; Implementing a TM; General Idea; (Read-Write) Try-Locks; 2-Phase Locking TM Algorithm; An Improved TM Algorithm; Alternative Implementation Techniques; Obstruction-Free Mechanisms; Validation Heuristics; Contention Management; Multi-Version Schemes; Deferred Updates; Further Reading; Shared Memory Systems; Transactional Memory; Safety , OpacityOpacity Step by Step; Definition of Opacity; Examples; Proving Opacity: An Example; Preliminaries; A Graph Characterization of Opacity; 2-Phase Locking TM; TM with Invisible Reads; Opacity vs. Atomicity; Properties of TM Implementations; Complexity Lower Bound; Circumventing the Lower Bound; Further Reading; The Roots of Opacity; Alternatives and Extensions of Opacity; Progress; The Liveness of a TM; 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-LocksThe Computational Power of a Strong Try-Lock; Weakening Strong Progressiveness; 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; General Liveness of TMs; High-Level Liveness of a TM; Preliminaries , Definition of (High-Level) TM LivenessExamples of TM Liveness Properties; Classes of TM Liveness Properties; Impossibility Result; Ensuring Non-(N-1)-Prioritizing TM Liveness Properties; Summary and Discussion; Further Reading; Conclusions; Bibliography; Authors' Biographies; , Electronic reproduction Available via World Wide Web , System requirements: Adobe Acrobat Reader. , Mode of access: World Wide Web.
    Additional Edition: ISBN 9781608450114
    Additional Edition: Erscheint auch als Druck-Ausgabe Principles of Transactional Memory The Theory
    Language: English
    Keywords: Electronic books
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Did you mean 9781608450022?
Did you mean 9781608450114?
Did you mean 9781608450411?
Close ⊗
This website uses cookies and the analysis tool Matomo. Further information can be found on the KOBV privacy pages