Several distributed mutual exclusion algorithms define the order in which requests are
satisfied based on the priorities assigned to requests. These algorithms are very useful for …

Abstract In Flying Ad Hoc Networks (FANETs), the critical resource resides in an Unmanned
Aerial Vehicle (UAV) and the user nodes within the UAV's neighborhood defined by its …

In voting based approach a process getting the majority of votes will only be allowed to enter
into the critical section (CS). But, this method has a disadvantage as if no process remains in …

Concurrency and starvation control had always been a problem in distributed system. In the
voting-based technique, a process receiving the greater part of votes will only be permitted …

La utilización de los recursos compartidos se debe realizar en la modalidad de exclusión
mutua. Esta investigación propone un nuevo modelo de decisión con la funcionalidad de …

Many token-based, distributed mutual exclusion algorithms can be generalized by a single
algorithm. The algorithm's performance is dependent upon the logical topology imposed on …

Deadlock, starvation and concurrency have always been a problem in single, multiple,
distributed and cloud computing performance. Voting based approach is a process of getting …

In order to solve the concurrency and starvation control problems of distributed systems, the
voting-and priority-based optimal and feasible solution is presented in this research work. In …

In large distributed systems which are based on cloud computing, the resources are shared
to the clients. In these systems, there must be some service level agreement between the …

Service sharing is an important problem in distributed systems, where it affects wait time and
allows for the equal use of services by a group of nodes. Mutual exclusion provides an …