Creating a Novel Consensus Algorithm for Distributed Computing use Cases
R. Kannadasan1, N. Prabakaran2, A. Krishnamoorthy3, K Naresh4, Saravana Balaji. B5, A.S. Anakath6
1R. Kannadasan, Department of Computer Science and Engineering, VIT University, Vellore (Tamil Nadu), India.
2N. Prabakaran, Department of Computer Science and Engineering, VIT University, Vellore (Tamil Nadu), India.
3A. Krishnamoorthy, Department of Computer Science and Engineering, VIT University, Vellore (Tamil Nadu), India.
4K Naresh, Department of Computer Science and Engineering, VIT University, Vellore (Tamil Nadu), India.
5Saravana Balaji. B, College of Engineering and Computer Science, Lebanese French University, Erbil-Kurdistan, Iraq.
6A.S. Anakath, Professor and Director, Department of M.C.A, E.G.S. Pillay Engineering College Autonomous, Nagapattinam (Tamil Nadu), India.
Manuscript received on 24 November 2019 | Revised Manuscript received on 05 December 2019 | Manuscript Published on 14 December 2019 | PP: 290-294 | Volume-9 Issue-1S November 2019 | Retrieval Number: A10591191S19/2019©BEIESP | DOI: 10.35940/ijitee.A1059.1191S19
Open Access | Editorial and Publishing Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open-access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: There are many consensus algorithms that exist in parallel computing that involve multiple computing units like virtual machines which make use of available resources and arrive at a single agreeable state for the combined system. This is done on the basis of voting which itself branches into several arrangements like voting, functions of central tendencies, weighted functions of central tendencies etc. Some applications that consensus algorithms try to cover are: deciding on transaction operations (read, write, commit); deciding on node leaders of a system; maintaining replicas in the state of a machine (also called a state machine) and creating consistency between them. Some common algorithms of this type are Proof of Work algorithm (PoW), the practical Byzantine fault tolerance algorithm (PBFT), the proof-of-stake algorithm (PoS) and the delegated proof-of-stake algorithm (DPoS), Paxos algorithm and the Raft consensus algorithm.
Keywords: Maintaining Replicas, Parallel Computers, State Machines, Virtual Machines.
Scope of the Article: Cloud Computing