A. Shoshani and E. G. Co man. Sequencing tasks in multiprocess systems to avoid deadlocks. In Conference Record of 1970 Eleventh Annual Symposium on Switching and Automata Theory, pages 225-235, Santa Monica, California, Oct 1970. IEEE. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Some Geometric Perspectives In Concurrency Theory - Goubault (2003) (1 citation) (Correct)
....and has appeared in operating systems theory, in particular for describing the problem of deadly embrace in multiprogramming systems . Progress graphs are introduced in [9] but attributed there to E. W. Dijkstra. In fact they also appeared slightly earlier (for editorial reasons it seems) in [55]. The basic idea is to give a description of what can happen when several processes are modifying shared ressources. Given a shared resource a, we see it as its associated semaphore that rules its behaviour with respect to processes. For instance, if a is an ordinary shared variable, it is ....
Shoshani, A. and E. G. Coffman, Sequencing tasks in multiprocess systems to avoid deadlocks, in: Conference Record of
Deadlock Avoidance Policies for Automated Manufacturing Cells - Reveliotis, Ferreira (1996) (3 citations) (Correct)
....previously described maximal process requests. The consideration of the maximal process requests, combined with the reusable nature of the system resources, makes the number of available units of every resource type increase monotonically between the service of these maximal requests. According to [22], this monotonicity makes backtracking unnecessary in the search for a safe allocation sequence and gives Banker s Algorithm a complexity of O(rn log n) where r is the number of resource types and n is the 5 number of processes. 13] shows how the Banker s Algorithm can be generalized in order ....
....Section 2. Under this model, the AMC is susceptible to deadlocks where the finite operational space of the workstations and of the MHS are the resource(s) shared among the concurrently executed processes. Actually, the abstracted RAS model is a particular case of the Job Step Model, proposed in [22] for the study of the problem of deadlock avoidance in multiprocess systems of sequential processes. In the past, the manufacturing community has tended to ignore the deadlock problem since the presence of human operators allowed for an easy solution, namely the preemption of a number of ....
A. Shoshani and E. G. Coffman. Sequencing tasks in multiprocess systems to avoid deadlocks. In Proceedings of the 11th Annual Symposium on Switching and Automata Theory, pages 225--233, 1970.
Deadlock Avoidance Policies for Automated Manufacturing Cells - Reveliotis (1996) (3 citations) (Correct)
....previously described maximal process requests. The consideration of the maximal process requests, combined with the reusable nature of the system resources, makes the number of available units of every resource type increase monotonically between the service of these maximal requests. According to [22], this monotonicity makes backtracking unnecessary in the search for a safe allocation sequence and gives Banker s Algorithm a complexity of O(rn log n) where r is the number of resource types and n is the number of processes. 13] shows how the Banker s Algorithm can be generalized in order to ....
....Section 2. Under this model, the AMC is susceptible to deadlocks where the finite operational space of the workstations and of the MHS are the resource(s) shared among the concurrently executed processes. Actually, the abstracted RAS model is a particular case of the Job Step Model, proposed in [22] for the study of the problem of deadlock avoidance in multiprocess systems of sequential processes. In the past, the manufacturing community has tended to ignore the deadlock problem since the presence of human operators allowed for an easy solution, namely the preemption of a number of ....
A. Shoshani and E. G. Coffman. Sequencing tasks in multiprocess systems to avoid deadlocks. In Proceedings of the 11th Annual Symposium on Switching and Automata Theory, pages 225--233, 1970.
Dihomotopy as a Tool in State Space Analysis - Goubault, Raussen (2002) (Correct)
No context found.
A. Shoshani and E. G. Co man. Sequencing tasks in multiprocess systems to avoid deadlocks. In Conference Record of 1970 Eleventh Annual Symposium on Switching and Automata Theory, pages 225-235, Santa Monica, California, Oct 1970. IEEE.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC