PRIMITIVE PARALLEL OPERATIONS FOR COMPUTATIONAL LINEAR ALGEBRA (PROCESSING, MATHEMATICAL SOFTWARE)
Abstract
This work is a small step on the direction of code portability over parallel and vector machines. The proposal consists of a style of programming and a set of parallel operators built over abstract data types. Objects and operators are directed to the Computational Linear Algebra area, although the principles of the proposal can be applied to any other area. A subset of the operators was implemented on a 64 processor, distributed memory MIMD machine, and the results are that computationally intensive operators achieve asymptotically optimal speed-ups, but data movement operators are inefficient, some even intrinsically sequential.
Degree
Ph.D.
Subject Area
Computer science
Off-Campus Purdue Users:
To access this dissertation, please log in to our
proxy server.