Summary: WaitFree Synchronization in QuantumBased
Multiprogrammed Systems ?
James H. Anderson, Rohit Jain, and David Ott
Department of Computer Science
University of North Carolina at Chapel Hill
Abstract. We consider waitfree 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 waitfree 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 waitfree synchronization in multiprogrammed sys
tems. In such systems, several processes may be bound to the same processor. In
related previous work, Ramamurthy, Moir, and Anderson considered waitfree
synchronization in multiprogrammed systems in which processes on the same
processor are scheduled by priority . For such systems, Ramamurthy et al.