Alternative majority-voting methods for real-time computing systems
Shin, K.G.
Dolter, J.W.
Michigan Univ., Ann Arbor, MI;
This paper appears in: Reliability, IEEE Transactions on
Publication Date: Apr 1989
Volume: 38,
Issue: 1
On page(s): 58-64
ISSN: 0018-9529
References Cited: 10
CODEN: IERQAD
INSPEC Accession Number: 3420764
Digital Object Identifier: 10.1109/24.24574
Current Version Published: 2002-08-06
Abstract
Two techniques that provide a compromise between the high time
overhead in maintaining synchronous voting and the difficulty of
combining results in asynchronous voting are proposed. These techniques
are specifically suited for real-time applications with a
single-source/single-sink structure that need instantaneous error
masking. They provide a compromise between a tightly synchronized system
in which the synchronization overhead can be quite high, and an
asynchronous system which lacks suitable algorithms for combining the
output data. Both quorum-majority voting (QMV) and compare-majority
voting (CMV) are most applicable to distributed real-time systems with
single-source/single-sink tasks. All real-time systems eventually have
to resolve their outputs into a single action at some stage. The
development of the advanced information processing system (AIPS) and
other similar systems serve to emphasize the importance of these
techniques. Time bounds suggest that it is possible to reduce the
overhead for quorum-majority voting to below that for synchronous
voting. All the bounds assume that the computation phase is
nonpreemptive and that there is no multitasking
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
