Voting Algorithms

@inproceedings{Parhami2004VotingA,
  title={Voting Algorithms},
  author={Behrooz Parhami},
  year={2004}
}
Sum& Conclusions Voting is important in the realization of ultrareliable systems based on the multi-channel computation paradigm. In an earlier paper (1991 Aug) I dealt with voting networks, viz, hardware implementation of certain voting schemes. A voting algorithm specifies how the voting result is obtained from the input data and can be the basis for implementing a hardware voting network or a software voting routine. This paper presents efficient n-way plurality and threshold voting… CONTINUE READING
Highly Cited
This paper has 125 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 82 extracted citations

126 Citations

051015'02'05'09'13'17
Citations per Year
Semantic Scholar estimates that this publication has 126 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 30 references

Scheduling of replicated fasks to meet correctness requirements and deadlines

  • Boston. B. Parhami, C. Y. Hung
  • Proc. 26rh Hawaii Int ’1 Con$ System Sciences…
  • 1993

Use of diversity in experimental reactor safety systems

  • U. Voges
  • IEEE Trans. Computers,
  • 1991

Voting networks

  • B. Parhami
  • IEEE Trans. Reliability,
  • 1991

Implementing fault tolerance via modular redundancy with comparison

  • Toulouse, France. Y. Chen, T. Chen
  • Tolerant Computing,
  • 1990

Design and Analysis of Fault-Tolerant

  • B. W. Johnson
  • Digital Systems,
  • 1989

Computer Science from the University of California, Los Angeles

  • Behrooz Parhami
  • From 1974 to 1988 he was with Sharif University…
  • 1988

Similar Papers

Loading similar papers…