ACM DL

Computer Systems (TOCS)

Menu

Search Issue
enter search term and/or author name

Archive


ACM Transactions on Computer Systems (TOCS), Volume 5 Issue 1, Feb. 1987

A fast mutual exclusion algorithm
Leslie Lamport
Pages: 1-11
DOI: 10.1145/7351.7352
A new solution to the mutual exclusion problem is presented that, in the absence of contention, requires only seven memory accesses. It assumes atomic reads and atomic writes to shared registers. ...

UIO: a uniform I/O system interface for distributed systems
David R. Cheriton
Pages: 12-46
DOI: 10.1145/7351.7353
A uniform I/O interface allows programs to be written relatively independently of specific I/O services and yet work with a wide variety of the I/O services available in a distributed environment. Ideally, the interface provides this uniform...

Reliable communication in the presence of failures
Kenneth P. Birman, Thomas A. Joseph
Pages: 47-76
DOI: 10.1145/7351.7478
The design and correctness of a communication facility for a distributed computer system are reported on. The facility provides support for fault-tolerant process groups in the form of a family of reliable multicast protocols...

A continuum of disk scheduling algorithms
Robert Geist, Stephen Daniel
Pages: 77-92
DOI: 10.1145/7351.8929
A continuum of disk scheduling algorithms, V(R), having endpoints V(0) = SSTF and V(1) = SCAN, is defined. V(R) maintains a current SCAN direction (in or out) and services next the request with the smallest...

Remark on "Disk Cashe—miss ratio analysis and design consideration"
Alan Jay Smith
Pages: 93-93
DOI: 10.1145/7351.8930