68 search results - page 3 / 14 » Scalable reader-writer locks |
PPOPP
2005
ACM
15 years 3 months ago
2005
ACM
In this paper we present a new form of revocable lock that streamlines the construction of higher level concurrency abstractions such as atomic multi-word heap updates. The key id...
DATE
2007
IEEE
15 years 4 months ago
2007
IEEE
We propose in this paper an algorithm for off-line selection of the contents of on-chip memories. The algorithm supports two types of on-chip memories, namely locked caches and sc...
SYRCODIS
2008
14 years 11 months ago
2008
Based on loosely coupled services in an XML engine, we describe how to realize fine-grained lock protocols, which can guarantee transaction isolation for applications using differ...
ACG
2009
Springer
15 years 4 months ago
2009
Springer
With the recent success of Monte-Carlo tree search algorithms in Go and other games, and the increasing number of cores in standard CPUs, the efficient parallelization of the sear...
SPAA
2010
ACM
15 years 2 months ago
2010
ACM
TL2 and similar STM algorithms deliver high scalability based on write-locking and invisible readers. In fact, no modern STM design locks to read along its common execution path b...