DMCA
Interchangeable Scheduling Policies in Real-Time Middleware for Distribution
| Citations: | 3 - 2 self |
BibTeX
@MISC{Campos_interchangeablescheduling,
author = {Juan López Campos and J. Javier Gutiérrez and Michael González Harbour},
title = {Interchangeable Scheduling Policies in Real-Time Middleware for Distribution},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Abstract. When a middleware layer is designed for providing semi-transparent distribution facilities to real-time applications, a trade-off must be made between the expressiveness and control capabilities of the real-time parameters used, and the simplicity of usage. Middleware specifications such as RT-CORBA or Ada’s Distributed Systems Annex (DSA) rely on the use of priorities to map the timing requirements of the application, thus restricting the possible scheduling policies. This paper presents a generic technique to express complex scheduling and timing parameters of distributed transactions, allowing real-time middleware implementations to change their scheduling policies for both the processing nodes and the networks. The technique has been tested in an implementation of Ada’s DSA, providing two interchangeable policies: a fixed-priority scheduler, and a complex contract-based flexible scheduler. 1
Keyphrases
real-time middleware real-time parameter control capability real-time middleware implementation real-time application system annex complex scheduling middleware specification distributed transaction scheduling policy ada dsa fixed-priority scheduler generic technique middleware layer processing node timing requirement complex contract-based flexible scheduler semi-transparent distribution facility interchangeable policy possible scheduling policy
