Parallelising the Mean Value Analysis algorithm

The Mean Value Analysis (MVA) algorithm is one of the most popular for evaluating the performance of separable (or product form) queueing networks. Although its complexity is modest when jobs are indistinguishable, the introduction of different customer classes rapidly increases its computational cost. The problems of parallelising the algorithm while retaining its conceptual simplicity are examined. In particular, a parallel implementation of MVA on a distributed memory machine is developed using the MPI library for communication.