An analytic model for parallel Gaussian elimination on a binary N-Cube architecture

This paper summarizes an analytical technique which predicts the time required to execute a given parallel program, with given data, on a given parallel architecture. For illustration purposes, the particular parallel program chosen is parallel Gaussian elimination and the particular parallel architecture chosen is a binary n-cube. The analytical technique is based upon a product-form queuing network model which is solved using an iterative method. The technique is validated by comparing performance predictions produced by the model against actual hypercube measurements.