Simple Search:

Exact parallel plurality voting algorithm for totally ordered object space fault-tolerant systems


Citation

Karimi, Abbas and Zarafshan, Faraneh and Jantan, Adznan and Ramli, Abdul Rahman and Saripan, M. Iqbal and Syed Mohamed, Syed Abdul Rahman Al-Haddad (2012) Exact parallel plurality voting algorithm for totally ordered object space fault-tolerant systems. Pertanika Journal of Science & Technology, 20 (1). pp. 89-96. ISSN 0128-7680; ESSN: 2231-8526

Abstract / Synopsis

Plurality voter is one of the commonest voting methods for decision making in highly-reliable applications in which the reliability and safety of the system is critical. 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. The asymptotic analysis of the new proposed algorithm has demonstrated that it has a time complexity of O (log n) which is less than time complexity of sequential plurality algorithm, i.e. Ω (n log n).


Download File

[img]
Preview
PDF
7. Exact parallel plurality voting algorithm for totally ordered object space fault-tolerant systems.pdf

Download (368kB) | Preview

Additional Metadata

Item Type: Article
Divisions: Faculty of Engineering
Publisher: Universiti Putra Malaysia Press
Keywords: Fault-tolerant; Parallel algorithm; PRAM; Voting algorithm
Depositing User: Najah Mohd Ali
Date Deposited: 04 Nov 2015 10:17
Last Modified: 26 Oct 2018 10:31
URI: http://psasir.upm.edu.my/id/eprint/40437
Statistic Details: View Download Statistic

Actions (login required)

View Item View Item