A tree-based algorithm for distributed mutual exclusion
ACM Transactions on Computer Systems (TOCS)
Two algorithms for mutual exclusion in real-time distributed computer systems
Journal of Parallel and Distributed Computing
A distributed mutual exclusion algorithm
ACM Transactions on Computer Systems (TOCS)
A N algorithm for mutual exclusion in decentralized systems
ACM Transactions on Computer Systems (TOCS)
A comparison of fast and low overhead distributed priority locks
Journal of Parallel and Distributed Computing
An optimal algorithm for mutual exclusion in computer networks
Communications of the ACM
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Synchronization in Real-Time Systems: A Priority Inheritance Approach
Synchronization in Real-Time Systems: A Priority Inheritance Approach
Priority Inheritance Protocols: An Approach to Real-Time Synchronization
IEEE Transactions on Computers
Distributed Mutual Exclusion Token-Permission Based by Prioritized Groups
AICCSA '01 Proceedings of the ACS/IEEE International Conference on Computer Systems and Applications
Prioritized Token-Based Mutual Exclusion for Distributed Systems
IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
Concurrency and Computation: Practice & Experience
Toward a cloud computing research agenda
ACM SIGACT News
| Hi-index | 0.00 |
In Cloud Computing, Service Level Agreement (SLA) is a contract that defines a level and a type of QoS between a cloud provider and a client. Since applications in a Cloud share resources, we propose two tree-based distributed mutual exclusion algorithms that support the SLA concept. The first one is a modified version of the priority-based Kanrar-Chaki algorithm while the second one is a novel algorithm, based on Raymond algorithm, where a deadline is associated with every request. In both cases, our aim is to improve Critical Section execution rate and to reduce the number of SLA violations, which, for the first algorithm represents the number of priority inversions (i.e. a higher priority request is satisfied after a lower one) and for the second one, the number of requests whose deadline is not respected. Performance evaluation results show that our solutions significantly reduce SLA violations avoiding message overhead.