Paper Info
Title
Efficient execution of parallel programs using partial strict triggering of program graph nodes
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.
Year
DOI
Venue
1997
10.1109/ICPADS.1997.652586
ICPADS
Keywords
Field
DocType
improved cpm,dsh scheduling algorithm,coarse grained program graph,output operand,efficient execution,parallel program,missing operands,program graph,input operands,program graph node,parallel programming,clustering algorithms,concurrent computing,computer science,computational complexity,scheduling algorithm,cpm,topology,dynamic scheduling
Graph,Scheduling (computing),Computer science,Operand,Parallel computing,Real-time computing,Concurrent computing,Dynamic priority scheduling,Processor scheduling,Cluster analysis,Computational complexity theory,Distributed computing
Conference
ISBN
Citations 
PageRank 
0-8186-8227-2
0
0.34
References 
Authors
4
3
Name
Order
Citations
PageRank
Milan Ojstersek134.28
Viljem Zumer226821.78
Ljubo Pipan352.01