IDEAS home Printed from https://ideas.repec.org/a/gvu/jscp00/v4y2022i3id1536.html

Implementation of Voter by using Artificial Bee Colony Algorithm for Fault Tolerant System

Author

Listed:
  • Ponnaganti Rama Devi
  • Anusha Jetti

Abstract

In a fault tolerant system, voting algorithm plays a major role in decision making. Inexact majority voting, majority voting, and weighted voters are most popular voting algorithms. In each of these techniques, redundant modules produce unpredictable outputs, and finding an agreement among these outputs is the functionality of voter. In this proposed system, voter is implemented using soft computing technique called ABC algorithm. The basic ABC algorithm is a very modest, adaptable and clear model. There are two categories of searchers in the hive of ABC; namely, unemployed searchers and employed searchers. Based on the intelligent performance of honey bee swarm, ABC is one of the optimization algorithms. The behaviours of bees are used to optimize weights of Triple Modular Redundant system, where each module plays an imperative role in the selection of voter. For evaluating the performance of voting algorithms, some performance measures have been defined; they are, safety and availability measures. ABC algorithm has been proposed to improve the safety and availability of the existing system.

Suggested Citation

Handle: RePEc:gvu:jscp00:v:4:y:2022:i:3:id:1536
DOI: 10.36548/jscp.2022.3.003
as

Download full text from publisher

File URL: https://irojournals.com/jscp/article/view/1536
File Function: Abstract page
Download Restriction: no

File URL: https://irojournals.com/jscp/article/download/1536/1381
File Function: Full text
Download Restriction: no

File URL: https://libkey.io/10.36548/jscp.2022.3.003?utm_source=ideas
LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
---><---

More about this item

Keywords

;
;
;

Statistics

Access and download statistics

Corrections

All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gvu:jscp00:v:4:y:2022:i:3:id:1536. See general information about how to correct material in RePEc.

If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

We have no bibliographic references for this item. You can help adding them by using this form .

If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Journal Manager (email available below). General contact details of provider: https://irojournals.com/jscp .

Please note that corrections may take a couple of weeks to filter through the various RePEc services.

IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.