Hierarchical Scheduling of Periodic Messages in Open System

Authors:
Lynn Y. Zhang;Jane W. S. Liu;Zhong Deng;Ian Philp
Affiliations:
-;-;-;-
Venue:
RTSS '99 Proceedings of the 20th IEEE Real-Time Systems Symposium
Year:
1999

Citing 0
Cited 3

WRAPS Scheduling and Its Efficient Implementation on Network Processors

HiPC '02 Proceedings of the 9th International Conference on High Performance Computing
Synchronized Real-Time Linux Based Myrinet Cluster for Deterministic High Performance Computing and MPI/RT

IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Janus: a cross-layer soft real-time architecture for virtualization

Proceedings of the 19th ACM International Symposium on High Performance Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.