Title :
The case for dynamic real-time task timing in modern real-time systems
Author :
Brandt, Scott A.
Author_Institution :
Dept. of Comput. Sci., California Univ., Santa Cruz, CA, USA
Abstract :
Summary form only given. Traditional real-time systems require a priori knowledge of process period and worst-case execution times in order to guarantee application and system performance. Traditional static worst-case execution time analysis has been developed to support this requirement. However, real-time systems have grown beyond static applications developed for unchanging and well-documented hardware and software architectures. They now include (perhaps predominately) a large variety of highly dynamic applications, written by a large number of developers inexperienced with traditional real-time design, and executed on widely varying hardware and software platforms in competition with greedy best-effort applications with unknown processing characteristics. In such an environment, static timing analysis or specification is useless. This sea change in application and system characteristics requires a corresponding change in the tools and techniques used to characterize the application requirements and to meet those requirements. In many instances, dynamic analysis is the only possibly solution.
Keywords :
computational complexity; program diagnostics; real-time systems; dynamic analysis; dynamic real-time task timing; real-time system; static timing analysis; worst-case execution time; Application software; Bandwidth; Computer aided software engineering; Computer science; Digital audio players; Games; Hardware; Real time systems; System performance; Timing;
Conference_Titel :
Parallel and Distributed Processing Symposium, 2004. Proceedings. 18th International
Print_ISBN :
0-7695-2132-0
DOI :
10.1109/IPDPS.2004.1303091