<--- Back to Details
First PageDocument Content
Data management / Software engineering / Software transactional memory / Transactional memory / Linearizability / Linked list / Lock / Typedef / Stack / Concurrency control / Computing / Transaction processing
Date: 2007-06-01 10:29:30
Data management
Software engineering
Software transactional memory
Transactional memory
Linearizability
Linked list
Lock
Typedef
Stack
Concurrency control
Computing
Transaction processing

/cygdrive/c/tharris/tocs/2004-tocs-cpwl/figs/structure-5.fig

Add to Reading List

Source URL: www.cl.cam.ac.uk

Download Document from Source Website

File Size: 469,42 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