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

Authors:
V. A. F. Almeida;L. W. Dowdy;M. R. Leuze
Affiliations:
Computer Science Department, Vanderbilt University, Nashville, TN;Computer Science Department, Vanderbilt University, Nashville, TN;Computer Science Department, Vanderbilt University, Nashville, TN
Venue:
C3P Proceedings of the third conference on Hypercube concurrent computers and applications - Volume 2
Year:
1989

Citing 3
Cited 2

The cosmic cube

Communications of the ACM - Special section on computer architecture
Performance analysis of a scheme for concurrency/synchronization using queueing network models

International Journal of Parallel Programming
Open, Closed, and Mixed Networks of Queues with Different Classes of Customers

Journal of the ACM (JACM)

What have we learnt from using real parallel machines to solve real problems?

C3P Proceedings of the third conference on Hypercube concurrent computers and applications - Volume 2
n-cube model for cluster computing and its evaluation

APPT'07 Proceedings of the 7th international conference on Advanced parallel processing technologies

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.