Increase analysis in the total execution time of a parallel program

Author

Li, Dingchao ; Takagi, Hiromitsu ; Ishii, Naohiro

Author_Institution

Educ. Center for Inf. Process., Nagoya Inst. of Technol., Japan

fYear

1994

fDate

14-16 Dec 1994

Firstpage

390

Lastpage

397

Abstract

Lower bound on the finishing time of optimal schedules is used as an absolute performance measure of static scheduling heuristics. This paper presents an efficient method of computing such a bound based on estimating overlaps among the execution ranges of tasks in a given task graph and analyzing the delays of tasks on the critical paths of the graph. The computation performed by this method is shown to be of higher quality than that of other known methods. The future work and directions on this topic are also indicated

Keywords

delays; parallel programming; performance evaluation; processor scheduling; absolute performance measure; delays; increase analysis; lower bound; optimal schedules; parallel program; static scheduling heuristics; task graph; total execution time; Computer science; Delay estimation; Electronic mail; Finishing; Information analysis; Information processing; Optimal scheduling; Processor scheduling; Scheduling algorithm; Time measurement;

fLanguage

English

Publisher

ieee

Conference_Titel

Parallel Architectures, Algorithms and Networks, 1994. (ISPAN), International Symposium on

Conference_Location

Kanazawa

Print_ISBN

0-8186-6507-6

Type

conf

DOI

10.1109/ISPAN.1994.367175

Filename

367175

Link To Document

https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2370632