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

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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Designers of modern reader-writer locks confront a difficult trade-off related to reader scalability. Locks that have a compact… Expand
  • figure 2
  • figure 1
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2016
2016
The ordered read-write lock model (ORWL) is a modern framework that proposes high level abstractions for the decomposition of an… Expand
  • figure 1
Is this relevant?
2014
2014
Reader-writer locks (rwlocks) aim to maximize parallelism among readers, but many existing rwlocks either cause readers to… Expand
  • table 1
  • figure 1
  • table 2
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2013
Highly Cited
2013
Non-Uniform Memory Access (NUMA) architectures are gaining importance in mainstream computing systems due to the rapid growth of… Expand
  • 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… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
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… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2009
2009
Abstract We present the formal verification of a reader-writer lock implementation, which is a widely used synchronization… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 8
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… Expand
  • figure 1
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2009
2009
Reader preference, writer preference, and task-fair reader writer locks are shown to cause undue blocking in multiprocessor real… Expand
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • table 2
Is this relevant?
2001
2001
Readers will learn how to revise and edit from Jane Smiley. They will find ways to evoke time and place from Richard Russo… Expand
Is this relevant?