Parallel Processing Symposium, International (1994)
Apr. 27, 1994 to Apr. 27, 1994
Wisniewski , Dept. of Comput. Sci., Rochester Univ., NY, USA
Kontothanassis , Dept. of Comput. Sci., Rochester Univ., NY, USA
Scott , Dept. of Comput. Sci., Rochester Univ., NY, USA
Synchronization primitives for large shared-memory multiprocessors need to minimize latency and contention. Software queue-based locks address these goals, but suffer if a process near the end of the queue waits for a preempted processes ahead of it. To solve this problem, the authors present two queue-based locks that recover from in-queue preemption. The simpler, faster lock employs an extended kernel interface that shares information in both directions across the user-kernel boundary. Results from experiments with real and synthetic applications on SGI and KSR multiprocessors demonstrate that high-performance software spin locks are compatible with multiprogramming on both large-scale and bus-based machines.
multiprogrammed systems, shared-memory multiprocessors, scalable spin locks, synchronization, queue-based locks, in-queue preemption, extended kernel interface, user-kernel boundary, SGI, KSR, software spin locks, multiprogramming, bus-based machines, large-scale machines
Kontothanassis, Scott and Wisniewski, "Scalable spin locks for multiprogrammed systems," Parallel Processing Symposium, International(IPPS), Cancun, Mexico, 1994, pp. 583-589.