A Investigation of the Chapel Parallelisation of the Singular Value Decomposition

This paper discusses the parallelisation (using the programming language Chapel) of one of the most often used algorithms for the Singular V alue Decomposition of a matrix. The mathematical alterations and programming constructs used to achie ve that parallelisation are examined at length. Performance and validation tests showing the increased parallel performance that occurs when run on a multi-core computer architecture are documented. Chapel’ s serial performance is compared against that of Fortran that implements the original algorithm. Only parallelisation in a Symmetric Multi-Processor environment is explored.