A methodology for implementing highly concurrent data structures
چکیده
چکیدهای برای این سند ثبت نشده است.
اسناد مشابه
[Her89] Maruice Herlihy. A methodology for implementing highly concurrent data structures. In ACM
We present a mechanism for making a scalable spin lock protocol the MCS lock recoverable thereby ensuring that a lock never becomes permanently unavailable even if one or more processes using the lock die This is achieved by modifying the original protocol to write additional inf
Randomized versus Deterministic Implementations of Concurrent Data Structures
One of the key trends in computing over the past two decades has been increased distribution, both at the processor level, where multi-core architectures are now the norm, and at the system level, where many key services are currently distributed over multiple machines. Thus, und
Techniques for Building Highly Concurrent Data Structures by Ori Shalev
In this dissertation, we present several novel techniques for concurrently accessing shared data structures in shared memory multi-processor/multicore machines. These techniques improve parallelism and thus system throughput by avoiding the use of coarse-grained locking. We begin
A methodology for implementing highly concurrent data objects
An Integrated Specification and Verification Technique for Highly Concurrent Data Structures
We present a technique for automatically verifying safety properties of concurrent programs, in particular programs which rely on subtle dependencies of local states of different threads, such as lock-free implementations of stacks and queues in an environment without garbage col
An integrated specification and verification technique for highly concurrent data structures