Preemptive Online Scheduling in the Computing Continuum

被引:0
|
作者
Platter, Hellmuth [1 ]
Kimovski, Dragi [1 ]
机构
[1] Univ Klagenfurt, Inst Informat Technol, Klagenfurt, Austria
关键词
component; formatting; style; styling; insert;
D O I
10.1109/UCC56403.2022.00057
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Due to the high heterogeneity of the resources across the computing continuum, it becomes increasingly difficult to efficiently schedule the modern IoT applications while guaranteeing the lowest possible execution time. Traditional scheduling approaches consolidate the IoT applications on a restricted number of computing continuum resources and are conducted offline, leading to resource over-provisioning and performance bottlenecks. This paper introduces an online preemptive algorithm for scheduling IoT applications, named PASIoT, tailored explicitly for the computing continuum. To validate the behavior of PASIoT, we compared it with a state-of-the-art scheduler over a real-life test bed. The evaluation results showed that the PASIoT approach achieved 10 - 50% lower IoT application completion time than related works.
引用
收藏
页码:321 / 326
页数:6
相关论文
共 50 条
  • [1] PREEMPTIVE ONLINE SCHEDULING WITH REORDERING
    Dosa, Gyoergy
    Epstein, Leah
    [J]. SIAM JOURNAL ON DISCRETE MATHEMATICS, 2011, 25 (01) : 21 - 49
  • [2] Preemptive Online Scheduling with Reordering
    Dosa, Gyoergy
    Epstein, Leah
    [J]. ALGORITHMS - ESA 2009, PROCEEDINGS, 2009, 5757 : 456 - +
  • [3] Approximation in preemptive stochastic online scheduling
    Megow, Nicole
    Vredeveld, Tjark
    [J]. ALGORITHMS - ESA 2006, PROCEEDINGS, 2006, 4168 : 516 - +
  • [4] Preemptive online algorithms for scheduling with machine cost
    Jiang, YW
    He, Y
    [J]. ACTA INFORMATICA, 2005, 41 (06) : 315 - 340
  • [5] Preemptive online algorithms for scheduling with machine cost
    Yiwei Jiang
    Yong He
    [J]. Acta Informatica, 2005, 41 : 315 - 340
  • [6] Preemptive Online Scheduling: Optimal Algorithms for All Speeds
    Ebenlendr, Tomas
    Jawor, Wojciech
    Sgall, Jiri
    [J]. ALGORITHMICA, 2009, 53 (04) : 504 - 522
  • [7] Optimal and online preemptive scheduling on uniformly related machines
    Ebenlendr, Tomas
    Sgall, Jiri
    [J]. JOURNAL OF SCHEDULING, 2009, 12 (05) : 517 - 527
  • [8] Preemptive online scheduling: Optimal algorithms for all speeds
    Ebenlendr, Tomas
    Jawor, Wojciech
    Sgall, Jiri
    [J]. ALGORITHMS - ESA 2006, PROCEEDINGS, 2006, 4168 : 327 - 339
  • [9] Optimal and online preemptive scheduling on uniformly related machines
    Tomáš Ebenlendr
    Jiří Sgall
    [J]. Journal of Scheduling, 2009, 12 : 517 - 527
  • [10] Preemptive Online Scheduling: Optimal Algorithms for All Speeds
    Tomáš Ebenlendr
    Wojciech Jawor
    Jiří Sgall
    [J]. Algorithmica, 2009, 53