By Topic

Parallel algorithms for m-out-of-n threshold voting

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Parhami, B. ; Dept. of Electr. & Comput. Eng., California Univ., Santa Barbara, CA, USA

Voting on large collections of input objects is becoming increasingly important in data fusion, signal and image processing, and distributed computing. To achieve high speed in voting, the multiple processing resources typically available in such applications should be utilized; hence the need for parallel voting algorithms. We develop efficient parallel algorithms for threshold voting which generalize and extend previous work on both sequential threshold voting and parallel majority voting. We show how a well-known O(n)-time sequential algorithm for m-out-of-n voting can be parallelized through 1 simple divide-and-conquer strategy. When m=θ(n), the resulting algorithm has O(log2 n) time complexity on PRAM and hypercube computers and optimal O(n1k/) complexity on a k-dimensional mesh-connected architecture. We also analyze the time complexity of the algorithm in the case of m=o(n) and for certain weighted threshold voting schemes

Published in:

Algorithms & Architectures for Parallel Processing, 1996. ICAPP 96. 1996 IEEE Second International Conference on

Date of Conference:

11-13 Jun 1996