Reducing occurrences of priority inversion in MSoC's using dynamic processor priority assignment

被引:0
|
作者
Collin, M [1 ]
Nikitovic, M [1 ]
Norström, C [1 ]
机构
[1] Malardalen Univ, Dept Comp Engn, Vasteras, Sweden
关键词
D O I
暂无
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
In a single processor real-time system the question whether a taskset is schedulable or not is essential and not always easy to answer, and it is even more challenging in multiprocessor real-time systems. To determine the schedulability of a taskset the maximum blocking time far each task must be known. When considering schedulability of tasks on a multiprocessor with a shared bus, both local blocking and interprocessor blocking must be known and considered. To reduce the time high priority tasks are blocked by low priority task on a shared bus multiprocessor system we propose a dynamic priority based arbitration of processors. In our proposal, a processor's priority is a direct mapping of the relative priority of all tasks currently executing, The mapping of priorities onto processors is managed by a hardware operating system kernel which continuously updates the arbiter with priority changes. The information shared between the hardware operating system and the arbiter is done in parallel and does not put additional strain on bus traffic. The solution is implemented by augmenting an hardware realtime scheduler and an arbiter unit with added functionality. Systems-on-a-Chip (SoC's) offers the design freedom needed for our proposed solution to reduce occurrences of priority inversion in Multiprocessor SoC (MSoC).
引用
收藏
页码:5 / 8
页数:4
相关论文
共 50 条
  • [1] An Efficient Channel Access Method Using Polling and Dynamic Priority Assignment
    Tomar, Pragya Singh
    Poonacha, P. G.
    [J]. 2013 4TH IEEE INTERNATIONAL CONFERENCE ON COMPUTER & COMMUNICATION TECHNOLOGY (ICCCT), 2013, : 145 - 150
  • [2] Priority inversion in dynamic priority driven scheduling algorithms due to imperfect clock synchronization
    Ruiz, L
    Decotignie, JD
    [J]. ETFA '96 - 1996 IEEE CONFERENCE ON EMERGING TECHNOLOGIES AND FACTORY AUTOMATION, PROCEEDINGS, VOLS 1 AND 2, 1996, : 27 - 34
  • [3] A Scheduling Algorithm with Dynamic Priority Assignment for WCDMA Systems
    Skoutas, Dimitrios N.
    Rouskas, Angelos N.
    [J]. IEEE TRANSACTIONS ON MOBILE COMPUTING, 2009, 8 (01) : 126 - 138
  • [4] Dynamic priority strategies for wavelength assignment in WDM rings
    Waldman, H
    Campelo, DR
    Camelo, R
    [J]. GLOBECOM '00: IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE, VOLS 1- 3, 2000, : 1288 - 1292
  • [5] PRIORITY ASSIGNMENT USING DYNAMIC-PROGRAMMING FOR A CLASS OF QUEUING-SYSTEMS
    PATTIPATI, KR
    KLEINMAN, DL
    [J]. IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 1981, 26 (05) : 1095 - 1106
  • [6] Improved analysis and optimal priority assignment for communicating threads on uni-processor
    Zhao, Qingling
    Zhao, Yecheng
    Zou, Minhui
    Gao, Zhigang
    Zeng, Haibo
    [J]. JOURNAL OF SYSTEMS ARCHITECTURE, 2022, 124
  • [7] Dynamic priority assignment for SLA compliance in service function chains
    Wetzels, Frank
    van den Berg, Hans
    Bosman, Joost
    van der Mei, Rob
    [J]. 2019 26TH INTERNATIONAL CONFERENCE ON TELECOMMUNICATIONS (ICT), 2019, : 160 - 166
  • [8] Dynamic priority assignment for aperiodic tasks in limited preemptive scheduling
    Embedded Software Engineering, Kwangwoon University, Korea, Republic of
    不详
    [J]. IEIE Trans. Smart Process Comput., 2020, 5 (365-370): : 365 - 370
  • [9] ML for RT: Priority Assignment Using Machine Learning
    Lee, Seunghoon
    Baek, Hyeongboo
    Woo, Honguk
    Shin, Kang G.
    Lee, Jinkyu
    [J]. 2021 IEEE 27TH REAL-TIME AND EMBEDDED TECHNOLOGY AND APPLICATIONS SYMPOSIUM (RTAS 2021), 2021, : 118 - 130
  • [10] Reducing the user perceived delay of interactive TCP connections using a dynamic priority approach
    Dimopoulos, P
    Zeephongsekul, P
    Tari, Z
    [J]. ICCCN 2005: 14TH INTERNATIONAL CONFERENCE ON COMPUTER COMMUNICATIONS AND NETWORKS, PROCEEDINGS, 2005, : 421 - 427