Oguike O.E., Agu M.N., Ebem D.U., Echezona S.C., Longe H.O.D., Abass O.
Department of Computer Science, University of Nigeria, Nsukka, Enugu State, Nigeria; Department of Computer Sciences, University of Lagos, Lagos, Nigeria
Oguike, O.E., Department of Computer Science, University of Nigeria, Nsukka, Enugu State, Nigeria; Agu, M.N., Department of Computer Science, University of Nigeria, Nsukka, Enugu State, Nigeria; Ebem, D.U., Department of Computer Science, University of Nigeria, Nsukka, Enugu State, Nigeria; Echezona, S.C., Department of Computer Science, University of Nigeria, Nsukka, Enugu State, Nigeria; Longe, H.O.D., Department of Computer Sciences, University of Lagos, Lagos, Nigeria; Abass, O., Department of Computer Sciences, University of Lagos, Lagos, Nigeria
In a heterogeneous distributed memory parallel computer system, each of the processors has its own memory. Describing the system using queuing network, each of the processors has its own ready queue. Since the system has many I/O queues and I/O processors, therefore, the various processors with their various ready queues and the various I/O processors and their various I/O queues form the queuing network of such a system. Using a round robin scheduling algorithm for the processor queues, we aim at evaluating the performance of the system from the time a job arrives in the system to the time job departs from the system. This paper uses recursive models to evaluate and assess the accuracy of the performance of the whole queuing network of a heterogeneous distributed memory parallel computer system.
