NTBCBT:A Distributed Mutual Exclusion Algorithm
Richa Richa, Shikha Shikha, Pooja
Abstract
Open-access reader
Richa Richa, Shikha Shikha, Pooja
Abstract
Open-access reader
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 we 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.
OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
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 we 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.
Key concepts: Mutual exclusion, Computer science, Algorithm, Distributed computing