Weak and strong fairness in CCS
Information and Computation
Strategies for the Prevention of Communication Deadlocks in Distributed Parallel Programs
IEEE Transactions on Software Engineering
An Efficient Deadlock Avoidance Technique
IEEE Transactions on Computers
ACM Computing Surveys (CSUR)
Combining Methods for the Livelock Analysis of a Fault-Tolerant System
AMAST '98 Proceedings of the 7th International Conference on Algebraic Methodology and Software Technology
Distributed Deadlock Detection in Mobile Agent Systems
IEA/AIE '02 Proceedings of the 15th international conference on Industrial and engineering applications of artificial intelligence and expert systems: developments in applied artificial intelligence
On the Absence of Livelocks in Parallel Programs
Proceedings of the International Sympoisum on Semantics of Concurrent Computation
Type Systems for Concurrent Processes: From Deadlock-Freedom to Livelock-Freedom, Time-Boundedness
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
On the Semantics of Fair Parallelism
Proceedings of the Abstract Software Specifications, 1979 Copenhagen Winter School
DEADLOCK DETECTION IN COMPUTER NETWORKS
DEADLOCK DETECTION IN COMPUTER NETWORKS
Distributed Computing
Efficient distributed deadlock avoidance with liveness guarantees
EMSOFT '06 Proceedings of the 6th ACM & IEEE International conference on Embedded software
A Specification and Construction Paradigm for Organic Computing Systems
SASO '08 Proceedings of the 2008 Second IEEE International Conference on Self-Adaptive and Self-Organizing Systems
Fairness and conspiracy concepts in concurrent systems
ACM SIGSOFT Software Engineering Notes
A Universal Self-Organization Mechanism for Role-Based Organic Computing Systems
ATC '09 Proceedings of the 6th International Conference on Autonomic and Trusted Computing
A generic software framework for role-based Organic Computing systems
SEAMS '09 Proceedings of the 2009 ICSE Workshop on Software Engineering for Adaptive and Self-Managing Systems
The concept of deadlock and livelock in hybrid control systems
HSCC'07 Proceedings of the 10th international conference on Hybrid systems: computation and control
Self-organization properties of CSMA/CA systems and their consequences on fairness
IEEE Transactions on Information Theory
IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
Deadlock control methods in automated manufacturing systems
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Fault-tolerant deadlock avoidance algorithm for assembly processes
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Siphon-Based Deadlock Prevention Policy for Flexible Manufacturing Systems
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Resource-Oriented Petri Net for Deadlock Avoidance in Flexible Assembly Systems
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Information and Software Technology
| Hi-index | 0.00 |
Systems in which individual units concurrently process indivisible resources are inherently prone to starvation and deadlocks. This paper describes a fair scheduling mechanism for self-organizing resource-flow systems that prevents starvation as well as a distributed deadlock avoidance algorithm. The algorithm leverages implicit local knowledge about the system's structure and uses a simple coordination mechanism to detect loops in the resource-flow. The knowledge about the loops that have been detected is then incorporated into the scheduling mechanism. Limitations of the approach are presented along with extension to the basic mechanism to deal with them.