Evaluation of static scheduling algorithms improved with partial strict triggering of program graph nodes

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 operands 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 (with partial strict triggering of coarse grained program graph nodes) CPM, VL and DSH scheduling algorithms is presented in this paper.