An Efficient Approach of Election Algorithm in Distributed Systems
Journal Title: Indian Journal of Computer Science and Engineering - Year 2011, Vol 2, Issue 1
Abstract
In this paper, I have proposed an election algorithm that can be used in distributed systems to elect a coordinator. This is a betterment of an already existing Election algorithm (also known as Bully Algorithm) proposed by Hector Garcia-Monila (1982).The proposed algorithm is an efficient approach than Bully Algorithm.
Authors and Affiliations
SANDIPAN BASU
Computer Profiling Based Model for Investigation
Computer profiling is used for computer forensic analysis, and proposes and elaborates on a novel model for use in computer profiling, the computer profiling object model. The computer profiling object model is an inform...
AN EXHAUSTIVE FRAMEWORK FOR BETTER DATA CENTERS’ ENERGY EFFICIENCY AND GREENNESS BY USING METRICS
As data centers become more popular today and power cost and energy consumption exponentially raised, considering energy efficiency in data centers seems imperative. To achieve more energy efficiency and greener data cen...
APPLICABILITY OF CLOUD COMPUTING IN ACADEMIA
The Indian Education sector has seen a tremendous rise in the field of higher education which has led to the demand for the automation of education sector at all the levels in order to cater to the need of information of...
STUDY OF QoS ISSUES FOR ROUTING PROTOCOLS in IEEE 802.11s
This paper focuses on the two routing protocols proposed by IEEE 802.11s for Wireless Mesh Networks. Towards this goal, this paper contributes in several areas of Routing and Quality-of-Service provisioning in IEEE 802.1...
PERFORMANCE EVALUATION OF PARALLEL APPLICATIONS USING MESSAGE PASSING INTERFACE IN NETWORK OF WORKSTATIONS OF DIFFERENT COMPUTING POWERS
A network created from so called commodity hardware can effectively and affordably be used for high performance computing. Major attraction from such networks is cost-effectiveness due to efficient utilization of existin...