2012•IOSR Journal of Computer EngineeringOpen access

Evaluation of Token Based Mutual Exclusion Algorithms In Distributed Systems

Ami Y. Patel

Open full text 0 citations

Abstract

This paper presents a framework for token based mutual exclusion algorithms in distributed systems.Their exists some traditional token based mutual exclusion algorithm.Some new algorithms are proposed in order to increase fault tolerance, minimize message complexity and decrease synchronization delay.In this paper, some new approaches are used, like Token ring algorithm with centralized approach, which is a betterment of the already existing token ring algorithm and overcome all the problems in the existing algorithm.A new token passing approach , which incurs 3 messages at high load, irrespective of no of node N and N message at low loads.Fairness algorithm for priority process, which has low message complexity and fairness in token algorithm.Several Token approach which allow simultaneous existence of several tokens.Hope the proposed framework provides a suitable context for technical and clear evaluation of existing and future methods.

Open-access reader

About this research paper

What this paper is about

This paper presents a framework for token based mutual exclusion algorithms in distributed systems.Their exists some traditional token based mutual exclusion algorithm.Some new algorithms are proposed in order to increase fault tolerance, minimize message complexity and decrease synchronization delay.In this paper, some new approaches are used, like Token ring algorithm with centralized approach, which is a betterment of the already existing token ring algorithm and overcome all the problems in the existing algorithm.A new token passing approach , which incurs 3 messages at high load, irrespective of no of node N and N message at low loads.Fairness algorithm for priority process, which has low message complexity and fairness in token algorithm.Several Token approach which allow simultaneous existence of several tokens.Hope the proposed framework provides a suitable context for technical and clear evaluation of existing and future methods.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

This paper presents a framework for token based mutual exclusion algorithms in distributed systems.Their exists some traditional token based mutual exclusion algorithm.Some new algorithms are proposed in order to increase fault tolerance, minimize message complexity and decrease synchronization delay.In this paper, some new approaches are used, like Token ring algorithm with centralized approach, which is a betterment of the already existing token ring algorithm and overcome all the problems in the existing algorithm.A new token passing approach , which incurs 3 messages at high load, irrespective of no of node N and N message at low loads.Fairness algorithm for priority process, which has low message complexity and fairness in token algorithm.Several Token approach which allow simultaneous existence of several tokens.Hope the proposed framework provides a suitable context for technical and clear evaluation of existing and future methods.

Key concepts: Computer science, Mutual exclusion, Security token, Suzuki-Kasami algorithm, Distributed computing, Algorithm, Computer security

Related papers

Back to paper searchBrowse research topicsOriginal source
Evaluation of Token Based Mutual Exclusion Algorithms In Distributed Systems — Research Paper | ScholarLens