A Period Assignment Method for Fixed Priority Preemptive Real-time Systems

被引:4
|
作者
Liu, Jiankang [1 ]
Fu, Yunzhong [1 ]
Chen, Chuanwei [1 ]
Fu, Hongya [1 ]
机构
[1] Harbin Inst Technol, Sch Mech & Elect Engn, Zhi Zao Lou 415, Harbin, Heilongjiang, Peoples R China
关键词
Real-time System; Period Assignment; Fixed-priority; Response Time; Schedulability; SELECTION;
D O I
10.1145/3012258.3012275
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Fixed priority preemptive scheduling policy is widely adopted for periodic task scheduling in embedded real-time operating systems. However, there are few methods or criteria for period assignment of periodic tasks. In this paper, a period assignment method which combines schedulability analysis and quality of service considerations is proposed. Periodic task sets with ranges for the periods of individual tasks are considered. This method is designed to enlarge the tasks' quality of service while maintaining schedulability of the system. High priority tasks are given preference to be assigned with a short period. A case study is presented to show the effectiveness of the proposed period assignment algorithm.
引用
收藏
页码:89 / 92
页数:4
相关论文
共 50 条
  • [31] An empirical study of permutational genetic crossover and mutation operators on the fixed priority assignment in distributed real-time systems
    Azketa, Ekain
    Uribe, Juan P.
    Marcos, Marga
    Almeida, Luis
    Javier Gutierrez, J.
    2012 IEEE INTERNATIONAL CONFERENCE ON INDUSTRIAL TECHNOLOGY (ICIT), 2012, : 598 - 605
  • [32] Response Time Upper Bounds for Fixed Priority Real-Time Systems.
    Davis, R. I.
    Burns, A.
    RTSS: 2008 REAL-TIME SYSTEMS SYMPOSIUM, PROCEEDINGS, 2008, : 407 - 418
  • [33] Test of preemptive real-time systems
    Adjir, Noureddine
    de Saqui-Sannes, Pieffe
    Rahmouni, K. Mustapha
    2008 IEEE/ACS INTERNATIONAL CONFERENCE ON COMPUTER SYSTEMS AND APPLICATIONS, VOLS 1-3, 2008, : 734 - +
  • [34] Stochastic analysis of real-time systems under preemptive priority-driven scheduling
    Lopez, Jose Maria
    Diaz, Jose Luis
    Entrialgo, Joaquin
    Garcia, Daniel
    REAL-TIME SYSTEMS, 2008, 40 (02) : 180 - 207
  • [35] Bounding demand paging costs in fixed priority real-time systems
    Lee, Young-Ho
    Hwang, Hoyoung
    Kim, Kanghee
    Lim, Sung-Soo
    COMPUTATIONAL SCIENCE - ICCS 2007, PT 4, PROCEEDINGS, 2007, 4490 : 897 - +
  • [36] Efficient exact schedulability tests for fixed priority real-time systems
    Davis, Robert I.
    Zabos, Attila
    Burns, Alan
    IEEE TRANSACTIONS ON COMPUTERS, 2008, 57 (09) : 1261 - 1276
  • [37] Fixed priority timing analysis of real-time systems with limited parallelism
    Audsley, NC
    Bletsas, K
    16TH EUROMICRO CONFERENCE ON REAL-TIME SYSTEMS, PROCEEDINGS, 2004, : 231 - 238
  • [38] Stochastic analysis of real-time systems under preemptive priority-driven scheduling
    José María López
    José Luis Díaz
    Joaquín Entrialgo
    Daniel García
    Real-Time Systems, 2008, 40 : 180 - 207
  • [39] Optimal minimal routing and priority assignment for priority-preemptive real-time NoCs (vol 53, pg 578, 2017)
    Nikolic, Borislav
    Pinho, Luis Miguel
    REAL-TIME SYSTEMS, 2017, 53 (04) : 613 - 613
  • [40] PASS: Priority Assignment of Real-Time Tasks with Dynamic Suspending Behavior under Fixed-Priority Scheduling
    Huang, Wen-Hung
    Chen, Jian-Jia
    Zhou, Husheng
    Liu, Cong
    2015 52ND ACM/EDAC/IEEE DESIGN AUTOMATION CONFERENCE (DAC), 2015,