Computing Publications

Publications Home » Transmission Times in Buffered Fu...

Transmission Times in Buffered Full-Crossbar Communication Networks with Cyclic Arbitration

A. J. Field, Peter G. Harrison

Conference or Workshop Paper
ICPP'93, IEEE/ACM International Conference on Parallel Processing. 16-20 August 1993, Syracuse University, NY
August, 1993
Volume 1
IEEE Computer Society
DOI 10.1109/ICPP.1993.182

In this paper we consider the distribution of message transmission times in buffered full cross bar interconnection networks with cyclic arbitration in which the input buffers are serviced in a 'round robin' fashion. The system is modelled as an open queue ing network in which the queues appear at the net work outputs and with the cyclic arbiter being mod elled by queue jumping. We obtain the Laplace Trans form of the transmission time by deriving a condi tional Laplace Transform and solving by the use of a generating function. The density function is then enumerated by numerical inversion and compared with similar results from a simulation model. The analysis is then extended to general service times by modelling each output as a LCFS queue with a suitably modified arrival rate. In the special case of exponential service times, this model is less versatile than the previous one since it only works in the case where the jump probability is fixed. In this case, however, it is shown to produce the same result as the original.

BibTEX file for the publication built & maintained by Ashok Argent-Katwala.