Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
A Simple Proof Technique for Priority-scheduled Systems
 

Summary: A Simple Proof Technique for
Priority-scheduled Systems
James H. Anderson 1
The University of North Carolina, Chapel Hill, NC 27599
Mark Moir 2
Sun Microsystems, Inc., Burlington, MA 01803
Srikanth Ramamurthy
IBM-Transarc Labs, Pittsburgh, PA 15222
Abstract
A simple proof method is presented for proving invariance properties of con-
current programs in priority-scheduled systems. This method is illustrated by us-
ing it to establish the correctness of a simple wait-free consensus algorithm for
priority-scheduled uniprocessor systems. This consensus algorithm is of interest in
its own right because is shows that atomic read and write operations are univer-
sal in priority-scheduled uniprocessor systems, i.e., they can be used to implement
any shared object in such a system in a wait-free manner. This stands in con-
trast to fully asynchronous systems, where strong synchronization primitives such
as compare-and-swap are needed for universality.
Key words: Consensus, multiprogramming, program correctness, real-time
systems, scheduling, wait-freedom

  

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

 

Collections: Computer Technologies and Information Sciences