Abstract
In this article we consider the deadlock-free routing problem for onboard SpaceWire network with redundant devices. We work with static routing, it means that, routing tables are calculated and uploaded into the switches before launch the SpaceWire network. We solve deadlock-free problem with Up/Down routing approach, which is based on acyclic directed network graph. To build acyclic directed graph we modify the original algorithm of DFS based creating spanning tree. To find the routes of data transmission in the network we convert created directed graph to channel dependency graph. Also in this article we provide an example and explanation of our algorithms for deadlock-free routing in SpaceWire network.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
