Open AccessDissertation
Deterministic SpaceWire networks
David James Gibson
- 01 Jan 2017
2
TL;DR: This research contributes a novel SpaceWire-D scheduling strategy using a combination of path selection and transaction allocation algorithms that allows for a Space Wire-D network to be defined as a list of periodic, aperiodic and payload data bandwidth requirements and outputs aList of paths and an allocation of transactions to time-slots which satisfy the networking requirements of a mission.
read more
Abstract: SpaceWire-D is an extension to the SpaceWire protocol that adds deterministic capabilities over existing equipment. It does this by using time-division multiplexing, controlled by the sequential broadcasting of time-codes by a network manager. A virtual bus abstraction is then used to divide the network architecture into segments in which all traffic is controlled by a single Remote Memory Access Protocol (RMAP) transaction initiator. Virtual buses are then allocated a number of time-slots in which they are allowed to operate, forming the SpaceWire-D schedule. This research starts by contributing an efficient embedded SpaceWire-D software layer, running on top of the RTEMS real-time operating system, for use in the initiators of a SpaceWire-D network. Next, the SpaceWire-D software layer was used in two LEON2-FT processor boards in combination with multiple other RMAP target boards, routers, a network manager, and a host PC running a suite of applications to create a SpaceWire-D Demonstrator. The SpaceWire-D software layer and SpaceWire-D Demonstrator were used to verify and demonstrate the SpaceWire-D protocol during the ESA SpaceWire-D project and resulted in multiple deliverables to ESA. Finally, this research contributes a novel SpaceWire-D scheduling strategy using a combination of path selection and transaction allocation algorithms. This strategy allows for a SpaceWire-D network to be defined as a list of periodic, aperiodic and payload data bandwidth requirements and outputs a list of paths and an allocation of transactions to time-slots which satisfy the networking requirements of a mission.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Analysis of requirements for modern spacecraft onboard network protocols
Valentin Olenev
- 03 Mar 2021
TL;DR: The performed analysis of the existing demands on communication protocols resulted in a set of consolidated requirements for the physical-network layers’ protocols and the transport layer protocols.
The Sentinel-1 radar electronics subsystem development
Michael Hutchinson,Les Griffiths,Adrian Smith,Sam Doody +3 more
- 23 Apr 2012
TL;DR: In this article, the authors present the design considerations and the architectural approach, the implementation experience and the achieved test results that have met the design demands of the Sentinal-1 mission.
1
References
A note on two problems in connexion with graphs
TL;DR: A tree is a graph with one and only one path between every two nodes, where at least one path exists between any two nodes and the length of each branch is given.
GMES Sentinel-1 mission
Ramon Torres,Paul Snoeij,Dirk Geudtner,David Bibby,Malcolm Davidson,Evert Attema,Pierre Potin,Bjorn Rommen,Nicolas Floury,Michael Brown,Ignacio Navas Traver,Patrick Deghaye,Berthyl Duesmann,Betlem Rosich,Nuno Miranda,Claudio Bruno,Michelangelo L'Abbate,Renato Croci,Andrea Pietropaolo,Markus Huchler,Friedhelm Rostan +20 more
TL;DR: The unique data availability performance of the Sentinel-1 routine operations makes the mission particularly suitable for emergency response support, marine surveillance, ice monitoring and interferometric applications such as detection of subsidence and landslides.
1.7K
An Algorithm for Path Connections and Its Applications
TL;DR: The algorithm described in this paper is the outcome of an endeavor to answer the following question: Is it possible to find procedures which would enable a computer to solve efficiently path-connection problems inherent in logical drawing, wiring diagramming, and optimal route finding?
1.6K
•Book
Priority queues
N. K. Jaiswal
- 01 Jan 1968
TL;DR: This interface is suitable for dealing with the line-like-behavior that the system needs to manage, but it ought to require that dequeue return the highest priority item in the queue, regardless of how long it has been in the structure.
691