The multikernel: a new OS architecture for scalable multicore systems
Commodity computer systems contain more and more processor cores and exhibit
increasingly diverse architectural tradeoffs, including memory hierarchies, interconnects …
increasingly diverse architectural tradeoffs, including memory hierarchies, interconnects …
NUMA-aware reader-writer locks
Non-Uniform Memory Access (NUMA) architectures are gaining importance in mainstream
computing systems due to the rapid growth of multi-core multi-chip machines. Extracting the …
computing systems due to the rapid growth of multi-core multi-chip machines. Extracting the …
Why STM can be more than a research toy
Why STM can be more than a research toy Page 1 70 CommuniCations oF the aCm | APRIL
2011 | vOL. 54 | nO. 4 contributed articles whILE muLTIcoRE ARchITEcTuRES are increasingly …
2011 | vOL. 54 | nO. 4 contributed articles whILE muLTIcoRE ARchITEcTuRES are increasingly …
Read-log-update: a lightweight synchronization mechanism for concurrent programming
This paper introduces read-log-update (RLU), a novel extension of the popular read-copy-
update (RCU) synchronization mechanism that supports scalability of concurrent code by …
update (RCU) synchronization mechanism that supports scalability of concurrent code by …
System and method for performing dynamic mixed mode read validation in a software transactional memory
Y Lev, MK Olszewski, MS Moir - US Patent 8,595,446, 2013 - Google Patents
150 delay acquisition of ownership records for reading, and may acquire two or more
ownership records back-to-back (eg, within a single hardware transaction). The user code of …
ownership records back-to-back (eg, within a single hardware transaction). The user code of …
Lock-based or lock-less: Which is fresh?
We examine status updating systems in which time-stamped status updates are
stored/written in shared-memory. Specifically, we compare Read-Copy-Update (RCU) and …
stored/written in shared-memory. Specifically, we compare Read-Copy-Update (RCU) and …
System and method for implementing NUMA-aware reader-writer locks
6,480,918 B1* 1 1/2002 McKenney et al............ T10/200 6,578,131 B1* 6/2003 Larson et
al.................. T11 216 6,594,683 B1* 7/2003 Furlani et al.................. T18, 102 6,965,961 B1 1 …
al.................. T11 216 6,594,683 B1* 7/2003 Furlani et al.................. T18, 102 6,965,961 B1 1 …
Scalable reader-writer locks
We present three new reader-writer lock algorithms that scale under high read-only
contention. Many previous reader-writer locks suffer significant degradation when many …
contention. Many previous reader-writer locks suffer significant degradation when many …
{BRAVO—Biased} Locking for {Reader-Writer} Locks
Designers of modern reader-writer locks confront a difficult trade-off related to reader
scalability. Locks that have a compact memory representation for active readers will typically …
scalability. Locks that have a compact memory representation for active readers will typically …
Fast and efficient reacquisition of locks for transactional memory systems
A system and method is disclosed for fast lock acquisition and release in a lock-based
software transactional memory system. The method includes determining that a group of …
software transactional memory system. The method includes determining that a group of …