Design of Parallel and High-Performance Computing Fall 2013 Lecture: Linearizability Instructor: Torsten Hoefler - Parallel programming model - Document - PDFSEARCH.IO

First Page		Document Content
Date: 2014-01-06 07:53:19 Concurrency control Computing Computer programming Software engineering Lock Linearizability Resource Acquisition Is Initialization Non-blocking algorithm Thread Mutual exclusion Consistency model Queue		Design of Parallel and High-Performance Computing Fall 2013 Lecture: Linearizability Instructor: Torsten Hoefler & Markus Püschel Add to Reading List Source URL: spcl.inf.ethz.ch Download Document from Source Website File Size: 1,93 MB 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