A framework for scheduling a number of di erent real-time applications on a single shared preemptable processor is proposed. This framework enforces complete isolation among the di erent applications, such that the behavior of each application is very similar to its behavior if it had been executing on a slower dedicated processor. A scheduling algorithm that implements this framework is presented and proved correct. Keywords. Hard-real-time systems Preemptive scheduling Earliest deadline rst Inter-application isolation.
Giuseppe Lipari, John Carpenter, Sanjoy K. Baruah