Modelling heterogeneous processor scheduling for real-time systems
β Scribed by J.F. Leathrum; R.R. Mielke; J.W. Stoughton
- Publisher
- Elsevier Science
- Year
- 1994
- Tongue
- English
- Weight
- 748 KB
- Volume
- 11
- Category
- Article
- ISSN
- 0736-5845
No coin nor oath required. For personal study only.
β¦ Synopsis
A new model is presented to describe data-flow algorithms implemented in a multiprocessing system. Called the resource/data flow graph (RDFG), the model explicitly represents cyclo-statie processor schedules as circuits of processor ares that reflect the order that processors execute graph nodes. The model also allows the guarantee of meeting hard real-time deadlines. When unfolded, the model identifies statically the processor schedule. The model therefore is useful for determining the throughput and latency of systems with heterogeneous processors. The applicability of the model is demonstrated using a space surveillance algorithm.
π SIMILAR VOLUMES
The authors describe the adaptation of a hierarchical management-control framework to the design of intelligent real-time scheduling systems. Originally developed for the analysis of organizations where dynamics are governed solely by the reactions of human decision makers, the control framework pro