A framework for achieving inter-application isolation in multiprogrammed, hard real-time environments
- 11 November 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 3, 217-226
- https://doi.org/10.1109/real.2000.896011
Abstract
A framework for scheduling a number of different real-time applications on a single shared preemptable processor is proposed. This framework enforces complete isolation among the different 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
This publication has 14 references indexed in Scilit:
- Scheduling real-time multi-task applications in an open systemPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- A proportional share resource allocation algorithm for real-time, time-shared systemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Scheduling real-time applications in an open environmentPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Greedy reclamation of unused bandwidth in constant-bandwidth serversPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Scheduling aperiodic tasks in dynamic priority systemsReal-Time Systems, 1996
- Aperiodic servers in a deadline scheduling environmentReal-Time Systems, 1995
- Processor capacity reserves: operating system support for multimedia applicationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1994
- Efficient aperiodic service under earliest deadline schedulingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1994
- Processor Capacity Reserves for Multimedia Operating SystemsPublished by Defense Technical Information Center (DTIC) ,1993
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time EnvironmentJournal of the ACM, 1973