PUMA
Istituto per le Tecnologie Didattiche     
Di Manzo M., Frisiani A. L., Olimpo G. Deadlock avoidance in graph-structured task systems. In: Information Systems Methodology : 2nd Conference of the European Cooperation in Informatics. (Venice, Italy, 10-12 October 1978). Atti, pp. 548 - 559. G. Bracchi, P. C. Lockemann (eds.). (Lecture Notes in Computer Science, vol. 65). Springer-Verlag, 1978.
 
 
Abstract
(English)
Existing models for deadlock detection and avoidance give practical solution only in the case of chains of independent tasks. In this paper we propose a non enumerative approach to deadlock avoidance when the workload consists of a graph-structured task system. The avoidance algorithm is based on an extention of the Coffman and Denning deadlock model.
Subject Education


Icona documento 1) Download Document PDF


Icona documento Open access Icona documento Restricted Icona documento Private

 


Per ulteriori informazioni, contattare: Librarian http://puma.isti.cnr.it

Valid HTML 4.0 Transitional