Task Priority aware SoC-Bus for Embedded Systems

被引:2
作者
Mauroner, Fabian [1 ]
Baunach, Marcel [1 ]
机构
[1] Graz Univ Technol, Inst Tech Informat, Graz, Austria
来源
2018 IEEE INTERNATIONAL CONFERENCE ON INDUSTRIAL TECHNOLOGY (ICIT) | 2018年
关键词
Embedded systems; Multi-Core; SoC-Bus; Priority-Awareness; FPGA implementation;
D O I
10.1109/ICIT.2018.8352394
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
System-on-a-Chip (SoC)-buses are designed to communicate from masters to slaves. In a multi-master system, the masters combat for accessing the slaves. In the past, different arbitration algorithms have been invented to grant access to the slaves. However, these algorithms are not aware of the currently running task's priority that wants to access the slaves; thus, a lower prioritized task could access the slave first. Other solutions with priority awareness use additional wires and support only a few priority levels that cannot be mapped from a task priority. In this paper, we present a SoC-bus that is suitable for hard real-time systems, where the highest combating prioritized task immediately gets access to the addressed slave. The lower prioritized tasks are stalled, what is managed by the interconnect logic. We implemented our proposed approach into a Field Programmable Gate Array (FPGA) and we show the required hardware resource consumption. Further, we demonstrate the considerations of the task priorities in a use case scenario.
引用
收藏
页码:1453 / 1458
页数:6
相关论文
共 17 条
[1]  
[Anonymous], 2015, AVALON INTERFACE SPE
[2]  
[Anonymous], 2002, PROC LOC BUS PLB ARB
[3]  
[Anonymous], 2015, ARM AMBA 5 AHB PROT
[4]  
ARM, 1999, Technical report
[5]  
ARM Limited, 2006, AMBA 3 AHB LIT PROT
[6]  
Bhawna Tiwari R. C., 2016, P INT C COMP TECHN I
[7]  
Carpenter J., 2004, HDB SCHEDULING ALGOR
[8]  
Coffman E. G. Jr., 1971, Computing Surveys, V3, P67, DOI 10.1145/356586.356588
[9]  
International Organization for Standardization, 2015, TECH REP
[10]   SCHEDULING ALGORITHMS FOR MULTIPROGRAMMING IN A HARD-REAL-TIME ENVIRONMENT [J].
LIU, CL ;
LAYLAND, JW .
JOURNAL OF THE ACM, 1973, 20 (01) :46-61