Online scheduling of time-critical tasks to minimize the number of calibrations

被引：0
|
作者：
Chen, Zuzhi [1 ,2 ]
Zhang, Jialin [1 ,2 ]
机构：
[1] Chinese Acad Sci, Inst Comp Technol, Beijing, Peoples R China
[2] Univ Chinese Acad Sci, Beijing, Peoples R China
来源：
THEORETICAL COMPUTER SCIENCE | 2022年 / 914卷
基金：
中国国家自然科学基金;
关键词：
Online scheduling; Calibration; Time-critical;
D O I：
10.1016/j.tcs.2022.01.040
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We study the online scheduling problem where the machines need to be calibrated before processing any jobs. To calibrate a machine, it will take lambda time steps as the activation time, and then the machine will remain calibrated status for T time steps. The job can only be processed by the machine that is in calibrated status. Given a set of jobs arriving online, each of the jobs is characterized by a release time, a processing time, and a deadline. We assume that there is an infinite number of machines for usage. The objective is to minimize the total number of calibrations while feasibly scheduling all jobs. For the case that all jobs have unit processing times, we propose an O(lambda)-competitive algorithm, which is asymptotically optimal. When lambda = 0, the problem is degraded to rent minimization, where our algorithm achieves a competitive ratio of 3e + 7(approximate to 15.16) which improves upon the previous results for such problems. (c) 2022 Elsevier B.V. All rights reserved.
引用
收藏
页码：1 / 13
页数：13
相关论文
共 50 条
  • [1] Online scheduling of time-critical tasks to minimize the number of calibrations
    Institute of Computing Technology, Chinese Academy of Sciences, Beijing, China
    不详
    [J]. Theor Comput Sci, (1-13):
  • [2] Advantages of Deferred Approach for Time-Critical Tasks
    Osipov, Pavel
    Borisov, Arkady
    [J]. INFORMATICA, 2014, 25 (03) : 467 - 484
  • [3] Distributed Scheduling for Time-Critical Tasks in a Two-layer Vehicular Fog Computing Architecture
    Zhou, Yi
    Liu, Kai
    Xu, Xincao
    Guo, Songtao
    Wu, Zhou
    Lee, Victor
    Son, Sang
    [J]. 2020 IEEE 17TH ANNUAL CONSUMER COMMUNICATIONS & NETWORKING CONFERENCE (CCNC 2020), 2020,
  • [4] SCHEDULING TIME-CRITICAL INSTRUCTIONS ON RISC MACHINES
    PALEM, KV
    SIMONS, BB
    [J]. ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, 1993, 15 (04): : 632 - 658
  • [5] Optimized Scheduling for Time-Critical Industrial IoT
    Brun-Laguna, Keoma
    Minet, Pascale
    Tanaka, Yasuyuki
    [J]. 2019 IEEE GLOBAL COMMUNICATIONS CONFERENCE (GLOBECOM), 2019,
  • [6] Stride Scheduling for Time-Critical Collision Detection
    Coming, Daniel S.
    Staadt, Oliver G.
    [J]. VRST 2007: ACM SYMPOSIUM ON VIRTUAL REALITY SOFTWARE AND TECHNOLOGY, PROCEEDINGS, 2007, : 241 - 242
  • [7] Deciding when to switch tasks in time-critical multitasking
    Kushleyeva, Y
    Salvucci, DD
    Lee, FJ
    [J]. COGNITIVE SYSTEMS RESEARCH, 2005, 6 (01) : 41 - 49
  • [8] Deciding when to switch tasks in time-critical multitasking
    Kushleyeva, Y
    Salvucci, DD
    Lee, FJ
    [J]. PROCEEDINGS OF THE SIXTH INTERNATIONAL CONFERENCE ON COGNITIVE MODELING, 2004, : 14 - 19
  • [9] Decision Making Tasks in Time-Critical Medical Settings
    Sarcevic, Aleksandra
    Zhang, Zhan
    Kusunoki, Diana S.
    [J]. PROCEEDINGS OF THE 17TH ACM INTERNATIONAL CONFERENCE ON SUPPORTING GROUP WORK, 2012, : 99 - 102
  • [10] Scheduling to minimize the average completion time of dedicated tasks
    Afrati, F
    Bampis, E
    Fishkin, AV
    Jansen, K
    Kenyon, C
    [J]. FST TCS 2000: FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE, PROCEEDINGS, 2000, 1974 : 454 - 464
12345