References for course #236603 (Fall 1996)


1. Scalable synchronization

T. Anderson.
The performance of spin lock alternatives for shared-memory multiprocessors.
IEEE Transactions on Parallel and Distributed Systems, Vol. 1, No. 1, January, 1990, pp. 6-16.

G. Graunke and S. Thakkar.
Synchronization algorithms for shared-memory multiprocessors.
IEEE Computer, Vol. 23, No. 6, June 1990, pp. 60-69.

John M. Mellor-Crummey and Michael L. Scott.
Algorithms for scalable synchronization on shared-memory multiprocessors.
ACM Transactions on Computer Systems, 9(1):21-65, February 1991.
(Project topic.)

Jae-Heon Yang.
Scalable Synchronization in Shared Memory Multiprocessing Systems.
PhD thesis.

J. Anderson and J.-H. Yang.
Time/Contention Tradeoffs for Multiprocessor Synchronization.
Information and Computation, Vol. 124, No. 1, pp. 68-84, 1996.
(Available from Anderson's homepage.)

J.-H. Yang and J. Anderson.
A Fast, Scalable Mutual Exclusion Algorithm.
Distributed Computing, Vol. 9, No. 1, pp. 51-60.
(Available from Anderson's homepage.)

Beng-Hong Lim and Anant Agarwal.
Waiting algorithms for synchronization in large-scale multiprocessors. ACM Transactions on Computer Systems, 11(3):253-294, August 1993.
(Project topic.)

Anna Karlin, K. Li, M. Manasse and S. Owicki,
An Empirical Study of Competitive Spinning for a Shared-Memory Multiprocessors.
Postscript.
(Project topic.)

Robert Cypher,
The Communication Requirements of Mutual Exclusion.
Proceedings 1995 ACM Symposium on Parallel Algorithms and Architectures, pp. 147-156.
(Available from Cypher's publications page.)
(Project topic.)

2. Lock-free synchronization

Maurice Herlihy.
Wait-free synchronization.
ACM Transactions on Programming Languages and Systems, 13(1):124-149, January 1991.

Maurice Herlihy.
A Methodology for Implementing Highly Concurrent Data Objects.
ACM Transactions on Programming Languages and Systems, 15(5):745-770, November 1993.

G. Barnes.
A Method for Implementing Lock-Free Shared Data Structures.
SPAA 1993, pages 261--270.
(Project topic.)

J. Turek, D. Shasha and S. Prakash.
Locking Without Blocking: Making Lock Based Concurrent Data Strucuture Algorithms Nonblocking.
PODS 1992.
(Project topic.)

N. Shavit and D. Touitou.
Software Transactional Memory.
PODC 1995, pages 204--213.
(Project topic.)

Brian Bershad.
Practical Considerations for Non-Blocking Concurrent Objects.
ICDCS 1993.
(Project topic.)
General bibliography on concurrent objects.

3. Broadcast/Multicast

P. M. Melliar-Smith, Louise E. Moser, and Vivek Agrawala.
Broadcast Protocols for Distributed Systems.
IEEE Transactions on Parallel and Distributed Systems,
Vol. 1, No. 1, pp. 17-25, January 1990.

Transis, Totem and Isis/Horus homepages.
Back to the course's homepage.