System Deadlocks

Coffman, E. G.; Elphick, M. J.; Shoshani, Arie

doi:10.1145/356586.356588

Cited by 673 publications

(265 citation statements)

References 10 publications

Supporting

Mentioning

244

Contrasting

Unclassified

Order By: Relevance

“…To illustrate the usefulness of our theory, we will apply it in two cases. We will first use it to extend the well-known Coffman deadlock conditions [4]. We will further apply our theory to semaphores, one of the most used synchronization primitives.…”

Section: Introductionmentioning

confidence: 99%

Algebra of Synchronization with Application to Deadlock and Semaphores

Gomez

Schubert

2011

IJNC

View full text Add to dashboard Cite

show abstract

Section: Introductionmentioning

confidence: 99%

Algebra of Synchronization with Application to Deadlock and Semaphores

Gomez

Schubert

2011

IJNC

View full text Add to dashboard Cite

show abstract

“…The occurrence of deadlock in FMS is due to the presence of the following conditions (COFFMAN et al, 1971;KROGH, 1990;CHO, 1993;FANTI et al, 1997;SANTOS FILHO, 2000): (i) Mutual exclusion, (ii) Await (hold and wait), (iii) No preemption and (iv) Circular wait condition.…”

Section: Introductionmentioning

confidence: 99%

Automatic generation of control solution for resource allocation using Petri net model

Nakamoto

Filho²

2009

Prod.

View full text Add to dashboard Cite

Geração automática da solução de controle para alocação de recursos utilizando redes de Petri RESUMO O sistema fl exível de manufatura (FMS fl exible manufacturing system) executa múltiplos processos simultaneamente que utilizam um conjunto limitado de recursos. Estes processos podem fi car permanentemente bloqueados em função da seqüência de atividades, isto é, o compartilhamento de um conjunto fi nito de recursos pode levar o sistema a um estado de autotravamento. O FMS pode ser visto como pertencente a uma classe de sistema a eventos discretos, onde não é possível determinar quando um evento ocorre e com isto a seqüência de eventos fi ca indefi nida. Este tipo de sistema pode ser modelado através de rede de Petri e assim explora-se esta técnica para desenvolver uma solução para o problema de autotravamento considerando o indeterminismo do FMS. O objetivo é introduzir uma abordagem algorítmica para a implementação de uma ferramenta computacional baseada na especifi cação funcional do FMS e que automatize a geração de uma estratégia de controle para a utilização de recursos e de regras para evitar o autotravamento. PALAVRAS-CHAVESistema fl exível de produção, autotravamento de processos, rede de Petri, controle de sistemas de produção, alocação de recursos. ABSTRACT The fl exible manufacturing system (FMS) executes multiple processes simultaneously using a limited set of resources. These processes can be blocked permanently due to the sequence of the activities, i.e., the processes sharing a fi nite set of resources may eventually lead to a deadlock state. The FMS belongs to the class of discrete event systems where it is not possible to determine when an event will occur and the sequence of events becomes undefi ned. Such systems can be modeled using Petri net, and this work presents a method that solves the deadlock problem considering the indeterminism of FMSs. The goal of this work is to introduce an algorithmic approach, which allows the implementation of a computer program based on FMS functional specifi cation. The proposal is to automate the generation of the control strategy for resource utilization and the rules to avoid the deadlock situation. KEY WORDSFlexible manufacturing system, deadlock avoidance, Petri net, production system control, resource allocation. Automatic generation of control solution for resource allocation using Petri net modelFrancisco Yastami Nakamoto Centro Universitário Fundação Santo André Paulo Eigi Miyagi EPUSP Diolino José dos Santos Filho EPUSP 9 Nakamoto, F. Y.; Miyagi, P. E.; Filho, D. J. S. Automatic generation of control solution for resource allocation using Petri Net Model.

show abstract

“…Deadlocks are avoided because in the phase of the protocol in which the roles are not ultimately decided yet, both sides may abort. This removes the circular wait condition necessary to enter a deadlock state [34]. The fact that, based on the replicas' IDs, both sides know who is the legitimate active replica, enables them to prevent lifelocks:…”

Section: Deadlocks Lifelocks and Fairnessmentioning

confidence: 99%

Self-Organizing Infrastructures for Ambient Services

Herrmann

Kommunikation in Verteilten Systemen (KiVS)

View full text Add to dashboard Cite

In the last two decades, the advent of wireless networking technology and the achievements in the miniaturization of electronic devices have set new trends in distributed computing. This ultimately enables a new paradigm for embedding mobile users in intelligent environments that support them in their interactions with their local physical surrounding. This vision is called Ambient Intelligence (AmI). There are still many challenges ahead on the way towards the realization of AmI. One question that is central to the entire concept is: How can we render AmI systems self-organizing such that they can indeed disappear in our environment without creating a massive administrative problem?In this thesis, we propose a model for a dedicated AmI infrastructure that supports the user in his interaction with his physical environment and with external entities. This infrastructure is called Ad hoc Service Grid (ASG) and provides wireless services in a decentralized and self-organizing fashion. We identify three distinct problems associated with self-organized service provisioning in the ASG model and propose algorithms and protocols that solve them. The problem that is at the center of our work is the self-organized replication and distribution of arbitrary services in an ASG. A set of algorithms is presented that solves this problem in a completely distributed way. The two other problems we tackle are the discovery and lookup of dynamically distributed service replicas and the reconciliation among a dynamic group of replicas. Together, the mechanisms we propose lay the foundation for a general AmI software platform. We will derive the architecture of such a Serviceware from these mechanisms. Detailed experimental results are presented that show the validity of our concepts and identify ways for tailoring our algorithms and protocols to the requirements of specific applications. Furthermore, we propose a new general model and a classification methodology for self-organizing software systems. We employ this model to evaluate our own solutions.The focus of the research work presented in this thesis is on the global-scale interactions in an AmI system. We call this the macro-level of interactions to separate it from the focus of most current research projects. These projects concentrate more on adaptations at the micro-level, pertaining to the internal structures of specific applications and services. Our work complements these efforts by providing solutions for structuring AmI systems externally, for example by distributing a group of service replicas within an ASG network.

show abstract

System Deadlocks

Abstract: A problem of increasing importance in the design of large multiprogramming systems is the, so-called, deadlock or deadly-embrace problem. In this arliele we survey the work that has been done on the treatment of deadlocks from bolh the theoretical and practical points of view.

Cited by 673 publications

References 10 publications

Algebra of Synchronization with Application to Deadlock and Semaphores

Algebra of Synchronization with Application to Deadlock and Semaphores

Automatic generation of control solution for resource allocation using Petri net model

Self-Organizing Infrastructures for Ambient Services

Contact Info

Product

Resources

About