A. B. CREMERS AND T. N. HIBBARD, "Arbitration and Queueing Under Limited Shared Storage Requirements," University of Dortmund Technical Report, 1979. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Unknown - Warning Concerning Copyright (Correct)
....queue) and if it remains on all its queues until it is first on all of them. In fact, if all granted resources are eventually returned, it is clear that each user eventually obtains all of its resources. A High Level Language The high level language used is (almost) the same as that used in [3,5]. Computation occurring within a lock unlock pair occurs within a single execution step in the formal model. In the formal model, every step involves access to a variable. The local computation appearing in our language is combined into the previous lock unlock pair in the formal model. In [5] ....
A. B. CREMERS AND T. N. HIBBARD, "Arbitration and Queueing Under Limited Shared Storage Requirements," University of Dortmund Technical Report, 1979.
Distributed FIFO Allocation of Identical Resources.. - Fischer, Lynch.. (1989) (25 citations) (Correct)
....1.3.2 Bank Algorithm. Rather than devise new algorithms for the k critical section problem with stronger fairness conditions, an obvious approach is to try to reduce the k critical section problem to the 1 critical section problem and then apply known solutions to the latter problem, e.g. [2 5], and [11] Such a hybrid solution is commonly used in banks for scheduling people waiting for a teller. People entering the bank line up in a single queue. When one or more tellers become available, the person at the head of the queue goes to any free teller. To see the reduction that is ....
CREMERS, A. B., AND HIBBARD, T.N. Arbitration and queueing under limited shared storage requirements. Tech. Rep. 83, Dept. of Informatics, University of Dortmund, Mar. 1979.
Fast Allocation Of Nearby Resources In A Distributed System - Lynch (1980) (18 citations) (Correct)
....comparable. Any coloring c of P specifies such a partial ordering. We use an arbitrary coloring c and the strategy described above in our solution. The complete code for user and resource processes appears at the bottom of the page. The high level language used is (almost) the same as that used in [CH,FLBB]. Computation occurring within a lock unlock pair occurs within a single execution step in the formal model. In the formal model, every step involves access to a variable. The local computation appearing in our language is combined into the previous lock unlock pair in the formal model. In ....
Cremers, A.B. and Nibbard, T.N., "Arbitration and Queueing Under Limited Shared Storage Requirements", University of Dortmund Technical Report, 1979.
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