Using non-preemptive regions and path modification to improve schedulability of real-time traffic over priority-based NOCs

DOI10.1007/S11241-017-9276-5zbMath1476.68030DBLPjournals/rts/LiuBBN17OpenAlexW2626332731WikidataQ59612109 ScholiaQ59612109MaRDI QIDQ1640307

Meng Liu, Thomas Nolte, Matthias Becker, Moris Behnam

Publication date: 14 June 2018

Published in: Real-Time Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11241-017-9276-5

zbMATH Keywords

routingresponse time analysisnetwork-on-chipreal-time traffic

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cites Work

• Feasibility analysis under fixed priority scheduling with limited preemptions
• Worst-case end-to-end delays evaluation for \texttt{SpaceWire} networks
• Worst-case response time analysis of real-time tasks under fixed-priority scheduling with deferred preemption
• SLA: A Stage-Level Latency Analysisfor Real-Time Communicationin a Pipelined Resource Model
• Reliability, Availability and Serviceability of Networks-on-Chip
• Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

This page was built for publication: Using non-preemptive regions and path modification to improve schedulability of real-time traffic over priority-based NOCs