A scheme for scheduling hard real-time applications in open system environment
- 22 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
The paper focuses on the problem of providing run-time support to real-time applications and non-real-time applications in an open system. It describes a two-level hierarchical priority-driven scheme for scheduling independently developed applications. The scheme allows the developer of each real-time application to validate the schedulability of the application independently of other applications. Once a real-time application is created and accepted by the open system, its schedulability is guaranteed regardless of the behaviors of other applications that execute concurrently in the system.Keywords
This publication has 9 references indexed in Scilit:
- The rate monotonic scheduling algorithm: exact characterization and average case behaviorPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Scheduling aperiodic tasks in dynamic priority systemsReal-Time Systems, 1996
- Aperiodic servers in a deadline scheduling environmentReal-Time Systems, 1995
- VirtualClockACM Transactions on Computer Systems, 1991
- Priority inheritance protocols: an approach to real-time synchronizationIEEE Transactions on Computers, 1990
- A stack-based resource allocation policy for realtime processesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1990
- Analysis and simulation of a fair queueing algorithmPublished by Association for Computing Machinery (ACM) ,1989
- Aperiodic task scheduling for Hard-Real-Time systemsReal-Time Systems, 1989
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time EnvironmentJournal of the ACM, 1973