• Multiversion concurrency control (MCC or MVCC), is a non-locking concurrency control method commonly used by database management systems to provide concurrent access...
    11 KB (1,410 words) - 15:32, 11 January 2025
  • databases, non-lock concurrency control is a concurrency control method used in relational databases without using locking. There are several non-lock concurrency...
    1 KB (89 words) - 17:44, 13 June 2025
  • Optimistic concurrency control (OCC), also known as optimistic locking, is a non-locking concurrency control method applied to transactional systems such...
    11 KB (1,086 words) - 14:10, 30 April 2025
  • Java ConcurrentMap#Lock-free atomicity Liveness Lock (computer science) Mutual exclusion Priority inversion Resource starvation Non-lock concurrency control...
    19 KB (2,392 words) - 03:11, 22 June 2025
  • operating systems, multiprocessors, and databases, concurrency control ensures that correct results for concurrent operations are generated, while getting those...
    24 KB (2,976 words) - 21:42, 15 December 2024
  • In computer science, a timestamp-based concurrency control algorithm is a optimistic concurrency control method. It is used in some databases to safely...
    8 KB (1,409 words) - 12:32, 22 March 2024
  • of rolling back transactions, if concurrency conflicts occur. Pessimistic concurrency is best implemented when lock times will be short, as in programmatic...
    28 KB (3,538 words) - 09:21, 11 June 2025
  • In databases and transaction processing, two-phase locking (2PL) is a pessimistic concurrency control method that guarantees conflict-serializability. It...
    7 KB (777 words) - 11:30, 17 December 2024
  • different tradeoffs with regards to concurrency and starvation. Read-preferring RW locks allow for maximum concurrency, but can lead to write-starvation...
    14 KB (1,471 words) - 15:04, 27 January 2025
  • which simplifies concurrency control.[citation needed] The main challenge in designing concurrent programs is concurrency control: ensuring the correct...
    29 KB (3,004 words) - 17:17, 16 April 2025
  • strategies used to prevent non-repeatable reads and phantom reads. In the first strategy, lock-based concurrency control, transaction 2 is committed...
    19 KB (2,121 words) - 23:57, 3 May 2025
  • mode, no other transactions can have locked any ancestor in X mode. Atomicity (programming) Concurrency control Lock (computer science) Jim Gray; Raymond...
    4 KB (389 words) - 09:37, 18 January 2023
  • blocking and others are non-blocking (examples can be found in the Java concurrency software library). The safety properties of concurrent data structures must...
    10 KB (1,081 words) - 08:27, 10 January 2025
  • ACID (category Concurrency control)
    completes. Two-phase locking is often applied to guarantee full isolation. An alternative to locking is multiversion concurrency control, in which the database...
    18 KB (2,192 words) - 04:26, 24 March 2025
  • science, a ticket lock is a synchronization mechanism, or locking algorithm, that is a type of spinlock that uses "tickets" to control which thread of execution...
    17 KB (2,203 words) - 08:03, 16 January 2024
  • science, a lock convoy is a performance problem that can occur when using locks for concurrency control in a multithreaded application. A lock convoy occurs...
    3 KB (314 words) - 15:19, 19 February 2025
  • Read-copy-update (category Concurrency control)
    read/write concurrency. Concurrency control Copy-on-write Lock (computer science) Lock-free and wait-free algorithms Multiversion concurrency control Pre-emptive...
    43 KB (5,080 words) - 00:54, 6 June 2025
  • Thumbnail for Mutual exclusion
    Mutual exclusion (category Concurrency control)
    In computer science, mutual exclusion is a property of concurrency control, which is instituted for the purpose of preventing race conditions. It is the...
    18 KB (2,336 words) - 15:38, 21 August 2024
  • should be held for the least time possible. Multiversion concurrency control (MVCC) Readers–writer lock Gray, Jim & Reuter,f (1993), Distributed Transaction...
    7 KB (1,060 words) - 14:07, 30 April 2025
  • Database transaction schedule (category Concurrency control)
    included in a schedule. Schedules are fundamental concepts in database concurrency control theory. In practice, most general purpose database systems employ...
    20 KB (2,514 words) - 12:34, 28 May 2025
  • Thumbnail for Distributed version control
    centralized version control system, because all branches and revision history are copied to the local machine by default. The lack of locking mechanisms that...
    14 KB (1,496 words) - 14:43, 12 May 2025
  • Snapshot isolation (category Concurrency control)
    the concurrency anomalies that serializability avoids (but not all). In practice snapshot isolation is implemented within multiversion concurrency control...
    14 KB (1,724 words) - 01:56, 27 December 2024
  • Thumbnail for Thread (computing)
    Thread (computing) (category Concurrent computing)
    threading and concurrency but not parallel execution of threads, due to a global interpreter lock (GIL). The GIL is a mutual exclusion lock held by the...
    33 KB (4,052 words) - 19:02, 6 July 2025
  • be done atomically int result = ++counter; return result; } Concurrency control Concurrent data structure Exception safety Priority inversion ThreadSafe...
    10 KB (1,169 words) - 16:59, 10 April 2025
  • Thumbnail for Concurrent hash table
    general, wherein the benefit of concurrent computation is negated due to the natural requirement for concurrency control restricting contending accesses...
    16 KB (1,792 words) - 01:25, 8 April 2025
  • systems, a giant lock, also known as a big-lock or kernel-lock, is a lock that may be used in the kernel to provide concurrency control required by symmetric...
    7 KB (738 words) - 00:23, 12 October 2024
  • Spinlock (category Concurrency control algorithms)
    Implementations from Concurrency Kit Article "User-Level Spin Locks - Threads, Processes & IPC" by Gert Boddaert Article Spin Lock Example in Java Paper...
    14 KB (1,733 words) - 06:51, 12 November 2024
  • other threads may lock it. Recursive mutexes solve the problem of non-reentrancy with regular mutexes: if a function that takes a lock and executes a callback...
    5 KB (692 words) - 21:21, 20 August 2024
  • Thumbnail for Linearizability
    Linearizability (category Concurrency control)
    other threads from disrupting it, using a lock. Once again fixing the non-atomic counter algorithm: Acquire a lock, excluding other threads from running the...
    24 KB (3,291 words) - 10:59, 7 February 2025
  • Thumbnail for Microsoft SQL Server
    of concurrency control: pessimistic concurrency and optimistic concurrency. When pessimistic concurrency control is being used, SQL Server controls concurrent...
    61 KB (7,167 words) - 05:20, 24 May 2025