An engineering approach to decomposing end-to-end delays on a distributed real-time system
- 24 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
In this paper we propose an adequate engineering technique for decomposing end-to-end delays in distributed real-time systems. Our technique greatly simplifies real-time system design process by turning a global distributed scheduling problem into a set of single processor scheduling problems with local deadlines. The deadline decomposition is done using critical scaling factor as a schedulability metric. As the problem is extremely hard in general, we develop an approximate technique using a simple linear response time model to generate a quick initial solution. We then go on to show how the initial solution helps us identify the bottlenecks, and then use that knowledge to iteratively fine tune the initial solution. The end result is a practical engineering technique to decomposing end-to-end deadlines.Keywords
This publication has 5 references indexed in Scilit:
- The rate monotonic scheduling algorithm: exact characterization and average case behaviorPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Guaranteeing real-time requirements with resource-based calibration of periodic processesIEEE Transactions on Software Engineering, 1995
- Implications of classical scheduling results for real-time systemsComputer, 1995
- An extendible approach for analyzing fixed priority hard real-time tasksReal-Time Systems, 1994
- Guaranteeing end-to-end timing constraints by calibrating intermediate processesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1994