Proceedings 20th IEEE Real-Time Systems Symposium (Cat. No.99CB37054) (1999)
Dec. 1, 1999 to Dec. 3, 1999
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.
Open system, hierarchical scheduling, periodic traffic
J. W. Liu, L. Y. Zhang, Z. Deng and I. Philp, "Hierarchical Scheduling of Periodic Messages in Open System," Proceedings 20th IEEE Real-Time Systems Symposium (Cat. No.99CB37054)(RTSS), Phoenix, Arizona, 1999, pp. 350.