What people are saying - Write a review
We haven't found any reviews in the usual places.
Survey of Multiprocessor Scheduling
Scheduling with Communications Cost
7 other sections not shown
AddRootNode append expression array assignment statement begin block expression collects the outputs communication cost computation graph computation tree constant folding construct a schedule constructs an optimal ConstructSched containing ctime data dependencies denote dependency graph directed acyclic graph dynamic graph etime Figure ftime Gantt chart graph construction Hu's algorithm immediate predecessors initial node InitOptimal input instruction integer Irvine dataflow label Lookup LookupPreds loop body loop expression minimum finishing minimum-length schedule mintime multiprocessor scheduling NP-complete number of processors optimal schedule optimally convergent schedule parse tree polynomial predecessor finishing last proc procedure Optimal processing element processor assignment processor executing programming language reduction operations root neighborhood S.ConvTime S.SetSched scalar schedule that assigns SELSEQ separate processor sequence Setlnfo Snode split SplitRootNode Ssub Ssub.I subset successor T.Root T.TreeSched terminal node theorem Tl.RtFinTime Tl.RtProc token tree decomposition Tree Scheduling Algorithm tree scheduling heuristic Treelnfo Ttemp