On the schedulability analysis for distributed hard real-time systems

Author

Gutiérrez, J. C Palencia ; Garcia, J. J Gutiérrez ; Harbour, M. González

Author_Institution

Dept. de Electron. y Comput., Cantabria Univ., Santander, Spain

fYear

1997

fDate

11-13 Jun 1997

Firstpage

136

Lastpage

143

Abstract

We investigate into the validity of the rate monotonic analysis techniques for distributed hard real time systems. A recent paper has shown that the algorithm developed by K. Tindell and J. Clark (1994) for the analysis of this kind of system was incomplete because it did not test all the possible cases. We prove that the algorithm is valid as it is stated and that it effectively obtains an upper bound for the worst case response times to external events in distributed systems, since the longest response always occurs within the cases that are currently tested by this algorithm. In addition, we extend the analysis technique to determine an upper bound for the local response times of particular actions in a response to an event, thus allowing the definition and verification of local deadlines for elementary actions in distributed systems

Keywords

concurrency control; distributed algorithms; processor scheduling; real-time systems; distributed hard real time systems; elementary actions; local deadlines; local response times; rate monotonic analysis techniques; schedulability analysis; worst case response times; Algorithm design and analysis; Computer architecture; Delay; Distributed computing; Pattern analysis; Processor scheduling; Real time systems; System testing; Timing; Upper bound;

fLanguage

English

Publisher

ieee

Conference_Titel

Real-Time Systems, 1997. Proceedings., Ninth Euromicro Workshop on

Conference_Location

Toledo

Print_ISBN

0-8186-8034-2

Type

conf

DOI

10.1109/EMWRTS.1997.613774

Filename

613774