Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Lock (computer science)

Known as: Lock contention, Lock, Locking (computer science) 
In computer science, a lock or mutex (from mutual exclusion) is a synchronization mechanism for enforcing limits on access to a resource in an… Expand
Wikipedia

Related topics

Related topics

50 relations
Actor modelApplication programming interfaceBerkeley DBBlocking (computing)
Expand

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2019
Review
2019
Advances in Quantum Cryptography
Quantum cryptography is arguably the fastest growing area in quantum information science. Novel theoretical protocols are… Expand
  • figure 1
  • figure 2
  • table I
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2011
Highly Cited
2011
Hogwild: A Lock-Free Approach to Parallelizing Stochastic Gradient Descent
Stochastic Gradient Descent (SGD) is a popular algorithm that can achieve state-of-the-art performance on a variety of machine… Expand
  • figure 2
  • figure 4
  • figure 3
  • figure 5
Is this relevant?
Highly Cited
2006
Highly Cited
2006
Transactional Locking II
The transactional memory programming paradigm is gaining momentum as the approach of choice for replacing locks in concurrent… Expand
  • figure 1
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Practical lock-freedom
Mutual-exclusion locks are currently the most popular mechanism for interpro-cess synchronisation, largely due to their apparent… Expand
  • figure 3.2
  • figure 3.4
  • figure 3.6
  • figure 3.7
  • figure 3.9
Is this relevant?
Highly Cited
1994
Highly Cited
1994
The PANAS-X manual for the positive and negative affect schedule
A network is disclosed for automatically checking the skew and character spacing of digital tape drive systems to indicate out-of… Expand
Is this relevant?
Highly Cited
1993
Highly Cited
1993
Transactional Memory: Architectural Support For Lock-free Data Structures
A shared data structure is lock-free if its operations do not require mutual exclusion. If one process is interrupted in the… Expand
  • table 3
  • table 1
  • table 2
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1993
Highly Cited
1993
Transactional memory: architectural support for lock-free data structures
A shared data structure is lock-free if its operations do not require mutual exclusion. If one process is interrupted in the… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 6
Is this relevant?
Highly Cited
1984
Highly Cited
1984
The Chubby lock service for loosely-coupled distributed systems
We describe our experiences with the Chubby lock service, which is intended to provide coarse-grained locking as well as reliable… Expand
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
1983
Highly Cited
1983
Laser phase and frequency stabilization using an optical resonator
We describe a new and highly effective optical frequency discriminator and laser stabilization system based on signals reflected… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1976
Highly Cited
1976
The notions of consistency and predicate locks in a database system
In database systems, users access shared data under the assumption that the data satisfies certain consistency constraints. This… Expand
  • figure 2
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE