A class of arbiters, known as batching arbiters, is introduced and defined. A particularly simple decentralised example of a batching arbiter is described, with motivation given for the batching arbiter model adopted. It is shown that under reasonable assumptions, batching arbiters can be described by a finite state Markov chain. The key steps in the analysis of the arbiter performance are the method of assigning states, evaluation of state transition probabilities and showing that the Markov chain is irreducible. Arbiter performance parameters are defined, such as proportion of time allocated to each requester and mean waiting time for each requester.
|Number of pages||9|
|Journal||Performance Evaluation Review|
|Publication status||Published - 1 Jan 1986|
|Event||Perform '86 and ACM SIGMETRICS 1986, Jt Conf on Comput Perform Modell, Meas and Eval - Raleigh, NC, USA|
Duration: 28 May 1986 → 30 May 1986