Scheduling real-time applications in an open environment

Top Cited Papers

23 November 2002

conference paper
Published by Institute of Electrical and Electronics Engineers (IEEE)

p. 308-319
https://doi.org/10.1109/real.1997.641292

Abstract

This paper extends the two-level hierarchical scheme in (Deng et al., 1997) for scheduling independently developed real-time applications with non-real-time applications in an open environment. The environment allows the schedulability of each real-time application to be validated independently of other applications in the system. The extended scheme removes the following two restrictions of the scheme: real-time applications that are scheduled preemptively must consist solely of periodic tasks; and applications must not share global resources (i.e., resources used by more than one application). Consequently, the extended scheme can accommodate a much broader spectrum of real-time applications.

Keywords

This publication has 11 references indexed in Scilit:

A proportional share resource allocation algorithm for real-time, time-shared systems
Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
Scheduling aperiodic tasks in dynamic priority systems
Real-Time Systems, 1996
Aperiodic servers in a deadline scheduling environment
Real-Time Systems, 1995
VirtualClock
ACM Transactions on Computer Systems, 1991
Priority inheritance protocols: an approach to real-time synchronization
IEEE Transactions on Computers, 1990
A stack-based resource allocation policy for realtime processes
Published by Institute of Electrical and Electronics Engineers (IEEE) ,1990
Analysis and simulation of a fair queueing algorithm
Published by Association for Computing Machinery (ACM) ,1989
Aperiodic task scheduling for Hard-Real-Time systems
Real-Time Systems, 1989
On the complexity of fixed-priority scheduling of periodic, real-time tasks
Performance Evaluation, 1982
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM, 1973