Worst-case end-to-end delays evaluation for \texttt{SpaceWire} networks

DOI10.1007/S10626-011-0103-1zbMath1226.93097OpenAlexW1963562957MaRDI QIDQ645049

Thomas Ferrandiz, Fabrice Frances, Christian Fraboul

Publication date: 8 November 2011

Published in: Discrete Event Dynamic Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10626-011-0103-1

zbMATH Keywords

performance evaluationwormhole routingembedded networkspacewireworst-case end-to-end delays

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Control/observation systems involving computers (process control, etc.) (93C83)

Related Items (2)

Using non-preemptive regions and path modification to improve schedulability of real-time traffic over priority-based NOCs ⋮ Real-time analysis of priority-preemptive NoCs with arbitrary buffer sizes and router delays

Cites Work

• Deadlock-Free Message Routing in Multiprocessor Interconnection Networks

This page was built for publication: Worst-case end-to-end delays evaluation for \texttt{SpaceWire} networks