A new approach for the performance analysis of a single-bus multiprocessor system with general service times

The linear algebraic approach to queuing theory is applied to analyze the performance of a typical single-bus multiprocessor system. This system can be modeled as an M/G/1/N queuing system with load-dependent arrivals. The method presented requires only that the nonexponential service time distribution for the system be a matrix-exponential, that is, one with a rational Laplace transform. Using linear algebraic techniques, expressions are obtained for the performance characteristics of interest, such as the processing power for the multiprocessor system. The algorithm does not rely on root finding and can be implemented using symbolic programming techniques. The explicit closed-form expression for the processing power is presented for some special cases