Please use this identifier to cite or link to this item:
|Title:||Ordinary linear model estimation on a massively parallel simd computer||Authors:||Kontoghiorghes, Erricos John||Keywords:||Algorithms
|Issue Date:||1999||Publisher:||Wiley||Source:||Concurrency Practice and Experience, 1999, Volume 11, Issue 7, Pages 323-341||Abstract:||Efficient algorithms for estimating the coefficient parameters of the ordinary linear model on a massively parallel SIMD computer are presented. The numerical stability of the algorithms is ensured by using orthogonal transformations in the form of Householder reflections and Givens plane rotations to compute the complete orthogonal decomposition of the coefficient matrix. Algorithms for reconstructing the orthogonal matrices involved in the decompositions are also designed, implemented and analyzed. The implementation of all algorithms on the targeted SIMD array processor is considered in detail. Timing models for predicting the execution time of the implementations are derived using regression modelling methods. The timing models also provide an insight into how the algorithms interact with the parallel computer. The predetermined factors used in the regression fits are derived from the number of memory layers involved in the factorization process of the matrices. Experimental results show the high accuracy and predictive power of the timing models.||URI:||http://ktisis.cut.ac.cy/handle/10488/6784||ISSN:||10403108||DOI:||10.1002/(SICI)1096-9128(199906)11:7<323::AID-CPE425>3.0.CO;2-I||Rights:||© 1999 John Wiley & Sons, Ltd.|
|Appears in Collections:||Άρθρα/Articles|
Show full item record
checked on Mar 25, 2017
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.