Deterministic Message Routing for Safety-Critical Applications
Authors: Croll, Peter R.
This paper considers a technique of message passing which can be applied in the development of parallel programs for safety-critical applications. The routing algorithm used to ensure that messages will always be able to meet hard real-time constraints and yet cope with some degree of hardware failure. This paper will firstly introduce the routing algorithm, it will indicate what properties can be proved about deterministic message passing and describe how the algorithms cope with hardware failure. From this, the details of possible solutions that the new T9000 family can offer will be presented.
Proceedings of WoTUG-14: Occam and the Transputer-Current Developments, Janet Edwards, 1991, pp 234 - 246 published by IOS Press, Amsterdam
This record in other formats:Web page: BibTEX, Refer
Plain text: BibTEX, Refer
If you have any comments on this database, including inaccuracies, requests to remove or add information, or suggestions for improvement, the WoTUG web team are happy to hear of them. We will do our best to resolve problems to everyone's satisfaction.
Copyright for the papers presented in this database normally resides with the authors; please contact them directly for more information. Addresses are normally presented in the full paper.
Pages © WoTUG, or the indicated author. All Rights Reserved.
Comments on these web pages should be addressed to: www at wotug.org