A Novel N-Input Voting Algorithm for X-by-Wire Fault-Tolerant Systems
Voting is an important operation in multichannel computation paradigm and realization of ultrareliable and real-time control systems that arbitrates among the results of N redundant variants. These systems include N-modular redundant (NMR) hardware systems and diversely designed software systems bas...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2014-01-01
|
| Series: | The Scientific World Journal |
| Online Access: | http://dx.doi.org/10.1155/2014/672832 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832563703740891136 |
|---|---|
| author | Abbas Karimi Faraneh Zarafshan S. A. R. Al-Haddad Abdul Rahman Ramli |
| author_facet | Abbas Karimi Faraneh Zarafshan S. A. R. Al-Haddad Abdul Rahman Ramli |
| author_sort | Abbas Karimi |
| collection | DOAJ |
| description | Voting is an important operation in multichannel computation paradigm and realization of ultrareliable and real-time control systems that arbitrates among the results of N redundant variants. These systems include N-modular redundant (NMR) hardware systems and diversely designed software systems based on N-version programming (NVP). Depending on the characteristics of the application and the type of selected voter, the voting algorithms can be implemented for either hardware or software systems. In this paper, a novel voting algorithm is introduced for real-time fault-tolerant control systems, appropriate for applications in which N is large. Then, its behavior has been software implemented in different scenarios of error-injection on the system inputs. The results of analyzed evaluations through plots and statistical computations have demonstrated that this novel algorithm does not have the limitations of some popular voting algorithms such as median and weighted; moreover, it is able to significantly increase the reliability and availability of the system in the best case to 2489.7% and 626.74%, respectively, and in the worst case to 3.84% and 1.55%, respectively. |
| format | Article |
| id | doaj-art-4a4785ef6c8c4e1681cdbc885ff3640e |
| institution | Kabale University |
| issn | 2356-6140 1537-744X |
| language | English |
| publishDate | 2014-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | The Scientific World Journal |
| spelling | doaj-art-4a4785ef6c8c4e1681cdbc885ff3640e2025-02-03T01:12:49ZengWileyThe Scientific World Journal2356-61401537-744X2014-01-01201410.1155/2014/672832672832A Novel N-Input Voting Algorithm for X-by-Wire Fault-Tolerant SystemsAbbas Karimi0Faraneh Zarafshan1S. A. R. Al-Haddad2Abdul Rahman Ramli3Department of Computer Engineering, Faculty of Engineering, Arak Branch, Islamic Azad University, Arak, Markazi, IranDepartment of Computer Engineering, Faculty of Engineering, Hamedan Branch, Islamic Azad University, Hamedan, IranDepartment of Computer and Communication Systems Engineering, Faculty of Engineering, UPM, 43400 Selangor, MalaysiaDepartment of Computer and Communication Systems Engineering, Faculty of Engineering, UPM, 43400 Selangor, MalaysiaVoting is an important operation in multichannel computation paradigm and realization of ultrareliable and real-time control systems that arbitrates among the results of N redundant variants. These systems include N-modular redundant (NMR) hardware systems and diversely designed software systems based on N-version programming (NVP). Depending on the characteristics of the application and the type of selected voter, the voting algorithms can be implemented for either hardware or software systems. In this paper, a novel voting algorithm is introduced for real-time fault-tolerant control systems, appropriate for applications in which N is large. Then, its behavior has been software implemented in different scenarios of error-injection on the system inputs. The results of analyzed evaluations through plots and statistical computations have demonstrated that this novel algorithm does not have the limitations of some popular voting algorithms such as median and weighted; moreover, it is able to significantly increase the reliability and availability of the system in the best case to 2489.7% and 626.74%, respectively, and in the worst case to 3.84% and 1.55%, respectively.http://dx.doi.org/10.1155/2014/672832 |
| spellingShingle | Abbas Karimi Faraneh Zarafshan S. A. R. Al-Haddad Abdul Rahman Ramli A Novel N-Input Voting Algorithm for X-by-Wire Fault-Tolerant Systems The Scientific World Journal |
| title | A Novel N-Input Voting Algorithm for X-by-Wire Fault-Tolerant Systems |
| title_full | A Novel N-Input Voting Algorithm for X-by-Wire Fault-Tolerant Systems |
| title_fullStr | A Novel N-Input Voting Algorithm for X-by-Wire Fault-Tolerant Systems |
| title_full_unstemmed | A Novel N-Input Voting Algorithm for X-by-Wire Fault-Tolerant Systems |
| title_short | A Novel N-Input Voting Algorithm for X-by-Wire Fault-Tolerant Systems |
| title_sort | novel n input voting algorithm for x by wire fault tolerant systems |
| url | http://dx.doi.org/10.1155/2014/672832 |
| work_keys_str_mv | AT abbaskarimi anovelninputvotingalgorithmforxbywirefaulttolerantsystems AT faranehzarafshan anovelninputvotingalgorithmforxbywirefaulttolerantsystems AT saralhaddad anovelninputvotingalgorithmforxbywirefaulttolerantsystems AT abdulrahmanramli anovelninputvotingalgorithmforxbywirefaulttolerantsystems AT abbaskarimi novelninputvotingalgorithmforxbywirefaulttolerantsystems AT faranehzarafshan novelninputvotingalgorithmforxbywirefaulttolerantsystems AT saralhaddad novelninputvotingalgorithmforxbywirefaulttolerantsystems AT abdulrahmanramli novelninputvotingalgorithmforxbywirefaulttolerantsystems |