Petri net modeling and analysis of centralized timeout and batching arbitration units

The authors consider two novel arbitration techniques, timeout and batching arbitration, and establish the validity of their operations by using generalized and deterministic Petri net models. After a brief review of Petri net theory and the fundamentals of generalized and deterministic models, Petri net models for the timeout and batching arbitration schemes are presented, followed by a discussion of the simulation results of both of these schemes. It is found that both arbitration schemes provide a degree of fairness in that they reduce the resource allocation time but with the lack of complete resource utilization. A hybrid scheme which combines the key features of batching and timeout schemes is then presented and proven to operate correctly. Simulation of this scheme suggests that, by varying the arbiter parameters in conjunction with the priority of the processors, efficient allocation of system resources can be achieved.<>