×

zbMATH — the first resource for mathematics

Worst-case end-to-end delays evaluation for SpaceWire networks. (English) Zbl 1226.93097
Summary: SpaceWire is a standard for on-board satellite networks chosen by the ESA as the basis for multiplexing payload and control traffic on future data-handling architectures. However, network designers need tools to ensure that the network is able to deliver critical messages on time. Current research fails to address this needs for SpaceWire networks. On one hand, many papers only seek to determine probabilistic results for end-to-end delays on Wormhole networks like SpaceWire. This does not provide sufficient guarantee for critical traffic. On the other hand, a few papers give methods to determine maximum latencies on wormhole networks that, unlike SpaceWire, have dedicated real-time mechanisms built-in. Thus, in this paper, we propose an appropriate method to compute an upper-bound on the worst-case end-to-end delay of a packet in a SpaceWire network.

MSC:
93C83 Control/observation systems involving computers (process control, etc.)
90B18 Communication networks in operations research
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] Balakrishnan S, Özgüner F (1998) A priority-driven flow control mechanism for real-time traffic in multiprocessor networks. IEEE Trans Parallel Distrib Syst 9(7):664–678. doi: 10.1109/71.707545
[2] Dally W (1990) Performance analysis of k-ary n-cube interconnection networks. IEEE Trans Comput 39(6):775–785. doi: 10.1109/12.53599
[3] Dally W (1992) Virtual-channel flow control. IEEE Trans Parallel Distrib Syst 3(2):194–205. doi: 10.1109/71.127260 · Zbl 05106668
[4] Dally W, Seitz C (1987) Deadlock-free message routing in multiprocessor interconnection networks. IEEE Trans Comput C-36(5):547–553. doi: 10.1109/TC.1987.1676939 · Zbl 0617.68037
[5] Draper JT, Ghosh J (1994) A comprehensive analytical model for wormhole routing in multicomputer systems. J Parallel Distrib Comput 1–34
[6] ECSS (2008) Spacewire–links, nodes, routers and networks, pp 1–129
[7] IEEE Computer Society (1996) IEEE standard for heterogeneous interconnect (hic) (low-cost, low-latency scalable serial interconnect for parallel system construction). IEEE Standard 1355-1995
[8] Kim B, Kim J, Hong S, Lee S (1998) A real-time communication method for wormhole switching networks. In: 1998 Proceedings international conference on parallel processing, pp 527–534
[9] Le Boudec JY, Thiran P (2004) Network calculus a theory of deterministic queuing systems for the internet. LNCS 2050. Springer Verlag, pp 1–265
[10] Lu Z, Jantsch A, Sander I (2005) Feasibility analysis of messages for on-chip networks using wormhole routing. In: Design automation conference, 2005 proceedings of the ASP-DAC 2005 Asia and South Pacific, vol 2, pp 960–964. doi: 10.1109/ASPDAC.2005.1466499
[11] Mifdaoui A, Frances F, Fraboul C (2007) Real-time characteristics of switched ethernet for ”1553b”-embedded applications: simulation and analysis. In: 2007 SIES ’07 international symposium on industrial embedded systems, pp 33–40. doi: 10.1109/SIES.2007.4297314
[12] Mutka MW (1994) Using rate monotonic scheduling technology for real-time communications in a wormhole network. In: Proceedings of the second workshop on parallel and distributed real-time systems, pp 194–199. doi: 10.1109/WPDRTS.1994.365629
[13] Parkes S (2009) Spacewire-t initial protocol definition
[14] Parkes SM, Armbruster P (2005) Spacewire: a spacecraft onboard network for real-time communications. IEEE-NPSS Real Time Conf (14):1–5
[15] Qian Y, Lu Z, Dou W (2009) Analysis of worst-case delay bounds for best-effort communication in wormhole networks on chip. In: Proceedings of the 2009 3rd ACM/IEEE international symposium on networks-on-chip, pp 44–53
[16] Shi Z, Burns A (2009) Real-time communication analysis with a priority share policy in on-chip networks. In: 2009 ECRTS ’09 21st Euromicro conference on real-time systems, pp 3–12. doi: 10.1109/ECRTS.2009.17
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.