SOLVING THE GENERAL LINEAR-MODEL ON A SIMD ARRAY PROCESSOR

Two parallel algorithms are proposed for the solution of the General Linear Model on a SIMD array processor. The first algorithm employs efficiently compound Givens rotations while the second algorithm uses Householder transformations. The implementation of the two algorithms on the 1024 processor AMT DAP-510 is described and their performance analysed using high accurate execution time models. No single algorithm is superior in all the ranges examined and the best choice depends on the problem size and the number of processing elements available.