Minimizing lateness for precedence graphs with constant delays on dedicated pipelined processors
Electronic Notes in Discrete Mathematics(2010)
摘要
This paper studies the generalization of Zinder-Roper algorithm for maximum lateness problem to the case of dedicated processors systems with constant delays. One of remarkable feature of this algorithm is that it is based on iterated list scheduling, without any other computation. The performance of the extended algorithm is evaluated through worst-case analysis. If all tasks have the same type and no delay is considered, then the upper bound obtained coincides with the upper bound for Zinder-Roper algorithm on identical processors, which is the best known for maximum lateness problem.
更多查看译文
关键词
Scheduling theory,dedicated processors,unit execution times,precedence delays,maximum lateness,worst-case analysis
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要