1978
DOI: 10.1109/proc.1978.11113
|View full text |Cite
|
Sign up to set email alerts
|

FTMP—A highly reliable fault-tolerant multiprocess for aircraft

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
40
0

Year Published

1983
1983
2020
2020

Publication Types

Select...
5
4

Relationship

0
9

Authors

Journals

citations
Cited by 306 publications
(40 citation statements)
references
References 8 publications
0
40
0
Order By: Relevance
“…They also provided an interesting contrast because they were developed from the same specifications; namely, to achieve a failure rate of 10 -9 per hour in a 10-hour flight, with maintenance intervals of hundreds of hours. MIT's design [HOPK78] used flexible hardware triplication and voting, with malfunctions detected and isolated by duplex "bus guardians" designed for a malfunction-safe mode of operation. Stanford's design [WENS78] relied on replicated software tasks executing on independent off-the-shelf computing elements and communicating through a voting protocol.…”
Section: Dependable Computer Systemsmentioning
confidence: 99%
“…They also provided an interesting contrast because they were developed from the same specifications; namely, to achieve a failure rate of 10 -9 per hour in a 10-hour flight, with maintenance intervals of hundreds of hours. MIT's design [HOPK78] used flexible hardware triplication and voting, with malfunctions detected and isolated by duplex "bus guardians" designed for a malfunction-safe mode of operation. Stanford's design [WENS78] relied on replicated software tasks executing on independent off-the-shelf computing elements and communicating through a voting protocol.…”
Section: Dependable Computer Systemsmentioning
confidence: 99%
“…The best known implementation of the Type lb structure is the Draper a Laboratory's Fault-Tolerant Multiprocessor (FTMP) [5]. i…”
Section: Canonical Models Of Real Time Multiprocessorsmentioning
confidence: 99%
“…)+µmP' + la-1+(j+l ) µPj.7+1 for 0<j<c, i>0 (5) (jt+cµ) pj,. = \pj-1.c +µmpi + l.o -1 for i>0 (6) The boundary condition is: 2 t Pj.)…”
Section: Qu45jtrmentioning
confidence: 99%
“…The other approach is to invoke an overload management technique upon detection of a failure. For example, one can prioritize tasks based on their importance to the application and discard tasks which do not adversely affect the performance delivered by the application [12]. The solution discussed in this paper for dealing with component failures is based on this latter approach.…”
Section: Introductionmentioning
confidence: 99%