First Page | Document Content | |
---|---|---|
Date: 2011-03-27 18:54:48Concurrency Compare-and-swap Linearizability Non-blocking algorithm Test-and-set Load-link/store-conditional CPU cache Parallel computing Transactional memory Concurrency control Computing Computer architecture | Fourth Workshop on Scalable Shared Memory Multiprocessors, Chicago, IL, April 1994 Scalable Atomic Primitives for Distributed Shared Memory Multiprocessors (Extended Abstract)Add to Reading ListSource URL: www.cs.rochester.eduDownload Document from Source WebsiteFile Size: 123,18 KBShare Document on Facebook |
An Evaluation of Distributed Concurrency Control Rachael Harding Dana Van Aken MIT CSAILDocID: 1vdK1 - View Document | |
Reference Capabilities for Concurrency Control Elias Castegren, Tobias Wrigstad ECOOP’16 saDocID: 1tHRG - View Document | |
Reference Capabilities for Concurrency Control Same code template safe for different use casesDocID: 1tFnO - View Document | |
High Volume Transaction Processing Without Concurrency Control, Two Phase Commit, SQL or C++ Arthur Whitney Dennis Shasha Stevan ApterDocID: 1ti9e - View Document | |
Engineering Tripos Part IIA THIRD YEAR Paper 3F6: Software Engineering and Design Relational Databases and Concurrency ControlDocID: 1t3YU - View Document |