Summary: Wait-Free Synchronization in Quantum-Based
James H. Anderson, Rohit Jain, and David Ott
Department of Computer Science
University of North Carolina at Chapel Hill
Abstract. We consider wait-free synchronization in multiprogrammed
uniprocessor and multiprocessor systems in which the processes bound to
each processor are scheduled for execution using a scheduling quantum.
We show that, in such systems, any object with consensus number P in
Herlihy's wait-free hierarchy is universal for any number of processes ex-
ecuting on P processors, provided the scheduling quantum is of a certain
size. We give an asymptotically tight characterization of how large the
scheduling quantum must be for this result to hold.
This paper is concerned with wait-free synchronization in multiprogrammedsys-
tems. In such systems, several processes may be bound to the same processor. In
related previous work, Ramamurthy, Moir, and Anderson considered wait-free
synchronization in multiprogrammed systems in which processes on the same
processor are scheduled by priority 4]. For such systems, Ramamurthy et al.