Usually,scheduling algorithms are designed for task-graphs.task-graphs model oblivious algorithms.but not iterative algorithms where the number of iterations is unknown (e.g.while-loops).We generalize scheduling techniques known for oblivious algorithms to iterative algorithms.We prove bounds for the execution time of such algorithms in terms of the optimum.
展开▼
