Sharing a Sequential Data Structure: Correctness Definition and Concurrency Analysis ∗ Vincent Gramoli

First Page		Document Content
Date: 2012-07-13 04:09:42 Transaction processing Computing Concurrency control Data management Data Linearizability Serializability Schedule Software transactional memory Isolation Concurrent computing Transactional memory		Sharing a Sequential Data Structure: Correctness Definition and Concurrency Analysis ∗ Vincent Gramoli Add to Reading List Source URL: rp-www.cs.usyd.edu.au Download Document from Source Website File Size: 109,61 KB Share Document on Facebook

	The Serializability of Concurrent Database Updates CHRISTOS H. P A P A D I M I T R I O U Massachusetts Institute of Technology, Cambridge, Massachusetts ABSTRACT A sequence of interleaved user transactions in a database DocID: 1t2Nx - View Document
	Staring into the Abyss: An Evaluation of Concurrency Control with One Thousand Cores Xiangyao Yu George Bezerra DocID: 1rrra - View Document
	BCC: Reducing False Aborts in Optimistic Concurrency Control with Low Cost for In-Memory Databases Yuan Yuan1 , Kaibo Wang1 , Rubao Lee1 , Xiaoning Ding2 , Jing Xing3 , Spyros Blanas1 , Xiaodong Zhang1 1 The DocID: 1r7eW - View Document
	Safely Accessing Time Stamps in Transactions Stephan Diestelhorst Advanced Micro Devices, Inc. Martin Pohlack DocID: 1r1Cv - View Document
	Kivati: Fast Detection and Prevention of Atomicity Violations Lee Chew David Lie Department of Electrical and Computer Engineering DocID: 1r0uA - View Document