Search Results - parallel voting based algorithm*

Voting algorithms for large scale fault-tolerant systems by Karimi, Abbas

“…To solve this problem and gain benefits of this algorithm, we employed parallel algorithm technique and by using optimal number of processors, we could propose optimal algorithms known as Parallel Average Voting and Parallel Weighted Average Voting which both have optimal time complexity and less calculation cost. …”
Get full text
Get full text

Exact parallel plurality voting algorithm for totally ordered object space fault-tolerant systems by Karimi, Abbas, Zarafshan, Faraneh, Jantan, Adznan, Ramli, Abdul Rahman, Saripan, M. Iqbal, Syed Mohamed, Syed Abdul Rahman Al-Haddad

“…To resolve the problem associated with sequential plurality voter in dealing with large number of inputs, this paper introduces a new generation of plurality voter based on parallel algorithms. Since parallel algorithms normally have high processing speed and are especially appropriate for large scale systems, they are therefore used to achieve a new parallel plurality voting algorithm by using (n/log n) processors on EREW shared-memory PRAM. …”
Get full text
Get full text
Get full text