Efficient execution of parallel programs using partial strict triggering of program graph nodes

Author

Ojstersek, Milan ; Zumer, Viljem ; Pipan, Ljubo

Author_Institution

Fac. of Electr. Eng. & Comput. Sci., Maribor Univ., Slovenia

fYear

1997

fDate

10-13 Dec 1997

Firstpage

453

Lastpage

459

Abstract

Almost all coarse grained program graph nodes don´t need all of their input operands at the beginning of their execution. Thereafter they can be scheduled a bit earlier. This type of program graph nodes triggering is called partial strict triggering. The missing operands will be requested later during the execution. Coarse grained program graph nodes send their output operand to all successors, as soon as they produce them. Successors of coarse grained program graph nodes will be scheduled earlier too, because they will receive their input operands sooner. An evaluation of improved CPM, VL and DSH scheduling algorithms is done in this paper. We have improved them with partial strict triggering of coarse grained program graph nodes

Keywords

data flow graphs; parallel programming; processor scheduling; CPM; DSH scheduling algorithms; VL; coarse grained program graph nodes; parallel programs; partial strict triggering; program graph nodes; Clustering algorithms; Computational complexity; Computer science; Concurrent computing; Dynamic scheduling; Multiprocessing systems; Partitioning algorithms; Processor scheduling; Scheduling algorithm; Topology;

fLanguage

English

Publisher

ieee

Conference_Titel

Parallel and Distributed Systems, 1997. Proceedings., 1997 International Conference on

Conference_Location

Seoul

Print_ISBN

0-8186-8227-2

Type

conf

DOI

10.1109/ICPADS.1997.652586

Filename

652586