NTBCBT:A Distributed Mutual Exclusion Algorithm
In the recent years there is a considerable interest in developing mutual exclusion algorithms. Various algorithms are available to achieve mutual exclusion. Bandwidth, synchronization delay and throughput are the performance factors for these algorithms. Here, the authors present an algorithm NTBCBT (Non Token Based using Complete Binary Tree) that using the concept of complete Binary Tree and provide better bandwidth as compare to other algorithms. In distributed systems several computer communicate with each other by interchanging the messages over the communication network without sharing any memory or clock. In these systems one of the basic & interesting problems of mutual exclusion exists.