Oguike O.E., Ebem D.U., Agu M.N., 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; Ebem, D.U., 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; 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
Using a queuing approach to describe a shared memory parallel computer system, it can be considered as a parallel computer system with a shared single ready queue. This can depict a single queue parallel server queuing model. Some models that are based on probability density function have been used to model the performance of the queuing system. This paper uses recursive models to evaluate the performance of a single queue parallel server queuing model of compute intensive applications of a parallel computer system. The recursive models that this paper uses are efficient models because each recursive model makes one recursive call.