Filters








104,676 Hits in 5.6 sec

NTBCBT:A Distributed Mutual Exclusion Algorithm

Richa, Shikha, Pooja
2011 International Journal of Peer to Peer Networks  
In the recent years there is a considerable interest in developing mutual exclusion algorithms. Various algorithms are available to achieve mutual exclusion.  ...  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.  ...  RELATED RESEARCH During the last decade, a huge amount of effort has been focused on the development of the efficient distributed mutual exclusion algorithms.  ... 
doi:10.5121/ijp2p.2011.2302 fatcat:pkobt3ltijhvnjk3oh2nicdx6u

A survey of permission-based distributed mutual exclusion algorithms

P.C. Saxena, J. Rai
2003 Computer Standards & Interfaces  
The problem of mutual exclusion in distributed systems has attracted considerable attention over the last two decades.  ...  A number of solutions have been provided to the mutual exclusion problem in distributed systems.  ...  Acknowledgements The authors are thankful to the reviewers for their valuable comments. It would not have been possible for us to put the paper in its present form without their useful suggestions.  ... 
doi:10.1016/s0920-5489(02)00105-8 fatcat:na3u3ho6tzayle5qd7vlnchpmu

On distributed dynamic channel allocation in mobile cellular networks

Jianping Jiang, Ten-Hwang Lai, N. Soundarajan
2002 IEEE Transactions on Parallel and Distributed Systems  
We develop a general algorithm that guarantees relaxed mutual exclusion for a single resource and prove necessary and sufficient conditions for the information structure.  ...  Considering distributed dynamic channel allocation as a special case of relaxed mutual exclusion, we apply and extend the algorithm to further address the issues that arise in distributed channel allocation  ...  ACKNOWLEDGMENTS The authors would like to thank the anonymous referees for the careful reading of the original manuscript and for providing us detailed comments and suggestions for improvements.  ... 
doi:10.1109/tpds.2002.1041879 fatcat:j6mdag5uwnesfg3fzy3bczoy3i

Agent-based module for simulating mutual exclusion algorithms

SENOUA César, KAMLA Vivient Corneille, YENKE Blaise Omer, KAMGANG Jean-Claude
2020 Zenodo  
Analysis of the results of the simulation shows the properties of the mutual exclusion algorithms are satisfactory.  ...  Mutual exclusion is one of the fundamental paradigms of distributed systems to ensure consistent access to resources shared between several entities in the system.  ...  We have also implemented and simulated two classical and group distributed mutual exclusion algorithms to verify the properties of these mutual exclusion algorithms.  ... 
doi:10.5281/zenodo.4431051 fatcat:zjrqe6n6inhvxdamsiyfb6h27i

A Novel Approach to Allow Process into Critical Section with no delay-time

Pradosh Chandra Pattnaik, Shafakhatullah Khan, Vsv. Mallikharjuna Rao
2011 Zenodo  
Till date so many approaches and algorithms are proposed to reduce the delay time between the successive executions of the critical section, but no one proposed how to assign the data structure to all  ...  The proposed algorithm every time creates an instance of the data structure before assigning to the requested process and simultaneously it checks for the instance released by the process already assigned  ...  The authors wish to sincerely thank the anonymous reviewers for their insightful comments and valuable suggestions.  ... 
doi:10.5281/zenodo.5948896 fatcat:ooqcofqp5betnghv5wmf4a7ali

Page 1039 of Mathematical Reviews Vol. , Issue 94b [page]

1994 Mathematical Reviews  
Sanders, The information structure of distributed mutual exclusion algorithms (40-55); Kerry Raymond, A tree- based algorithm for distributed mutual exclusion (56-72); Mukesh Singhal, A heuristically-aided  ...  the columns of the butterfly in Bene’ theorem.” 94b:68030 68M10 68-06 * Distributed mutual exclusion algorithms.  ... 

Evaluation of Token Based Mutual Exclusion Algorithms In Distributed Systems

Ami Patel
2012 IOSR Journal of Computer Engineering  
This paper presents a framework for token based mutual exclusion algorithms in distributed systems. Their exists some traditional token based mutual exclusion algorithm.  ...  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  ...  Framework For Token Based Mutual Exclusion Algorithms By reason of the mutual exclusion importance in distributed system for keeping system consistency and increasing concurrently, various algorithms are  ... 
doi:10.9790/0661-0753034 fatcat:7ixbladuqrd4xjgfd6xtthdele

Event-Based Proof of the Mutual Exclusion Property of Peterson's Algorithm

Ievgen Ivanov, Mykola Nikitchenko, Uri Abraham
2015 Formalized Mathematics  
After this we formulate and prove the main theorem about the mutual exclusion property of the Peterson's algorithm in an arbitrary consistent algebraic structure of events.  ...  We demonstrated the proposed approach on a proof of the mutual exclusion property of the Peterson's algorithm [11].  ...  After this we formulate and prove the main theorem about the mutual exclusion property of the Peterson's algorithm in an arbitrary consistent algebraic structure of events.  ... 
doi:10.1515/forma-2015-0026 fatcat:v4ickko5crdmhkvvzvecrmchpa

A Fast Token-Chasing Mutual Exclusion Algorithm in Arbitrary Network Topologies

Yong Yan, Xiaodong Zhang, Haixu Yang
1996 Journal of Parallel and Distributed Computing  
In all existing distributed mutual exclusion algorithms, designs are aimed at minimizing the number of messages per invocation of the CR.  ...  mutual exclusion algorithm has the following two wellknown features: 1. the algorithms are implemented using available local state information and a message passing mechanism, instead of simply using shared  ...  DESIGN OF THE TOKEN-CHASING BASED MUTUAL EXCLUSION ALGORITHM Basic Ideas Recent developments in the design of distributed mutual exclusion algorithms focus on using dynamic state information to minimize  ... 
doi:10.1006/jpdc.1996.0078 fatcat:tqqltlniw5evrbi6nlsxgv32se

Dynamic Request Set based Mutual Exclusion Algorithm in MANETs

Ashish Khanna, Awadhesh Kumar Singh, Abhishek Swaroop
2015 International Journal of Wireless and Microwave Technologies  
The algorithm satisfies mutual exclusion, starvation freedom, and freedom from deadlock. The present algorithm has been compared with DRS based ME algorithms for static distributed systems.  ...  Mutual Exclusion (ME) problem involves a group of processes, each of which intermittently requires access to the only resource present in the environment.  ...  The mutual exclusion [1] problem is one of the most fundamental problems in distributed system.  ... 
doi:10.5815/ijwmt.2015.04.01 fatcat:pgx7kab4nvapjh7knym3yfoxfm

Fair K Mutual Exclusion Algorithm for Peer to Peer Systems

Vijay Anand Reddy, Prateek Mittal, Indranil Gupta
2008 2008 The 28th International Conference on Distributed Computing Systems  
We propose a new solution to the k-mutual exclusion problem that provides a notion of time-based fairness.  ...  In order to be practically useful, k-mutual exclusion algorithms not only need to be safe and live, but they also need to be fair across hosts.  ...  The above scenario directly maps to our k mutual exclusion algorithm.  ... 
doi:10.1109/icdcs.2008.76 dblp:conf/icdcs/ReddyMG08 fatcat:yckjxzvt2rgxrewxvaeaypfu3y

An efficient and fault-tolerant solution for distributed mutual exclusion

Divyakant Agrawal, Amr El Abbadi
1991 ACM Transactions on Computer Systems  
In this paper, we present an efficient and fault-tolerant algorithm for generating quorums to solve the distributed mutual exclusion problem.  ...  The algorithm uses a logical tree organization of the network to generate tree quorums, which are logarithmic in the size of the network in the best case.  ...  Maekawa [12] proposes implementing distributed mutual exclusion by imposing a logical structure on the network.  ... 
doi:10.1145/103727.103728 fatcat:6wltzvqarreaneu46lida7cshu

PBCBT: An Improvement of NTBCBT Algorithm

Kamla Vivient Corneille, Souleymanou, Damakoa Irepran
2014 International Journal of Peer to Peer Networks  
The classic mutual exclusion problem in distributed systems occurs when only one process should access a shared resource. Various algorithms are proposed in order to solve this problem.  ...  This algorithm called 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.  ...  Several algorithms have been proposed in order to solve the problem of mutual exclusion.  ... 
doi:10.5121/ijp2p.2014.5101 fatcat:rsjpy27l7zhjlcfow4xo4ckx34

An Energy Efficient Algorithm For Distributed Mutual Exclusion In Mobile Ad-Hoc Networks

Sayani Sil, Sukanta Das
2010 Zenodo  
This paper reports a distributed mutual exclusion algorithm for mobile Ad-hoc networks. The network is clustered hierarchically.  ...  The proposed algorithm considers the clustered network as a logical tree and develops a token passing scheme to get the mutual exclusion.  ...  The tree like structure of Fig. 1 is shown in Fig. 2 . IV. THE ALGORITHM This section reports the distributed mutual exclusion algorithm in detail.  ... 
doi:10.5281/zenodo.1058558 fatcat:efrovoigtjdejjx5mlragebg4i

Token Based Group Local Mutual Exclusion Algorithm in MANETs [chapter]

Ashish Khanna, Awadhesh Kumar Singh, Abhishek Swaroop
2014 Advances in Intelligent Systems and Computing  
The k-local mutual exclusion is a generalization of local mutual exclusion problem introduced by Attiya et al..  ...  To the best of our knowledge, it is the first algorithm to solve k-local mutual exclusion problem in MANETs. The solution to token loss problem is also included in the present exposition.  ...  The algorithms for variants of classical mutual exclusion problem such as k-mutual exclusion [12, 13] , group mutual exclusion [14] and h-out of k-mutual exclusion [15] for MANETs have also been proposed  ... 
doi:10.1007/978-81-322-2009-1_13 fatcat:lakgrpyovvgdplgw43kbhxztiu
« Previous Showing results 1 — 15 out of 104,676 results