Conference Paper

Evaluation of Static Scheduling Algorithms Improved With Partial Strict Triggering of Program Graph Nodes

Conference: Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, PDPTA 1995, November 3-4, 1995, Georgia, USA
Source: DBLP

ABSTRACT

The problem of multiprocessor scheduling can be stated as finding a schedule for a general program graph to be executed on a multiprocessor system so that the schedule length can be minimised. This scheduling problem is known to be NP-hard and heuristic algorithms have been proposed to obtain optimal and sub optimal solutions. 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...

Download full-text

Full-text

Available from: Milan Ojstersek, Sep 02, 2014
  • [Show abstract] [Hide abstract]
    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
    No preview · Conference Paper · Jan 1998