Efficient performance estimation for general real-time task systems

Author

Hongchao Liu ; Xiaobo Hu

Author_Institution

Dept. of Comput. Sci. & Eng., Notre Dame Univ., IN, USA

fYear

2001

fDate

4-8 Nov. 2001

Firstpage

464

Lastpage

470

Abstract

The paper presents a novel approach to compute tight upper bounds on the processor utilization independent of the implementation for general real-time systems where tasks are composed of subtasks and precedence constraints may exist among subtasks of the same task. We formulate the problem as a set of linear programming (LP) problems. Observations are made to reduce the number of LP problem instances required to be solved, which greatly improves the computation time of the utilization bounds. Furthermore, additional constraints are allowed to be included under certain circumstances to improve the quality of the bounds.

Keywords

directed graphs; linear programming; performance evaluation; processor scheduling; real-time systems; bound computation; computation time; general real-time task systems; linear programming problems; precedence constraints; processor utilization; upper bounds; utilizatoin bounds; Computer science; Failure analysis; Linear programming; Process design; Processor scheduling; Real time systems; System-level design; System-on-a-chip; Timing; Upper bound;

fLanguage

English

Publisher

ieee

Conference_Titel

Computer Aided Design, 2001. ICCAD 2001. IEEE/ACM International Conference on

Conference_Location

San Jose, CA, USA

ISSN

1092-3152

Print_ISBN

0-7803-7247-6

Type

conf

DOI

10.1109/ICCAD.2001.968681

Filename

968681