<--- Back to Details
First PageDocument Content
Data management / Spinlock / Compare-and-swap / Test-and-set / Lock / Mutual exclusion / Linearizability / Non-blocking algorithm / Busy waiting / Concurrency control / Computing / Concurrency
Date: 2001-05-18 16:44:10
Data management
Spinlock
Compare-and-swap
Test-and-set
Lock
Mutual exclusion
Linearizability
Non-blocking algorithm
Busy waiting
Concurrency control
Computing
Concurrency

Add to Reading List

Source URL: ftp.cs.rochester.edu

Download Document from Source Website

File Size: 198,10 KB

Share Document on Facebook

Similar Documents

A Generic Logic for Proving Linearizability (Extended Version) Artem Khyzha1 , Alexey Gotsman1 , and Matthew Parkinson2 1 2

DocID: 1tJ91 - View Document

A Generic Logic for Proving Linearizability Artem Khyzha1 , Alexey Gotsman1 , and Matthew Parkinson2 1 2 IMDEA Software Institute

DocID: 1tHCL - View Document

Proving Linearizability Using Partial Orders Artem Khyzha1 , Mike Dodds2 , Alexey Gotsman1 , and Matthew Parkinson3 1 IMDEA Software Institute, Madrid, Spain 2

DocID: 1tBi5 - View Document

From Linearizability to Eventual Consistency Radha Jagadeesan and James Riely DePaul University Abstract We address the fundamental issue of interfaces that arises in the context of cloud computing; namely, what does it

DocID: 1t8PT - View Document

Local Linearizability Ana Sokolova joint work with: Andreas Haas Andreas Holzer

DocID: 1t00x - View Document