mdh.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Response time analysis for static priority based SpaceWire networks
Mälardalen University, School of Innovation, Design and Engineering. (IS)ORCID iD: 0000-0001-9736-8490
Mälardalen University, School of Innovation, Design and Engineering. (IS)ORCID iD: 0000-0002-1687-930X
Mälardalen University, School of Innovation, Design and Engineering. (IS)ORCID iD: 0000-0001-6132-7945
University of Porto.
2012 (English)In: Proceeings of the 2nd International Workshop on Worst-Case Traversal Time (WCTT '12), 2012, p. 7-14Conference paper, Published paper (Refereed)
Abstract [en]

The SpaceWire network standard is used in spacecraft communications and has been selected for future ESA satellites. In order to guarantee the safety and reliability of on-board systems, the designers have to make sure that all critical timing constraints are satisfied. The SpaceWire network is a wormhole based network which makes its timing analysis significantly complex. Some methods for computing upper-bounds of end-to-end delays of certain wormhole network models have been developed. However, those models require some explicit assumptions and dedicated real-time mechanisms which cannot be supported by the current SpaceWire networks. Moreover, some work has proposed analysis approaches for SpaceWire networks assuming the Round-Robin arbitration scheme only. In this paper, we focus on the priority based arbitration scheme instead and we propose a worst-case response time analysis to evaluate the end-to-end delays of traffic transmissions in SpaceWire networks. The corresponding proofs to our analysis are presented along with a case study. © 2012 ACM.

Place, publisher, year, edition, pages
2012. p. 7-14
Series
ACM International Conference Proceeding Series
Keywords [en]
C.2.4 [Computer Systems Organization]: Distributed Systems, C.3 [Computer Systems Organization]: SPECIAL-PURPOSE AND APPLICATION-BASED SYSTEMS-Real-time and embedded systems, G.m [Mathematics of Computing]: MISCELLANEOUS - Queueing theory, Performance
National Category
Engineering and Technology
Identifiers
URN: urn:nbn:se:mdh:diva-18232DOI: 10.1145/2428592.2428594Scopus ID: 2-s2.0-84873376701ISBN: 9781450316866 (print)OAI: oai:DiVA.org:mdh-18232DiVA, id: diva2:605829
Conference
2nd International Workshop on Worst-Case Traversal Time, WCTT 2012, 4 December 2012 through 4 December 2012, San Juan
Available from: 2013-02-15 Created: 2013-02-15 Last updated: 2013-12-03Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records BETA

Liu, MengBehnam, MorisNolte, Thomas

Search in DiVA

By author/editor
Liu, MengBehnam, MorisNolte, Thomas
By organisation
School of Innovation, Design and Engineering
Engineering and Technology

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 17 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf