Readers–writer lock

Known as: Read-write lock, Read/write lock, Read write lock pattern 
In computer science, a readers–writer (RW) or shared-exclusive lock (also known as a multiple readers/single-writer lock or multi-reader lock) is a… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1997-2017
02419972017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Reader-writer locks (rwlocks) aim to maximize parallelism among readers, but many existing rwlocks either cause readers to… (More)
  • table 1
  • table 2
  • figure 1
  • figure 4
  • figure 5
Is this relevant?
2013
2013
Non-Uniform Memory Access (NUMA) architectures are gaining importance in mainstream computing systems due to the rapid growth of… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2013
2013
Designing correct synchronization algorithms is notoriously difficult, as evidenced by a bug we have identified that has… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2012
2012
Read-write locks are one of the most prevalent lock forms in concurrent applications because they allow read accesses to locked… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2010
Highly Cited
2010
TL2 and similar STM algorithms deliver high scalability based on write-locking and invisible readers. In fact, no modern STM… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2009
2009
We present three new reader-writer lock algorithms that scale under high read-only contention. Many previous reader-writer locks… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2009
2009
We present the formal verification of a reader-writer lock implementation, which is a widely used synchronization primitive in… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 8
Is this relevant?
2009
2009
Reader preference, writer preference, and task-fair reader writer locks are shown to cause undue blocking in multiprocessor real… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • table 2
Is this relevant?
1999
1999
Multiversion concurrency control schemes are often limited in their practicability due to their storage requirements for multiple… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
1997
1997
Hidden Markov Models (HMMs) are frequently used in off-line cursive script recognition. In most cases the script is processed… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 5
  • figure 6
Is this relevant?