Preemptive Online Scheduling: Optimal Algorithms for All Speeds

被引：0
|
作者：
Tomáš Ebenlendr
Wojciech Jawor
Jiří Sgall
机构：
[1] Institute of Mathematics,Department of Computer Science
[2] University of California,undefined
来源：
Algorithmica | 2009年 / 53卷
关键词：
Online algorithms; Scheduling; Makespan;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Our main result is an optimal online algorithm for preemptive scheduling on uniformly related machines with the objective to minimize makespan. The algorithm is deterministic, yet it is optimal even among all randomized algorithms. In addition, it is optimal for any fixed combination of speeds of the machines, and thus our results subsume all the previous work on various special cases. Together with a new lower bound it follows that the overall competitive ratio of this optimal algorithm is between 2.054 and e≈2.718. We also give a complete analysis of the competitive ratio for three machines.
引用
收藏
相关论文
共 50 条
  • [21] An Optimal Preemptive Algorithm for Online MapReduce Scheduling on Two Parallel Machines
    Jiang, Yiwei
    Zhou, Wei
    Zhou, Ping
    [J]. ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH, 2018, 35 (03)
  • [22] PREEMPTIVE ONLINE SCHEDULING WITH REORDERING
    Dosa, Gyoergy
    Epstein, Leah
    [J]. SIAM JOURNAL ON DISCRETE MATHEMATICS, 2011, 25 (01) : 21 - 49
  • [23] Preemptive Online Scheduling with Reordering
    Dosa, Gyoergy
    Epstein, Leah
    [J]. ALGORITHMS - ESA 2009, PROCEEDINGS, 2009, 5757 : 456 - +
  • [24] Optimal preemptive online scheduling to minimize lp norm on two processors
    Du, Donglei
    Jiang, Xiaoyue
    Zhang, Guochuan
    [J]. JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION, 2005, 1 (03) : 345 - 351
  • [25] Optimal preemptive semi-online scheduling on two uniform processors
    Du, DL
    [J]. INFORMATION PROCESSING LETTERS, 2004, 92 (05) : 219 - 223
  • [26] Preemptive Semi–online Algorithms for Parallel Machine Scheduling with Known Total Size
    Yong He
    Hao Zhou
    Yi Wei Jiang
    [J]. Acta Mathematica Sinica, 2006, 22 : 587 - 594
  • [27] Optimal algorithms for preemptive two-agent scheduling on uniform parallel machines
    Gu, Manzhan
    Liu, Peihai
    Lu, Xiwen
    [J]. THEORETICAL COMPUTER SCIENCE, 2024, 1012
  • [28] Optimal algorithms for online scheduling with bounded rearrangement at the end
    Chen, Xin
    Lan, Yan
    Benko, Attila
    Dosa, Gyoergy
    Han, Xin
    [J]. THEORETICAL COMPUTER SCIENCE, 2011, 412 (45) : 6269 - 6278
  • [29] Approximation in preemptive stochastic online scheduling
    Megow, Nicole
    Vredeveld, Tjark
    [J]. ALGORITHMS - ESA 2006, PROCEEDINGS, 2006, 4168 : 516 - +
  • [30] Preemptive Online Scheduling in the Computing Continuum
    Platter, Hellmuth
    Kimovski, Dragi
    [J]. 2022 IEEE/ACM 15TH INTERNATIONAL CONFERENCE ON UTILITY AND CLOUD COMPUTING, UCC, 2022, : 321 - 326
12345