Multiprocessor scheduling with availability constraints.
详细信息
- 作者：Grigoriu ; Liliana Gentiana Alex.
- 学历：Doctor
- 年：2010
- 导师：Friesen, Donald,eadvisor
- 毕业院校：Texas A&M University
- ISBN：9781124119137
- CBH：3416196
- Country：USA
- 语种：English
- FileSize：1340421
- Pages：150
文摘
We consider the problem of scheduling a given set of tasks on multiple processors with predefined periods of unavailability, with the aim of minimizing the maximum completion time. Since this problem is strongly NP-hard, polynomial approximation algorithms are being studied for its solution. Among these, the best known are LPT largest processing time first) and Multifit with their variants. We give a Multifit-based algorithm, FFDL Multifit, which has an optimal worst-case performance in the class of polynomial algorithms for same-speed processors with at most two downtimes on each machine, and for uniform processors with at most one downtime on each machine, assuming that P &ne； NP. Our algorithm finishes within 3/2 the maximum between the end of the last downtime and the end of the optimal schedule. This bound is asymptotically tight in the class of polynomial algorithms assuming that P &ne； NP. For same-speed processors with at most k downtimes on each machine our algorithm finishes within 32＋12k ) the end of the last downtime or the end of the optimal schedule. For problems where the optimal schedule ends after the last downtime, and when the downtimes represent fixed jobs, the maximum completion time of FFDL Multifit is within 32 or 32＋12k ) of the optimal maximum completion time. We also give an LPT-based algorithm, LPTX, which matches the performance of FFDL Multifit for same-speed processors with at most one downtime on each machine, and is thus optimal in the class of polynomial algorithms for this case. LPTX differs from LPT in that it uses a specific order of processors to assign tasks if two processors become available at the same time. For a similar problem, when there is at most one downtime on each machine and no more than half of the machines are shut down at the same time, we show that a bound of 2 obtained in a previous work for LPT is asymptotically tight in the class of polynomial algorithms assuming that P &ne； NP.