<--- Back to Details
First PageDocument Content
Data / Information / Software transactional memory / Lock / Transactional memory / Linearizability / Hash table / Parallel computing / Hash function / Concurrency control / Transaction processing / Data management
Date: 2013-07-27 23:48:32
Data
Information
Software transactional memory
Lock
Transactional memory
Linearizability
Hash table
Parallel computing
Hash function
Concurrency control
Transaction processing
Data management

Microsoft PowerPoint - HC18.0120.T1.tutorialAM_part2.ppt

Add to Reading List

Source URL: www.hotchips.org

Download Document from Source Website

File Size: 557,83 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