Scheduling algorithms based on weakly hard real-time constraints

被引：10
|
作者：
Tu, G [1 ]
Yang, FM [1 ]
Lu, YS [1 ]
机构：
[1] Huazhong Univ Sci & Technol, Sch Comp Sci, Wuhan 430074, Peoples R China
来源：
JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY | 2003年 / 18卷 / 06期
关键词：
weakly hard real-time; unsatisfied mu-pattern; constraint;
D O I：
10.1007/BF02945471
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
The problem of scheduling weakly hard real-time tasks is addressed in this paper. The paper first analyzes the characters of p-pattern and weakly hard real-time constraints, then, presents two scheduling algorithms, Meet Any Algorithm and Meet Row Algorithm, for weakly hard real-time systems. Different from traditional algorithms used to guarantee deadlines, Meet Any Algorithm and Meet Row Algorithm can guarantee both deadlines and constraints. Meet Any Algorithm and Meet Row Algorithm try to find out the probabilities of tasks breaking constraints and increase task's priority in advance, but not till the last moment. Simulation results show that these two algorithms are better than other scheduling algorithms dealing with constraints and can largely decrease worst-case computation time of real-time tasks.
引用
收藏
页码：815 / 821
页数：7
相关论文
共 50 条
  • [1] Scheduling algorithms based on weakly hard real-time constraints
    Gang Tu
    FuMin Yang
    YanSheng Lu
    Journal of Computer Science and Technology, 2003, 18 : 815 - 821
  • [2] Research on static scheduling algorithms for weakly hard real-time system
    Chen, Jiming
    Yin, Hongxia
    Sun, Youxian
    WCICA 2006: SIXTH WORLD CONGRESS ON INTELLIGENT CONTROL AND AUTOMATION, VOLS 1-12, CONFERENCE PROCEEDINGS, 2006, : 4436 - +
  • [3] A weakly hard real-time scheduling algorithm based on RM
    School of Information Science and Engineering, Northeastern University, Shenyang 110004, China
    不详
    Dongbei Daxue Xuebao, 2006, 7 (743-746):
  • [4] A Hybrid Real-Time Scheduling Mechanism Based on Multiprocessor for Real-Time Tasks in Weakly Hard Specification
    Ismail, Habibah
    Jawawi, Dayang N. A.
    Ahmedy, Ismail
    INTELLIGENT COMPUTING, VOL 1, 2022, 506 : 228 - 247
  • [5] Weakly hard real-time constraints on controller area network
    Broster, I
    Bernat, G
    Burns, A
    EUROMICRO RTS 2002: 14TH EUROMICRO CONFERENCE ON REAL-TIME SYSTEMS, PROCEEDINGS, 2002, : 134 - 141
  • [6] Scheduling of manufacturing systems under hard real-time constraints
    Salaheddine, DAEK
    2001 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN, AND CYBERNETICS, VOLS 1-5: E-SYSTEMS AND E-MAN FOR CYBERNETICS IN CYBERSPACE, 2002, : 1817 - 1822
  • [7] Handling precedence constraints with neural network based real-time scheduling algorithms
    Cardeira, C
    Silva, MP
    Mammeri, Z
    NINTH EUROMICRO WORKSHOP ON REAL TIME SYSTEMS, PROCEEDINGS, 1997, : 207 - 214
  • [8] A Hybrid Multiprocessor Scheduling Approach for Weakly Hard Real-Time Tasks
    Ismail, Habibah
    Jawawi, Dayang N. A.
    MODELING, DESIGN AND SIMULATION OF SYSTEMS, ASIASIM 2017, PT II, 2017, 752 : 666 - 678
  • [9] A tool for statistical analysis of hard real-time scheduling algorithms
    Goossens, J
    Hernalsteen, C
    31ST ANNUAL SIMULATION SYMPOSIUM, PROCEEDINGS, 1998, : 58 - 65
  • [10] A Weakly Hard Real-Time Tasks on Global Scheduling of Multiprocessor Systems
    Ismail, Habibah
    Jawawi, Dayang N. A.
    Isa, Mohd Adham
    2015 9TH MALAYSIAN SOFTWARE ENGINEERING CONFERENCE (MYSEC2015), 2015, : 123 - 128
12345