| R.C. Holt, On deadlock in computer systems, PhD Thesis. Cornell Univ. Ithaca, N.Y. (Jan. 1971) |
....To be actually detectable, a property must be expressed in terms of the program variables and the processor state that comprise the local states of the different processes. For example, the property a subset of the processes are deadlocked will be expressed in terms of waits for graphs [Hol71]. However, one can represent process i waits for process j when i has sent a message requesting a resource and j has not sent a message granting that request. One can also represent this when j has received the request message but not yet responded. If all messages that are sent are eventually ....
Richard C. Holt. On deadlock in computer systems. PhD thesis, Cornell University, January 1971.
....system is a stable property. To be actually detectable, a property must be expressed in terms of the program variables that comprise the local states of the different processes. For example, the property a subset of the processes are deadlocked can be expressed in terms of waits for graphs [Hol71]. Such a graph 1 In an asynchronous system, there is no bound on the number of messages that can be on a channel, and so any representation of a channel s state could require unbounded space. In any real system, however, the number of messages on a channel is bounded, primarily because the ....
Richard C. Holt. On deadlock in computer systems. PhD thesis, Cornell University, January 1971.
No context found.
R.C. Holt, On deadlock in computer systems, PhD Thesis. Cornell Univ. Ithaca, N.Y. (Jan. 1971)
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