Abstract

This paper focuses on the problem of providing runtime 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 areal-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.

Citations

2571	Scheduling algorithms for multiprogramming in a hard-real-time environment - Liu, Layland - 1973
970	Analysis and simulation of a fair queueing algorithm - Demers, Keshav, et al. - 1990
743	Priority Inheritance Protocol: An Approach to Realtime Synchronization - Sha, Rajkumar, et al. - 1987
525	The Rate Monotonic Scheduling Algorithm: Exact Characterization and Average Case Behavior - Lehoczky, Sha, et al. - 1989
523	The Virtual Clock: A New Traffic Control Algorithm for Packet Switching Networks - Zhang - 1991
296	Aperiodic task scheduling for hard real-time systems - Sprunt, Sha, et al. - 1989
105	Scheduling aperiodic tasks in dynamic priority systems - Spuri, Buttazzo - 1996
74	Aperiodic servers in a deadline scheduling environment. Real-Time Systems - Ghazalie, Baker - 1995
30	Virtual Clock: A new tra c control algorithm for packet switching networks - Zhang
15	A stack-based allocation policy for real-time processes - Baker - 1990