On Deadlocks and Fairness in Self-organizing Resource-Flow Systems

Steghöfer, Jan-Philipp; Mandrekar, Pratik; Nafz, Florian; Seebach, Hella; Reif, Wolfgang

doi:10.1007/978-3-642-11950-7_9

Cited by 4 publications

(3 citation statements)

References 31 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…each cycle, the maximum permissible number of products is calculated and then enforced at runtime. This approach extends previous work done in [8]. It supports multiple types of products and is based solely on local knowledge.…”

Section: Introductionmentioning

confidence: 66%

See 1 more Smart Citation

Deadlock Avoidance for Multiple Tasks in a Self-Organizing Production Cell

Hirsch

Neumayer

Ponsar

et al. 2020

2020 IEEE International Conference on Autonomic Computing and Self-Organizing Systems (ACSOS)

Self Cite

View full text Add to dashboard Cite

Deadlocks represent situations in which two participants are waiting for each other to finish an activity so that neither of them will ever finish. Deadlocks can occur in complex computer-integrated systems, such as flexible and selforganizing production systems. As deadlocks bring production to halt, methods for deadlock control in production systems are widely studied. Yet most algorithms proposed are not suited for the use in decentral multi-agent systems, as they require central control or can not handle concurrency. Other algorithms can be used in a decentral fashion but assume that only one type of product will be manufactured at a time. But in times of mass customization, where customers choose a product from a variety of options, support for several product types is required. To meet both the requirements of mass customization and decentral multi-agent systems, we present a new decentralized approach for avoiding deadlocks in a self-organizing production cell, where several types of products are being manufactured in parallel. Our approach is based solely on local knowledge and does not assume central control. We evaluate our approach in terms of effectiveness and message overhead to conclude that it avoids starvation and deadlocks with a reasonable message overhead.

show abstract

Section: Introductionmentioning

confidence: 66%

“…In [8], the authors discuss deadlock avoidance for systems modeled with the Organic Design Pattern (ODP). An algorithm for distributed systems without central control or knowledge is introduced.…”

Section: B Deadlock Control In Production Systemsmentioning

confidence: 99%

Deadlock Avoidance for Multiple Tasks in a Self-Organizing Production Cell

Hirsch

Neumayer

Ponsar

et al. 2020

2020 IEEE International Conference on Autonomic Computing and Self-Organizing Systems (ACSOS)

Self Cite

View full text Add to dashboard Cite

show abstract

“…The presented approach determines the least restrictive controller which guarantees deadlock avoidance, whenever such a controller exists. Steghofer et al [19] described a distributed deadlock avoidance algorithm for self-organizing resource flow systems. The algorithm leverages implicit http://jwcn.eurasipjournals.com/content/2014/1/214 local knowledge about the system structure and uses a simple coordination mechanism to detect loops in the resource flow.…”

Section: Deadlock Solving Methodsmentioning

confidence: 99%

CGA-based deadlock solving strategies towards vehicle sensing systems

Zheng

Lyu

2014

J Wireless Com Network

View full text Add to dashboard Cite

Vehicle sensing system is an important research topic in the research field of Internet-of-Vehicles (IoV). Reliability and real-time performance of vehicle sensing systems are greatly influenced when deadlock happens. When a deadlock is detected, identifying the optimal deadlock solving strategy can ensure that the system goes back to normal state quickly. In order to address this issue, this paper proposes an efficient deadlock solving method. Firstly, the deadlock problem in a vehicle sensing system is analyzed based on four deadlock occurring conditions (i.e., mutual exclusion, hold and wait, no preemption, and circular wait). Secondly, an optimization model is built to combine the quantity and cost of tasks in vehicle sensing systems. After that, a co-evolutionary genetic algorithm (CGA) is developed to search the optimal deadlock solving strategy. Finally, experiments by simulation are conducted and the experimental results show the efficiency of the proposed deadlock solving method for vehicle sensing systems.

show abstract