ON THE PERFORMANCE OF SYNCHRONOUS MULTIPROCESSORS.

The author studies the performance of a multiprocessor in which a crossbar is used to interconnect p processors to m commonly shared memory modules. A set of nonuniformly distributed probabilities including a probability P(0), which denotes the probability of a processor not generating any request, is also used to illustrate the program behavior, but no distinction is made between processors. Several relations between the average request completion time, the average processor utilization, and the effective memory bandwidth are obtained. An approximation method based on the idea of aggregation is proposed, and its solutions are compared to the exact solution.