Interchangeable Scheduling Policies in Real-Time Middleware for Distribution
- Cite this paper as:
- López Campos J., Gutiérrez J.J., González Harbour M. (2006) Interchangeable Scheduling Policies in Real-Time Middleware for Distribution. In: Pinho L.M., González Harbour M. (eds) Reliable Software Technologies – Ada-Europe 2006. Ada-Europe 2006. Lecture Notes in Computer Science, vol 4006. Springer, Berlin, Heidelberg
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.
Unable to display preview. Download preview PDF.