Toggle Main Menu Toggle Search

Open Access padlockePrints

Statistical Fairness of Ordered Arbiters

Lookup NU author(s): Agnes Madalinski, Dr Alex Bystrov, Professor Alex Yakovlev



A new parameter of quantity fairness, or statistical fairness, describing behaviour of asynchronous arbiters is introduced. It takes into account timing parameters of the arbiter and its environment described as stochastic processes. In this context a traditional quality of fairness can be understood as a condition of having the probability of request serving equal to one under a uniform delay distribution in the range between 0 and infinity. Thus the new parameter can be treated as a generalisation of the common approach. The quantity fairness of an ordered arbiter, which stores requests in a FIFO in the order of their arrival, has been studied using stochastic Petri net technique. The experimental has been conducted using GreatSPN tool, which results show a significant fairness improvement of an ordered arbiter in comparison with the corresponding arbiter without a FIFO. The method of quantity fairness measurement in the GreatSPN environment has been developed.

Publication metadata

Author(s): Madalinski A, Bystrov A, Yakovlev A

Publication type: Report

Publication status: Published

Series Title: Department of Computing Science Technical Report Series

Year: 2000

Pages: 135

Print publication date: 01/04/2000

Source Publication Date: April 2000

Report Number: 703

Institution: Department of Computing Science, University of Newcastle upon Tyne

Place Published: Newcastle upon Tyne