Using non-preemptive regions and path modification to improve schedulability of real-time traffic over priority-based NOCs
From MaRDI portal
Publication:1640307
DOI10.1007/S11241-017-9276-5zbMATH Open1476.68030DBLPjournals/rts/LiuBBN17OpenAlexW2626332731WikidataQ59612109 ScholiaQ59612109MaRDI QIDQ1640307FDOQ1640307
Authors: Meng Liu, Matthias Becker, Moris Behnam, Thomas Nolte 
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
Recommendations
- Real-time analysis of priority-preemptive NoCs with arbitrary buffer sizes and router delays
- Schedulability analysis and task mapping for real-time on-chip communication
- Proportionally fair flow control mechanism for best effort traffic in network-on-chip architectures
- Evaluation and improvement of response time bounds for real-time applications under non-pre-emptive Fixed Priority Scheduling
- Efficient Parallel Buffer Structure and Its Management Scheme for a Robust Network-on-Chip (NoC) Architecture
Cites Work
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
- Worst-case response time analysis of real-time tasks under fixed-priority scheduling with deferred preemption
- Feasibility analysis under fixed priority scheduling with limited preemptions
- Worst-case end-to-end delays evaluation for \texttt{SpaceWire} networks
- SLA: A Stage-Level Latency Analysisfor Real-Time Communicationin a Pipelined Resource Model
- Reliability, availability and serviceability of networks-on-chip
Cited In (2)
This page was built for publication: Using non-preemptive regions and path modification to improve schedulability of real-time traffic over priority-based NOCs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1640307)
