Dynamic deadlock detection under the OR requirement model

 

Autores
Campos, Alvaro E.; Orellana, Christian Fabián; Soto, María Pía
Tipo de recurso
artículo
Estado
Versión publicada
Año de publicación
2003
País
Argentina
Institución
Universidad Nacional de La Plata
Repositorio
SEDICI (UNLP)
Descripción
Deadlock detection is one of the most discussed problems in the literature. Although several al- gorithms have been proposed, the problem is still open. In general, the correct operation of an algorithm depends on the requirement model being considered. This article introduces a deadlock detection algorithm for the OR model. The algorithm is complete, because it detects all deadlocks, and it is correct, because it does not detect false deadlocks. In addition, the algorithm supports dynamic changes in the wait-for graph on which it works. Once finalized the algorithm, at least each process that causes deadlock knows that it is deadlocked. Using this property, possible extensions are suggested in order to resolve deadlocks.
Idioma
inglés
OAI Identifier
oai:sedici.unlp.edu.ar:10915/9466
Enlace del recurso
http://sedici.unlp.edu.ar/handle/10915/9466
http://hdl.handle.net/10915/9466
http://journal.info.unlp.edu.ar/wp-content/uploads/JCST-Oct03-7.pdf
Nivel de acceso
Acceso abierto
Materia
Ciencias Informáticas
Distributed Systems
Deadlocks