<--- 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

Design and implementation of a compressed linked list library Yoran Heling Design and implementation of a compressed linked list library

DocID: 1tBPm - View Document

EQUIPMENT LIST Prepress Prepress All EarthColor prepress facilities are linked via Dedicated Internet Access (DIA) circuits. All data is hosted at an

DocID: 1tuSZ - View Document

STANLIB Linked Investments Tax-Free Savings Plan Fund List

DocID: 1sGzS - View Document

STANLIB Linked Investments Tax-Free Savings Plan Fund List

DocID: 1shzG - View Document

Click on the relevant tab to view the list. STANLIB Linked Fund Range STANLIB ABSA

DocID: 1seUs - View Document