DocumentCode :
3298419
Title :
Formal analysis of waiting times for distributed real-time processes
Author :
Wedde, Horst F. ; Korel, Bogdan ; Huizinga, Dorota M.
Author_Institution :
Dept. of Comput. Sci., Wayne State Univ., Detroit, MI, USA
fYear :
1992
fDate :
9-12 Jun 1992
Firstpage :
478
Lastpage :
485
Abstract :
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
Keywords :
computational complexity; distributed processing; formal specification; real-time systems; NP-complete; automated timing analysis; distributed real-time processes; formal analysis; formal specification; formally correct polynomial time solution; global operation; static analysis; task system; waiting times; Algorithm design and analysis; Closed-form solution; Computer science; Logic; Polynomials; Software testing; System testing; Time factors; Timing; Upper bound;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Distributed Computing Systems, 1992., Proceedings of the 12th International Conference on
Conference_Location :
Yokohama
Print_ISBN :
0-8186-2865-0
Type :
conf
DOI :
10.1109/ICDCS.1992.235006
Filename :
235006
Link To Document :
بازگشت