TY - GEN
T1 - Low-overhead hard real-time aware interconnect network router
AU - Kinsy, Michel A.
AU - Devadas, Srinivas
N1 - Publisher Copyright: © 2014 IEEE.
PY - 2014/2/11
Y1 - 2014/2/11
N2 - The increasing complexity of embedded systems is accelerating the use of multicore processors in these systems. This trend gives rise to new problems such as the sharing of on-chip network resources among hard real-time and normal best effort data traffic. We propose a network-on-chip router that provides predictable and deterministic communication latency for hard real-time data traffic while maintaining high concurrency and throughput for best-effort/general-purpose traffic with minimal hardware overhead. The proposed router requires less area than non-interfering networks, and provides better Quality of Service (QoS) in terms of predictability and determinism to hard real-time traffic than priority-based routers. We present a deadlock-free algorithm for decoupled routing of the two types of traffic. We compare the area and power estimates of three different router architectures with various QoS schemes using the IBM 45-nm SOI CMOS technology cell library. Performance evaluations are done using three realistic benchmark applications: a hybrid electric vehicle application, a utility grid connected photovoltaic converter system, and a variable speed induction motor drive application.
AB - The increasing complexity of embedded systems is accelerating the use of multicore processors in these systems. This trend gives rise to new problems such as the sharing of on-chip network resources among hard real-time and normal best effort data traffic. We propose a network-on-chip router that provides predictable and deterministic communication latency for hard real-time data traffic while maintaining high concurrency and throughput for best-effort/general-purpose traffic with minimal hardware overhead. The proposed router requires less area than non-interfering networks, and provides better Quality of Service (QoS) in terms of predictability and determinism to hard real-time traffic than priority-based routers. We present a deadlock-free algorithm for decoupled routing of the two types of traffic. We compare the area and power estimates of three different router architectures with various QoS schemes using the IBM 45-nm SOI CMOS technology cell library. Performance evaluations are done using three realistic benchmark applications: a hybrid electric vehicle application, a utility grid connected photovoltaic converter system, and a variable speed induction motor drive application.
UR - http://www.scopus.com/inward/record.url?scp=84946688644&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84946688644&partnerID=8YFLogxK
U2 - 10.1109/HPEC.2014.7040976
DO - 10.1109/HPEC.2014.7040976
M3 - Conference contribution
T3 - 2014 IEEE High Performance Extreme Computing Conference, HPEC 2014
BT - 2014 IEEE High Performance Extreme Computing Conference, HPEC 2014
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2014 IEEE High Performance Extreme Computing Conference, HPEC 2014
Y2 - 9 September 2014 through 11 September 2014
ER -