<--- Back to Details
First PageDocument Content
Abstract data types / Concurrency control / Monitor / FIFO / Queue / Tree traversal / Double-ended queue / Non-blocking algorithm / Stack / Collection / Tree
Date: 2006-02-10 21:14:46
Abstract data types
Concurrency control
Monitor
FIFO
Queue
Tree traversal
Double-ended queue
Non-blocking algorithm
Stack
Collection
Tree

Scalable Synchronous Queues ∗ William N. Scherer III Doug Lea Michael L. Scott

Add to Reading List

Source URL: www.cs.rochester.edu

Download Document from Source Website

File Size: 739,09 KB

Share Document on Facebook

Similar Documents

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

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

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

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

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

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

DocID: 1t3YU - View Document