High Performance Synchronization Algorithms for Multiprogrammed Multiprocessors

Scalable busy-wait synchronization algorithms are essential for achieving good parallel program performance on large scale multiprocessors. Such algorithms include mutual exclusion locks, reader-writer locks, and barrier synchronization. Unfortunately, scalable synchronization algorithms are particularly sensitive to the effects of multiprogramming: their performance degrades sharply when processors are shared among different applications, or even among processes of the same application. In this paper we describe the design and evaluation of scalable scheduler-conscious mutual exclusion locks, reader-writer locks, and barriers, and show that by sharing information across the kernel/application interface we can improve the performance of scheduler-oblivious implementations by more than an order of magnitude.

• Type: Conference
• Year: 1995
• Where: PPOPP
• Authors: Robert W. Wisniewski, Leonidas I. Kontothanassis, Michael L. Scott
• Keywords: Distributed And Parallel Computing, Mutual Exclusion Locks, PPOPP 1995, Scalable Busy-wait Synchronization, Synchronization Algorithms