Summary: Real­Time Object Sharing with Minimal System Support \Lambda
(Extended Abstract)
Srikanth Ramamurthy, Mark Moir, and James H. Anderson
Department of Computer Science, University of North Carolina at Chapel Hill
Abstract
We show that, for a large class of hard real­time sys­
tems, any object with consensus number P in Herlihy's
wait­free hierarchy is universal for any number of tasks
executing on P processors. These results exploit char­
acteristics of priority­based schedulers common to most
hard real­time systems. An important special case of
this result is that, for hard real­time applications on
uniprocessors, reads and writes are universal. Thus,
Herlihy's hierarchy collapses for such applications.
1 Introduction
This paper is concerned with implementations of shared
objects in hard real­time systems. A hard real­time sys­
tem is comprised of a collection of tasks that execute on
one or more processors. A task is a sequential program
that may be invoked repeatedly in response to an exter­

Source: Anderson, James - Department of Computer Science, University of North Carolina at Chapel Hill

Collections: Computer Technologies and Information Sciences