Approximation von Leistungsgrößen symmetrischer Mehrprozessorsysteme

In the modelling of computer systems, especially multiprocessor systems, for performance evaluation are mostly formulae needed for the computation of the performance measures such as queue lengths or response times for M/M/m-, M/G/m- or G/G/m-queueing systems. For M/M/m-systems there exist exact formulae which are very complex compared to M/M/1-formulae. There exist only approximate formulae for M/G/m- and G/G/m-systems. In the first part of the work approximate formulae are derived for the mean queue lengths, waiting time distributions and steady state probabilities for M/M/m-systems. These obtained formulae are as well easy as the M/M/1-formulae and though amazingly very accurate. These solutions are partly extended to M/G/m- and G/G/m-queueing systems in the second part of the work. It is also shown that the known approximate formulae compared to these results are unessentially more accurate but essentially more complex.