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 条
  • [21] Preemptive Parallel Job Scheduling for Heterogeneous Systems Supporting Urgent Computing
    Agung, Mulya
    Watanabe, Yuta
    Weber, Henning
    Egawa, Ryusuke
    Takizawa, Hiroyuki
    [J]. IEEE ACCESS, 2021, 9 (17557-17571) : 17557 - 17571
  • [22] A Preemptive Priority Based Job Scheduling Algorithm in Green Cloud Computing
    Kaur, Gaganjot
    Midha, Sugandhi
    [J]. 2016 6TH INTERNATIONAL CONFERENCE - CLOUD SYSTEM AND BIG DATA ENGINEERING (CONFLUENCE), 2016, : 152 - 156
  • [23] Big Data Pipeline Scheduling and Adaptation on the Computing Continuum
    Kimovski, Dragi
    Bauer, Christian
    Mehran, Narges
    Prodan, Radu
    [J]. 2022 IEEE 46TH ANNUAL COMPUTERS, SOFTWARE, AND APPLICATIONS CONFERENCE (COMPSAC 2022), 2022, : 1153 - 1158
  • [24] Semi-Online Preemptive Scheduling: One Algorithm for All Variants
    Ebenlendr, Tomas
    Sgall, Jiri
    [J]. THEORY OF COMPUTING SYSTEMS, 2011, 48 (03) : 577 - 613
  • [25] 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)
  • [26] 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
  • [27] Semi-Online Preemptive Scheduling: One Algorithm for All Variants
    Tomáš Ebenlendr
    Jiří Sgall
    [J]. Theory of Computing Systems, 2011, 48 : 577 - 613
  • [28] Optimal preemptive semi-online scheduling on two uniform processors
    Du, DL
    [J]. INFORMATION PROCESSING LETTERS, 2004, 92 (05) : 219 - 223
  • [29] An online scheduling algorithm for Grid computing systems
    Du Kim, H
    Kim, JS
    [J]. GRID AND COOPERATIVE COMPUTING, PT 2, 2004, 3033 : 34 - 39
  • [30] Leveraging Reinforcement Learning for online scheduling of real-time tasks in the Edge/Fog-to-Cloud computing continuum
    Mattia, Gabriele Proietti
    Beraldi, Roberto
    [J]. 2021 IEEE 20TH INTERNATIONAL SYMPOSIUM ON NETWORK COMPUTING AND APPLICATIONS (NCA), 2021,