Formal analysis of waiting times for distributed real-time processes

An approach to automated timing analysis of distributed real-time programs is presented. The method is based on the static analysis of the task system and generation of global operation (GO) paths for which the timing analysis is applied. It is shown that a closed form solution algorithm is NP-complete. In order to more efficiently determine maximum waiting times for tasks sharing resources, even for large programs with many tasks, a reduced flow graph problem is defined by neglecting the differences in the execution times of the local operations. A solution for this problem gives an upper bound for the original analysis problem. A conjecture that the reduced problem is NP-complete even for two tasks is disproved by giving a formally correct polynomial time solution algorithm. The maximum number of steps for computing the maximum waiting for the reduced problem is linear with respect to the numbers of task's server requests.<<ETX>>

[1]  J.A. Stankovic,et al.  Misconceptions about real-time computing: a serious problem for next-generation systems , 1988, Computer.

[2]  P. M. Melliar-Smith,et al.  An interval logic for higher-level temporal reasoning , 1983, PODC '83.

[3]  Lui Sha,et al.  Real-time scheduling theory and Ada , 1990, Computer.

[4]  Alexander D. Stoyenko,et al.  A Schedulability Analyzer for Real-Time Euclid. , 1987, RTSS 1987.

[5]  D. Huizinga.  Analysis of timing properties for distributed real-time programs , 1992 .

[6]  Richard C. Holt,et al.  Analyzing Hard-Real-Time Programs For Guaranteed Schedulability , 1991, IEEE Trans. Software Eng..

[7]  C. Samuel Hsieh.  Timing analysis of cyclic concurrent programs , 1989, ICSE '89.

[8]  Matthew S. Hecht,et al.  Flow Analysis of Computer Programs , 1977 .

[9]  Aloysius K. Mok,et al.  A Graph-Theoretic Approach for Timing Analysis and its Implementation , 1987, IEEE Transactions on Computers.

[10]  Niklaus Wirth,et al.  Toward a discipline of real-time programming , 1977, CACM.

[11]  John A. Stankovic,et al.  Misconceptions About Real-Time Computing , 1988, Computer.

[12]  Aloysius K. Mok,et al.  Safety analysis of timing properties in real-time systems , 1986, IEEE Transactions on Software Engineering.

[13]  Alan C. Shaw,et al.  Reasoning About Time in Higher-Level Language Software , 1989, IEEE Trans. Software Eng..

[14]  Daniel S. Hirschberg,et al.  A linear space algorithm for computing maximal common subsequences , 1975, Commun. ACM.

[15]  Dennis W. Leinbaugh.  Guaranteed Response Times in a Hard-Real-Time Environment , 1980, IEEE Transactions on Software Engineering.

[16]  A. A. Aaby,et al.  Specification of real-time systems in real-time temporal interval logic , 1988, Proceedings. Real-Time Systems Symposium.

[17]  Horst F. Wedde,et al.  A critical path approach for testing distributed real-time systems , 1991, Proceedings of the Twenty-Fourth Annual Hawaii International Conference on System Sciences.

[18]  Dennis W. Leinbaugh,et al.  Guaranteed response times in a distributed hard-real-time environment , 1986, IEEE Transactions on Software Engineering.