Infeasibility Test for Fixed-Priority Scheduling on Multiprocessor Platforms

被引：0
|
作者：
Chwa, Hoon Sung [1 ]
Lee, Jinkyu [2 ]
机构：
[1] Daegu Gyeongbuk Inst Sci & Technol, Dept Informat & Commun Engn, Daegu 42988, South Korea
[2] Sungkyunkwan Univ, Dept Comp Sci & Engn, Suwon 16419, South Korea
来源：
IEEE EMBEDDED SYSTEMS LETTERS | 2022年 / 14卷 / 02期
基金：
新加坡国家研究基金会;
关键词：
Fixed-priority scheduling (FPS); infeasibility test; multiprocessor platforms; real-time embedded systems;
D O I：
10.1109/LES.2021.3112671
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
Fixed-priority scheduling (FPS), due to its simplicity to implement, has been one of the most popular scheduling algorithms for real-time embedded systems equipped with multi-processor platforms. While there have been many studies that find sufficient conditions for a given task set to be feasible (schedulable) by FPS with a proper priority assignment, the other direction (i.e., finding infeasible task sets) has not been studied. In this letter, we address a necessary feasibility condition that judges a given task set to be infeasible under FPS with every priority assignment on multiprocessor platforms. To this end, we derive useful properties for the condition and develop the first infeasibility test for FPS on multiprocessor platforms. Via simulations, we show that the proposed infeasibility test discovers a number of FPS-infeasible task sets which are not proven FPS-infeasible by any existing studies.
引用
收藏
页码：55 / 58
页数：4
相关论文
共 50 条
  • [41] Fixed-Priority Scheduling Policies and Their Non-utilization Bounds
    Chen, Guangyi
    Xie, Wenfang
    [J]. ADVANCES IN NEURAL NETWORKS - ISNN 2014, 2014, 8866 : 167 - 174
  • [42] Speed scheduling of fixed-priority delay-sensitive jobs
    Poonvasin, S
    [J]. TENCON 2004 - 2004 IEEE REGION 10 CONFERENCE, VOLS A-D, PROCEEDINGS: ANALOG AND DIGITAL TECHNIQUES IN ELECTRICAL ENGINEERING, 2004, : C25 - C28
  • [43] Minimum energy fixed-priority scheduling for variable voltage processors
    Quan, G
    Hu, XBS
    [J]. DESIGN, AUTOMATION AND TEST IN EUROPE CONFERENCE AND EXHIBITION, 2002 PROCEEDINGS, 2002, : 782 - 787
  • [44] Enhanced fixed-priority scheduling with (m,k)-firm guarantee
    Quan, G
    Hu, XB
    [J]. 21ST IEEE REAL-TIME SYSTEMS SYMPOSIUM, PROCEEDINGS, 2000, : 79 - 88
  • [45] Exact Response Time Analysis of Hierarchical Fixed-Priority Scheduling
    Balbastre, Patricia
    Ripoll, Ismael
    Crespo, Alfons
    [J]. 2009 15TH IEEE INTERNATIONAL CONFERENCE ON EMBEDDED AND REAL-TIME COMPUTING SYSTEMS AND APPLICATIONS, PROCEEDINGS, 2009, : 315 - 320
  • [46] Fixed-priority allocation and scheduling for energy-efficient fault tolerance in hard real-time multiprocessor systems
    Wei, Tongquan
    Mishra, Piyush
    Wu, Kaijie
    Liang, Han
    [J]. IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2008, 19 (11) : 1511 - 1526
  • [47] Fault tolerant scheduling for fixed-priority tasks with preemption threshold
    Wang, L
    Wu, ZH
    Zhao, MD
    Yang, GQ
    [J]. 11TH IEEE INTERNATIONAL CONFERENCE ON EMBEDDED AND REAL-TIME COMPUTING SYSTEMS AND APPLICATIONS, PROCEEDINGS, 2005, : 220 - 225
  • [48] Stochastic Voltage Scheduling of Fixed-Priority tasks with Preemption Thresholds
    He, XiaoChuan
    Jia, Yan
    Wa, Huaiming
    [J]. 2008 4TH INTERNATIONAL CONFERENCE ON WIRELESS COMMUNICATIONS, NETWORKING AND MOBILE COMPUTING, VOLS 1-31, 2008, : 5750 - 5754
  • [49] Efficient algorithms for schedulability analysis and priority assignment for fixed-priority preemptive scheduling with offsets
    Gu, Zonghua
    Cai, Haibin
    [J]. INTERNATIONAL JOURNAL OF EMBEDDED SYSTEMS, 2014, 6 (04) : 303 - 318
  • [50] A better polynomial-time schedulability test for real-time fixed-priority scheduling algorithms
    Han, CC
    Tyan, H
    [J]. 18TH IEEE REAL-TIME SYSTEMS SYMPOSIUM, PROCEEDINGS, 1997, : 36 - 45
12345