Schedulability Analysis for Systems with Data and Control Dependencies
12th Euromicro Conference on Real-Time Systems, Stockholm, June 19-21, 2000, pp. 201-208
In this paper we present an approach to schedulability analysis for hard real-time systems with control and data dependencies. We consider distributed architectures consisting of multiple programmable processors, and the scheduling policy is based on a static priority preemptive strategy. Our model of the system captures both data and control dependencies, and the schedulability approach is able to reduce the pessimism of the analysis by using the knowledge about control and data dependencies. Extensive experiments as well as a real life example demonstrate the efficiency of our approach.
|EM00.formal.pdf||Version in the formal proceedings, Adobe Acrobat portable document|
|EM00.formal.ps.gz||Version in the formal proceedings, postscript document, compressed (with gzip)|
|EM00.slides.pdf||Presentation Slides, Adobe Acrobat portable document|
|EM00.slides.ppt||Presentation Slides, Microsoft Powerpoint presentation|
[PEP00] Paul Pop, Petru Eles, Zebo Peng, "Schedulability Analysis for Systems with Data and Control Dependencies", 12th Euromicro Conference on Real-Time Systems, Stockholm, June 19-21, 2000, pp. 201-208