<--- Back to Details
First PageDocument Content
Concurrent computing / Concurrency / Scheduling algorithms / Mutual exclusion / Compare-and-swap / Linked list / Non-blocking algorithm / FIFO / Queue / Concurrency control / Computing / Abstract data types
Date: 2004-08-02 14:09:23
Concurrent computing
Concurrency
Scheduling algorithms
Mutual exclusion
Compare-and-swap
Linked list
Non-blocking algorithm
FIFO
Queue
Concurrency control
Computing
Abstract data types

Add to Reading List

Source URL: www.research.ibm.com

Download Document from Source Website

File Size: 65,41 KB

Share Document on Facebook

Similar Documents

An Evaluation of Distributed Concurrency Control Rachael Harding Dana Van Aken MIT CSAIL

DocID: 1vdK1 - View Document

Reference Capabilities for Concurrency Control Elias Castegren, Tobias Wrigstad ECOOP’16 sa

DocID: 1tHRG - View Document

Reference Capabilities for Concurrency Control Same code template safe for different use cases

DocID: 1tFnO - View Document

High Volume Transaction Processing Without Concurrency Control, Two Phase Commit, SQL or C++  Arthur Whitney Dennis Shasha Stevan Apter

DocID: 1ti9e - View Document

Engineering Tripos Part IIA THIRD YEAR Paper 3F6: Software Engineering and Design Relational Databases and Concurrency Control

DocID: 1t3YU - View Document