Fixed-priority scheduling of real-time systems using utilization bounds

被引：18
|
作者：
Park, DW
Natarajan, S
Kanevsky, A
机构：
[1] PAI CHAI UNIV,DEPT COMP SCI,DAE JUN,SOUTH KOREA
[2] XEROX CORP,HENRIETTA,NY
[3] MITRE CORP,BEDFORD,MA 01730
来源：
JOURNAL OF SYSTEMS AND SOFTWARE | 1996年 / 33卷 / 01期
基金：
美国国家航空航天局;
关键词：
D O I：
10.1016/0164-1212(95)00105-0
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
We have developed a new technique for determining at design time, the utilization bound for a specific set df hard real-time periodic tasks with known periods, when scheduled by any arbitrary fixed priority algorithm. The technique does not depend on precise knowledge of task computation times and does not require that task deadlines coincide with the arrival of the next request of the task. In this paper, we describe the technique and discuss how it can be applied to facilitate an engineering approach to the problem of task scheduling in hard real-time systems.
引用
收藏
页码：57 / 63
页数：7
相关论文
共 50 条
  • [1] TIMING ANALYSIS FOR FIXED-PRIORITY SCHEDULING OF HARD REAL-TIME SYSTEMS
    HARBOUR, MG
    KLEIN, MH
    LEHOCZKY, JP
    [J]. IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 1994, 20 (01) : 13 - 28
  • [2] Preference-Oriented Fixed-Priority Scheduling for Real-Time Systems
    Begam, Rehana
    Zhu, Dakai
    Aydin, Hakan
    [J]. 2014 IEEE 12TH INTERNATIONAL CONFERENCE ON DEPENDABLE, AUTONOMIC AND SECURE COMPUTING (DASC)/2014 IEEE 12TH INTERNATIONAL CONFERENCE ON EMBEDDED COMPUTING (EMBEDDEDCOM)/2014 IEEE 12TH INTERNATIONAL CONF ON PERVASIVE INTELLIGENCE AND COMPUTING (PICOM), 2014, : 159 - +
  • [3] Parametric Utilization Bounds for Fixed-Priority Multiprocessor Scheduling
    Guan, Nan
    Stigge, Martin
    Yi, Wang
    Yu, Ge
    [J]. 2012 IEEE 26TH INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM (IPDPS), 2012, : 261 - 272
  • [4] Fixed-priority global scheduling for mixed-criticality real-time systems
    Kelly, Owen R.
    Aydin, Hakan
    [J]. INTERNATIONAL JOURNAL OF EMBEDDED SYSTEMS, 2014, 6 (2-3) : 266 - 276
  • [5] The Concept of Unschedulability Core for Optimizing Real-Time Systems with Fixed-Priority Scheduling
    Zhao, Yecheng
    Zeng, Haibo
    [J]. IEEE TRANSACTIONS ON COMPUTERS, 2019, 68 (06) : 926 - 938
  • [6] Practical on-line DVS scheduling for fixed-priority real-time systems
    Mochocki, B
    Hu, XS
    Quan, G
    [J]. RTAS 2005: 11TH IEEE REAL TIME AND EMBEDDED TECHNOLOGY AND APPLICATIONS SYMPOSIUM, PROCEEDINGS, 2005, : 224 - 233
  • [7] Energy Efficient Scheduling for Hard Real-Time Systems with Fixed-Priority Assignment
    Niu, Linwei
    [J]. 2010 IEEE 29TH INTERNATIONAL PERFORMANCE COMPUTING AND COMMUNICATIONS CONFERENCE (IPCCC), 2010, : 153 - 160
  • [8] ON THE COMPLEXITY OF FIXED-PRIORITY SCHEDULING OF PERIODIC, REAL-TIME TASKS
    LEUNG, JYT
    WHITEHEAD, J
    [J]. PERFORMANCE EVALUATION, 1982, 2 (04) : 237 - 250
  • [9] Analyzing stochastic fixed-priority real-time systems
    Gardner, MK
    Liu, JWS
    [J]. TOOLS AND ALGORITHMS FOR THE CONSTRUCTION AND ANALYSIS OF SYSTEMS, 1999, 1579 : 44 - 58
  • [10] Sensitivity analysis for fixed-priority real-time systems
    Enrico Bini
    Marco Di Natale
    Giorgio Buttazzo
    [J]. Real-Time Systems, 2008, 39 : 5 - 30
12345