About the Book
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. Pages: 106. Chapters: Mutual exclusion, ACID, Safe semantics, Regular semantics, Atomic semantics, Semaphore, Double-checked locking, Commitment ordering, The History of Commitment Ordering, Serializability, Operational transformation, Global serializability, Read-copy-update, Software transactional memory, Monitor, Two-phase locking, Linearizability, Non-blocking algorithm, Compare-and-swap, Snapshot isolation, Test-and-set, Multiversion concurrency control, Spinlock, Critical section, Volatile variable, Priority inversion, Timestamp-based concurrency control, Software lockout, Speculative multithreading, Busy waiting, Optimistic concurrency control, Serializing tokens, Distributed concurrency control, Readers-writer lock, Load-link/store-conditional, Fetch-and-add, Seqlock, Global Interpreter Lock, Priority inheritance, Ease, Record locking, Squatting attack, Double compare-and-swap, Lock convoy, Global concurrency control, Priority ceiling protocol, Index locking, Futex, Test and Test-and-set, Read-modify-write, Multiple granularity locking, Reentrant mutex, Path expression, Ticket lock, Giant lock, Event, Thundering herd problem, Wait-for graph, Conservative two-phase locking, Room synchronization, Locks with ordered sharing, Non-lock concurrency control. Excerpt: In concurrency control of databases, transaction processing (transaction management), and related applications, Commitment ordering (or Commit ordering; CO; Raz 1990, 1992, 1994, 2009) is a class of interoperable Serializability techniques, both centralized and distributed. It allows optimistic (non-blocking) implementations. With the proliferation of Multi-core processors, CO has been also increasingly utilized in Concurrent programming, Transactional memory, and especially in Software transactional memory (STM) for achieving serializability optimistically. CO is also the...
