The drinking philosophers problem
ACM Transactions on Programming Languages and Systems (TOPLAS) - Lecture notes in computer science Vol. 174
IEEE Transactions on Software Engineering
Memory requirements for silent stabilization
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Asynchronous group mutual exclusion (extended abstract)
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
Information Processing Letters
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
A new solution of Dijkstra's concurrent programming problem
Communications of the ACM
Self-stabilizing systems in spite of distributed control
Communications of the ACM
Concurrent control with “readers” and “writers”
Communications of the ACM
Solution of a problem in concurrent programming control
Communications of the ACM
IEEE Transactions on Computers
Stabilization-preserving atomicity refinement
Journal of Parallel and Distributed Computing - Self-stabilizing distributed systems
A Timestamp Based Transformation of Self-Stabilizing Programs for Distributed Computing Environments
WDAG '96 Proceedings of the 10th International Workshop on Distributed Algorithms
Self-Stabilizing Local Mutual Exclusion and Daemon Refinement
DISC '00 Proceedings of the 14th International Conference on Distributed Computing
Euro-Par '99 Proceedings of the 5th International Euro-Par Conference on Parallel Processing
ICDCS '99 Workshop on Self-stabilizing Systems
Parallel composition of stabilizing algorithms
ICDCS '99 Workshop on Self-stabilizing Systems
Cross-Over Composition - Enforcement of Fairness under Unfair Adversary
WSS '01 Proceedings of the 5th International Workshop on Self-Stabilizing Systems
Self-Stabilizing Local Mutual Exclusion on Networks in which Process Identifiers are not Distinct
SRDS '02 Proceedings of the 21st IEEE Symposium on Reliable Distributed Systems
A General Resource Allocation Synchronization Problem
ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
Self-stabilization of dynamic systems assuming only read/write atomicity
Distributed Computing - Special issue: Self-stabilization
Self-stabilizing philosophers with generic conflicts
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Alternators in read/write atomicity
Information Processing Letters
Journal of Parallel and Distributed Computing
Toward a time-optimal odd phase clock unison in trees
SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
Self-stabilizing philosophers with generic conflicts
SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
A new analysis of a self-stabilizing maximum weight matching algorithm with approximation ratio 2
Theoretical Computer Science
| Hi-index | 0.00 |
We propose a new resource sharing problem, called Local Resource Allocation (LRA) which deals with resource sharing problem among neighboring processes. LRA allows neighboring processes to access resources (i.e., their critical sections) concurrently provided the resources are not conflicting with each other. We first present a self-stabilizing solution to the LRA problem. We then use the proposed solution to design a self-stabilizing transformer to transform algorithms written using strong assumptions (e.g., central daemon or composite atomicity) to those using weaker assumptions (distributed read/write atomicity model). To our knowledge, this is the first self-stabilizing transformer which allows neighborhood concurrency. Moreover, the proposed solution preserves the silent property of the original algorithms.