Abstract
In this paper, we consider the problem of developing efficient and optimal parallel algorithms for Cholesky decomposition. We design our algorithms based on different data layouts and methods. We thereotically analyze the run-time of each algorithm. In order to determine the optimality of the algorithms designed, we derive theoretical lower bounds on running time based on initial data layout and compare them against the algorithmic run-times. To address portability, we design our algorithms and perform complexity analysis on the LogP model. Lastly, we implement our algorithms and analyze performance data.
Article PDF
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.Avoid common mistakes on your manuscript.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Santos, E.E., Chu, PY. Efficient and Optimal Parallel Algorithms for Cholesky Decomposition. Journal of Mathematical Modelling and Algorithms 2, 217–234 (2003). https://doi.org/10.1023/B:JMMA.0000015832.41014.ed
Issue Date:
DOI: https://doi.org/10.1023/B:JMMA.0000015832.41014.ed