WORST-CASE EXECUTION TIME ANALYSIS ON MODERN PROCESSORS

Authors
Citation
Kd. Nilsen et B. Rygg, WORST-CASE EXECUTION TIME ANALYSIS ON MODERN PROCESSORS, ACM SIGPLAN NOTICES, 30(11), 1995, pp. 20-30
Citations number
24
Categorie Soggetti
Computer Sciences","Computer Science Software Graphycs Programming
Journal title
Volume
30
Issue
11
Year of publication
1995
Pages
20 - 30
Database
ISI
SICI code
Abstract
Many of the trends that have dominated recent evolution and advancemen t within the computer architecture community have complicated the anal ysis of task execution times. Most of the difficulties result from two particular emphases: (1) Instruction-level parallelism, mid (2) Optim ization of average-case behavior rather than worst-case latencies. Bot h of these trends have resulted in increased nondeterminism in the tim e required to execute particular code sequences. And since the analysi s required to determine worst-case task execution times on modern proc essors is so complicated, it is not practical for programmers to perfo rm all of the necessary analyses by hand. Tools must aid them. This pa per describes ongoing research on a collection of tools intended to au tomate the analyses that must be performed in order to build reliable real-rime software for modern computing environments. Emphasis is give n to the interplay between components of the development environment.