Brian J. d'Auriol, Ph.D.



Rajesh Molakaseema, A Parameterized Linear Array With A Reconfigurable Pipelined Bus Systems: LARPBS(p), Department of Computer Science, The University of Texas at El Paso, December 2002. Advisor: Brian J. d'Auriol
In an attempt to move the LARPBS model from theory to practice, in this thesis, a new parameterized parallel computation model, the LARPBS(p) is proposed. The LARPBS(p) model captures computational costs through a set of abstract parameters. The proposed parameters, and subsequently, the cost analysis on the LARPBS(p) model and the cost analysis of some of the primitive operations on LARPBS(p) are presented. The utility of the LARPBS(p) model is demonstrated through the cost analysis of two matrix multiplication algorithms, a naive matrix multiplication algorithm and Cannon's matrix multiplication algorithm. This model is intended to serve as a basis for a more accurate estimation of execution time of algorithms. We hope the parameterization should be able to provide a feelback for the design characteristics to build a practical LARPBS parallel computer in the near future. 