Exact parallel plurality voting algorithm for totally ordered object space fault-tolerant systems
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...
| Main Authors: | , , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Universiti Putra Malaysia Press
2012
|
| Online Access: | http://psasir.upm.edu.my/id/eprint/40437/ http://psasir.upm.edu.my/id/eprint/40437/1/7.%20Exact%20parallel%20plurality%20voting%20algorithm%20for%20totally%20ordered%20object%20space%20fault-tolerant%20systems.pdf |
| _version_ | 1848849425248550912 |
|---|---|
| author | Karimi, Abbas Zarafshan, Faraneh Jantan, Adznan Ramli, Abdul Rahman Saripan, M. Iqbal Syed Mohamed, Syed Abdul Rahman Al-Haddad |
| author_facet | Karimi, Abbas Zarafshan, Faraneh Jantan, Adznan Ramli, Abdul Rahman Saripan, M. Iqbal Syed Mohamed, Syed Abdul Rahman Al-Haddad |
| author_sort | Karimi, Abbas |
| building | UPM Institutional Repository |
| collection | Online Access |
| description | 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). |
| first_indexed | 2025-11-15T09:50:11Z |
| format | Article |
| id | upm-40437 |
| institution | Universiti Putra Malaysia |
| institution_category | Local University |
| language | English |
| last_indexed | 2025-11-15T09:50:11Z |
| publishDate | 2012 |
| publisher | Universiti Putra Malaysia Press |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | upm-404372018-10-26T02:31:38Z http://psasir.upm.edu.my/id/eprint/40437/ Exact parallel plurality voting algorithm for totally ordered object space fault-tolerant systems Karimi, Abbas Zarafshan, Faraneh Jantan, Adznan Ramli, Abdul Rahman Saripan, M. Iqbal Syed Mohamed, Syed Abdul Rahman Al-Haddad 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). Universiti Putra Malaysia Press 2012 Article PeerReviewed application/pdf en http://psasir.upm.edu.my/id/eprint/40437/1/7.%20Exact%20parallel%20plurality%20voting%20algorithm%20for%20totally%20ordered%20object%20space%20fault-tolerant%20systems.pdf 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 http://www.pertanika.upm.edu.my/Pertanika%20PAPERS/JST%20Vol.%2020%20%281%29%20Jan.%202012/13%20Pg%2089-96.pdf |
| spellingShingle | Karimi, Abbas Zarafshan, Faraneh Jantan, Adznan Ramli, Abdul Rahman Saripan, M. Iqbal Syed Mohamed, Syed Abdul Rahman Al-Haddad Exact parallel plurality voting algorithm for totally ordered object space fault-tolerant systems |
| title | Exact parallel plurality voting algorithm for totally ordered object space fault-tolerant systems |
| title_full | Exact parallel plurality voting algorithm for totally ordered object space fault-tolerant systems |
| title_fullStr | Exact parallel plurality voting algorithm for totally ordered object space fault-tolerant systems |
| title_full_unstemmed | Exact parallel plurality voting algorithm for totally ordered object space fault-tolerant systems |
| title_short | Exact parallel plurality voting algorithm for totally ordered object space fault-tolerant systems |
| title_sort | exact parallel plurality voting algorithm for totally ordered object space fault-tolerant systems |
| url | http://psasir.upm.edu.my/id/eprint/40437/ http://psasir.upm.edu.my/id/eprint/40437/ http://psasir.upm.edu.my/id/eprint/40437/1/7.%20Exact%20parallel%20plurality%20voting%20algorithm%20for%20totally%20ordered%20object%20space%20fault-tolerant%20systems.pdf |