Numerical methods for shared memory parallel computing
Degree GrantorUniversity of Canterbury
Degree NameBachelor of Science with Honours
This report discusses shared memory parallel algorithms. It explains the benefits and difficulties of parallelizing algorithms by means of some examples. The main examples are parallel algorithms for calculating a Cholesky decomposition, performing forward and back substitution and adaptively building binary triangle trees.
SubjectsField of Research::08 - Information and Computing Sciences::0802 - Computation Theory and Mathematics::080201 - Analysis of Algorithms and Complexity
- Engineering: Reports