Conference Paper

Evaluation of Static Scheduling Algorithms Improved with Nonstrict Triggering of Program Graph Nodes.

DOI: 10.1109/HIPC.1996.565852 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 canbe stated as finding a schedule for a general programgraph to be executed on a multiprocessor system so thatthe schedule length can be minimised. This schedulingproblem is known to be NP-hard and heuristic algorithmshave been proposed to obtain optimal and sub optimalsolutions.

0 Bookmarks
 · 
44 Views
  • [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
    Parallel and Distributed Systems, 1997. Proceedings., 1997 International Conference on; 01/1998

Full-text (2 Sources)

Download
4 Downloads
Available from
Sep 2, 2014