International Journal of Managment, IT and Engineering
  • Year: 2013
  • Volume: 3
  • Issue: 10

Algorithm and execution of election administration approach in simple case (SC) to elect coordinator for distributed system

  • Author:
  • S.K Gandhi, Pawan Kumar Thakur
  • Total Page Count: 10
  • Page Number: 362 to 371

*Research Guide, Department of Computer Science & Engineering, AISECT University, Bhopal (M.P), India

**Ph. D Research Scholar, Department of Computer Science & Engineering, AISECT University, Bhopal (M.P), India

Online published on 11 November, 2013.

Abstract

In fault-tolerant distributed systems the coordinator node has to perform some specific controlling tasks and this node is well known to the other nodes. When a crash failure of the coordinator node, it is urgently needed to reorganize the existing active nodes to call for an election and to elect a coordinator in order to continue the operation of the entire system. Election Administration is a collection of special processes in distributed system. It is an election administrative body. This body is authorized to handle the whole election process. In a distributed computing system, it defines the system and regulations for attending in an election process. The purposes of this paper are to presents algorithm and procedure to elect coordinator in simple case of election administration approach for distributed system.

Keywords

Failure Detector, transmission delay, processing delay, Helper, verify message, alive message, Coordinator message, Process table