Presenting a new Algorithm for Management Mutual Exclusion in Distributed Systems by Connecting MESH

Main Article Content

Hossein Nick khah
Farokh Koroupi, Arash Azizi mazrae

Abstract

Algorithm performance in distributed systems directly from the balance between concurrency and mutual exclusion takes effect. The two categories are not mutually exclusive and antagonistic concurrency to reduced efficiency and lack of mutual exclusivity loss of accuracy function ends. So they both exist in the system is essential. Normally communication in distributed systems based on message processing, there is no shared memory. Thus number of messages posted an important criterion for measuring the effectiveness of the proposed algorithms for distributed mutual exclusion is about. In this paper, an algorithm for token-based distributed mutual exclusion problem is presented. This algorithm is a package that permits the processing moves each node receives a packet can take advantage of critical region. The algorithm solves the deadlock and starvation by a mesh topology. In this algorithm, traffic is minimal and the system does not interfere in the job log. Proposed algorithm has capability management different critical regions at the same time. For each critical region of that can be closed in a separate license and permit all packets in the node to the node for the critical region, permits for the package to be another critical region. So act quickly of distributed system is rises.

 

Keywords: Critical region, depth first traversal, distributed systems, mutual exclusion, mesh topology.

Downloads

Download data is not yet available.

Article Details

Section
Articles