High Performance Hardware Transactional Memory does not Equal High Performance Transaction Systems Justin Levandoski (Microsoft) Darko Makreshanski (ETH Zurich) Ryan Stutsman (Utah)

First Page		Document Content
Date: 2015-10-02 08:07:40 Concurrency control Transaction processing Linearizability Non-blocking algorithm Lock Transactional memory Compare-and-swap Software transactional memory Transactional Synchronization Extensions		High Performance Hardware Transactional Memory does not Equal High Performance Transaction Systems Justin Levandoski (Microsoft) Darko Makreshanski (ETH Zurich) Ryan Stutsman (Utah) Add to Reading List Source URL: hpts.ws Download Document from Source Website File Size: 658,86 KB Share Document on Facebook

	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