LNCS[removed]Preemption Adaptivity in Time-Published Queue-Based Spin Locks

First Page		Document Content
Date: 2012-10-14 21:40:07 Concurrency Lock Spinlock Mutual exclusion Scheduling Linearizability Critical section Parallel computing Concurrency control Computing Computer programming		LNCS[removed]Preemption Adaptivity in Time-Published Queue-Based Spin Locks Add to Reading List Source URL: www.cs.rochester.edu Download Document from Source Website File Size: 446,25 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