NTRS - NASA Technical Reports Server

Back to Results
Alternative majority-voting methods for real-time computing systemsTwo 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.
Document ID
Document Type
Reprint (Version printed in journal)
External Source(s)
Shin, Kang G. (Michigan Univ. Ann Arbor, MI, United States)
Dolter, James W. (Michigan, University Ann Arbor, United States)
Date Acquired
August 14, 2013
Publication Date
April 1, 1989
Publication Information
Publication: IEEE Transactions on Reliability
Volume: 38
ISSN: 0018-9529
Subject Category
Funding Number(s)
CONTRACT_GRANT: N00014-85-K-0531
CONTRACT_GRANT: N00014-85-K-0122
Distribution Limits