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 条
  • [41] Optimal semi-online preemptive algorithms for machine covering on two uniform machines
    He, Y
    Jiang, YW
    [J]. THEORETICAL COMPUTER SCIENCE, 2005, 339 (2-3) : 293 - 314
  • [42] On Randomized Algorithms for Matching in the Online Preemptive Model
    Chiplunkar, Ashish
    Tirodkar, Sumedh
    Vishwanathan, Sundar
    [J]. ALGORITHMS - ESA 2015, 2015, 9294 : 325 - 336
  • [43] Optimal preemptive scheduling for general target functions
    Epstein, L
    Tassa, T
    [J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2006, 72 (01) : 132 - 162
  • [44] Optimal preemptive scheduling for general target functions
    Epstein, L
    Tassa, T
    [J]. MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2004, PROCEEDINGS, 2004, 3153 : 562 - 573
  • [45] Optimal semi-online scheduling algorithms on a small number of machines
    Wu, Yong
    Tan, Zhiyi
    Yang, Qifan
    [J]. COMBINATORICS, ALGORITHMS, PROBABILISTIC AND EXPERIMENTAL METHODOLOGIES, 2007, 4614 : 504 - +
  • [46] Optimal semi-online algorithms for scheduling with machine activation cost
    Han, Shuguang
    Jiang, Yiwei
    Hu, Jueliang
    [J]. COMBINATORICS, ALGORITHMS, PROBABILISTIC AND EXPERIMENTAL METHODOLOGIES, 2007, 4614 : 198 - +
  • [47] Properties of optimal schedules in preemptive shop scheduling
    Baptiste, Ph.
    Cartier, J.
    Kononov, A.
    Queyranne, M.
    Sevastyanov, S.
    Sviridenko, M.
    [J]. DISCRETE APPLIED MATHEMATICS, 2011, 159 (05) : 272 - 280
  • [48] An optimal algorithm for preemptive on-line scheduling
    Chen, B
    vanVliet, A
    Woeginger, GJ
    [J]. OPERATIONS RESEARCH LETTERS, 1995, 18 (03) : 127 - 131
  • [49] Algorithms for Preemptive Co-scheduling of Kernels on GPUs
    Eyraud-Dubois, Lionel
    Bentes, Cristiana
    [J]. 2020 IEEE 27TH INTERNATIONAL CONFERENCE ON HIGH PERFORMANCE COMPUTING, DATA, AND ANALYTICS (HIPC 2020), 2020, : 192 - 201
  • [50] PREEMPTIVE SCHEDULING ALGORITHMS WITH NESTED PROCESSING SET RESTRICTION
    Huo, Yumei
    Leung, Joseph Y-T
    Wang, Xin
    [J]. INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2009, 20 (06) : 1147 - 1160
12345