Prevention of system deadlocks

Habermann, A. N.

doi:10.1145/363156.363160

Cited by 291 publications

(79 citation statements)

References 2 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This check is made possible by having processes that enter the system announce their maximum resource usage, an approach first proposed by Dijkstra in his Banker's algorithm [5,9,10]. When resources are distributed across multiple sites, however, deadlock avoidance is harder, because different sites may have to consult each other to determine whether a particular allocation is safe.…”

Section: Intra-resource Deadlocksmentioning

confidence: 99%

Distributed Priority Inheritance for Real-Time and Embedded Systems

Sánchez

Sipma

Gill

et al. 2006

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. We study the problem of priority inversion in distributed real-time and embedded systems and propose a solution based on a distributed version of the priority inheritance protocol (PIP). Previous approaches to priority inversions in distributed systems use variations of the priority ceiling protocol (PCP), originally designed for centralized systems as a modification of PIP that also prevents deadlock. PCP, however, requires maintaining a global view of the acquired resources, which in distributed systems leads to high communication overhead. This paper presents a distributed PIP built on top of a deadlock avoidance schema that requires much less communication than PCP. Since the system is already deadlock free and priority inversions can be detected locally, we obtain an efficient dynamic resource allocation system that prevents deadlocks and handles priority inversions.

show abstract

Section: Intra-resource Deadlocksmentioning

confidence: 99%

Distributed Priority Inheritance for Real-Time and Embedded Systems

Sánchez

Sipma

Gill

et al. 2006

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…The control is based on an adaptation of the Banker's algorithm [20,33]. In order to consider a given state as safe, the Banker's algorithm looks for an ordering in the set of active processes such that the first process can terminate using the resources granted to it plus the free ones, the second process can terminate using the resources it holds plus the ones free upon the hypothetical termination of the first process, and so on.…”

Section: Modelling and Deadlock Avoidance For A Two Cells Manufacturimentioning

confidence: 99%

Petri Nets and Manufacturing Systems: An Examples-Driven Tour

Recalde

Silva

Ezpeleta

et al. 2004

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. There exists ample literature on Petri nets and its potential in the modelling, analysis, synthesis and implementation of systems in the manufacturing applications domain (see for example [54,15,18]; besides, in [66] an important bibliography is presented). This paper provides an examples-driven perspective. Nevertheless, not only complete examples from the application domain are considered. Manufacturing systems are frequently large systems, and conceptual complexity often appears because of some particular "local" constructions. The examples considered in this selected tour try to introduce in a progressive way some applied concepts and techniques. The starting point is an assembly cell, for which models concerning several phases of the design life-cycle are presented. Afterwards, some pull control and kanban management strategies are modelled. Then, two coloured models of production lines are presented. After that, a manufacturing system with two cells is modelled, and the difficulty of the practical analysis is shown. For very populated manufacturing systems or systems with high cadence, relaxation of discrete event models leads to hybrid and continuous approximations, an example of which will be shortly introduced. Motivation and objectivesPetri Nets (PNs) constitute a well known paradigm for the design and operation of many systems allowing a discrete event view [53]. The purpose of this work is to present, in a tutorial style, some examples in which manufacturing systems are modelled and analysed. Several books about PNs and the design and operation of manufacturing systems have been published at the end of the last century [17,15,65,56,44,66]. In the sequel, the reader is assumed to be introduced to the main concepts in Petri Nets [50,42].Basically a case study driven perspective is provided in this work. Nevertheless, not only full examples from the application domain are considered. Manufacturing systems are frequently large systems, and conceptual complexity appears because of some particular constructions that appear in part of the system.

show abstract

“…If information about current and future resource allocation is available, then that knowledge can be used to avoid circular waits (see, for example, the Banker's algorithm [Dij68,Hab69]). …”

Section: Deadlocksmentioning

confidence: 99%

Concurrent Object-Oriented Programming: The MP-Eiffel Approach.

Silva¹

2004

JOT

View full text Add to dashboard Cite

This article evaluates several possible approaches for integrating concurrency into object-oriented programming languages, presenting afterwards, a new language named MP-Eiffel. MP-Eiffel was designed attempting to include all the essential properties of both concurrent and object-oriented programming with simplicity and safety. A special care was taken to achieve the orthogonality of all the language mechanisms, allowing their joint use without unsafe side-effects (such as inheritance anomalies).

show abstract

Prevention of system deadlocks

Cited by 291 publications

References 2 publications

Distributed Priority Inheritance for Real-Time and Embedded Systems

Distributed Priority Inheritance for Real-Time and Embedded Systems

Petri Nets and Manufacturing Systems: An Examples-Driven Tour

Concurrent Object-Oriented Programming: The MP-Eiffel Approach.

Contact Info

Product

Resources

About