Abstract
The classic mutual exclusion problem in distributed systems occurs when only one process shouldaccess a shared resource. Various algorithms are proposed in order to solve this problem. When using a permission based approach which consist in exchanging permission messages togrant access to the critical resource, less messages should be sent over the network because bandwi dth consumption and synchronization delay should be reduced. Richa, shikha and Pooja proposedan algorithm using nodes logically organized in a complete binary tree. This algorithmcalled NTBCBT requires 4log2(N) messages per access to critical section and a synchronization delay of 3log2(N) for a set of N nodes competing for the critical ressource.In this paper, we study NTBCBT and we show that this algorithm has proble ms related with safety, liveness and scheduling. We improve this algorithm by correcting these weaknesses. Moreover, our algorithm requires 3log(N) messages per access to critical section and a s
Highlights
The growing demand of material resources in computing forced computer manufacturers to combine many processors into a single or a distributed system
We compare in the table below bandwidth of permission based mutual exclusion algorithms for N nodes competing for the critical resource
We compare in the table below the Synchronization delay of permission based mutual exclusion algorithms for N nodes competing for the critical resource
Summary
The growing demand of material resources in computing forced computer manufacturers to combine many processors into a single or a distributed system This technique known as parallel computing is used to provide simultaneous data processing for the purpose of increasing the computational speed of a computer system. The simultaneous access to the shared resource may result into an incoherent value for this resource: This problem is known as the problem of mutual exclusion. Non token-based mutual exclusion algorithms exchange messages to determine which process can access the CS next. On july 2011, Richa, Shikha and Pooja proposed a non-token based algorithm named NTBCBT (Non Token Based using Complete Binary Tree) which grants access to the critical resource with 4log (N) messages with a synchronization delay of 3log (N). We round up with a conclusion summarizing results and further works we intend to continue
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
