Name
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. |
Year | DOI | Venue |
|---|---|---|
1999 | 10.1109/REAL.1999.818862 | RTSS |
Keywords | Field | DocType |
open system prototype,hierarchical scheme,simple acceptance test,operating system,hierarchical scheduling,windows nt,new real-time system application,open system,hierarchical scheduling scheme,periodic messages,myrinet cluster pcs,global schedulability analysis,real-time application,heuristic algorithm,system testing,operating systems,real time systems,clustering algorithms,real time system,open systems | Heuristic,Windows NT,System testing,Scheduling (computing),Computer science,Parallel computing,Real-time computing,Real-time operating system,Cluster analysis,Open system (systems theory),Myrinet,Distributed computing | Conference |
ISBN | Citations | PageRank |
0-7695-0475-2 | 4 | 0.66 |
References | Authors | |
6 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Lynn Y. Zhang | 1 | 184 | 14.71 |
| Jane W.-S. Liu | 2 | 1399 | 337.97 |
| Zhong Deng | 3 | 4 | 0.66 |
| Ian Philp | 4 | 31 | 4.20 |