This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
20th IEEE Real-Time Systems Symposium (RTSS'99)
Hierarchical Scheduling of Periodic Messages in Open System
Phoenix, Arizona
December 01-December 03
ISBN: 0-7695-0475-2
Lynn Y. Zhang, University of Illinois at Urbana-Champaign
Jane W.S. Liu, University of Illinois at Urbana-Champaign
Zhong Deng, University of Illinois at Urbana-Champaign
Ian Philp, Los Alamos National Laboratory
This paper describes a hierarchical scheme for scheduling periodic messages of distributed real-time applications in a cluster of PCs connected by a Myrinet. The scheme allows the developer of each real-time application to validate the schedulability of the application as if it were running alone on slower dedicated processors and network. A simple acceptance test is provided. According to the test, the operating system can determine whether to admit a new real-time system application into a system without having to perform detailed global schedulability analysis. Simulation results show that the hierarchical scheduling scheme outperforms the corresponding one-level heuristic algorithms. An open system prototype on a Myrinet cluster PCs running Windows NT uses this hierarchical scheme.
Index Terms:
Open system, hierarchical scheduling, periodic traffic
Citation:
Lynn Y. Zhang, Jane W.S. Liu, Zhong Deng, Ian Philp, "Hierarchical Scheduling of Periodic Messages in Open System," rtss, pp.350, 20th IEEE Real-Time Systems Symposium (RTSS'99), 1999
Usage of this product signifies your acceptance of the Terms of Use.