<--- Back to Details
First PageDocument Content
Computer programming / Spinlock / Lock / Linearizability / Mutual exclusion / Test-and-set / Deadlock / Parallel computing / Non-blocking algorithm / Concurrency control / Computing / Concurrency
Date: 2010-02-19 22:26:45
Computer programming
Spinlock
Lock
Linearizability
Mutual exclusion
Test-and-set
Deadlock
Parallel computing
Non-blocking algorithm
Concurrency control
Computing
Concurrency

Administrivia Readers-Writers Problem • Project 1 due right now

Add to Reading List

Source URL: www.scs.stanford.edu

Download Document from Source Website

File Size: 270,70 KB

Share Document on Facebook

Similar Documents

Automatic Discovery of Mutual Exclusion Algorithms∗ (Preliminary Version) Yoah Bar-David Gadi Taubenfeld

DocID: 1vsgn - View Document

Verifying a Simplification of Mutual Exclusion by Lycklama-Hadzilacos Wim H. Hesselink (whh442, February 24, 2013) Dept. of Computing Science, University of Groningen P.O.Box 407, 9700 AK Groningen, The Netherlands

DocID: 1uazK - View Document

Mutual exclusion algorithms with constant RMR complexity and wait-free exit code Rotem Dvir1 and Gadi Taubenfeld1 1 The Interdisciplinary Center

DocID: 1u4E8 - View Document

Automatic Inference of Determinacy and Mutual Exclusion for Logic Programs Using Mode and Type Analyses Pedro LOPEZ-GARCIA1,2 , Francisco BUENO3 and Manuel HERMENEGILDO1,3 1

DocID: 1tMR8 - View Document

Concurrency control / Computing / Computer programming / Software engineering / Lock / Readerswriter lock / Non-blocking algorithm / Mutual exclusion / Spinlock / Monitor / Fetch-and-add / File locking

Administrivia  Design of Parallel and High-Performance Computing

DocID: 1rnNM - View Document