Task based Cholesky decomposition on Xeon Phi architectures using OpenMP. (2018)

• Record Type: Journal Article
• Authors: Dorris, Joseph; YarKhan, Asim; Kurzak, Jakub; Luszczek, Piotr; Dongarra, Jack
• Is Part Of: International journal of computational science and engineering. Volume 17:Number 3(2018)
• Page Start: 310
• Page End: 323
• Publication Date: 2018
• Subjects: task-based programming -- tile algorithms -- Xeon Phi knights landing -- KNL -- Cholesky decomposition -- linear algebra -- OpenMP; Computer science -- Mathematics -- Periodicals; Computer simulation -- Mathematical aspects -- Periodicals; Computational intelligence -- Periodicals; 004.015105
• Languages: English
• ISSNs: 1742-7185

Abstract

The increasing number of computational cores in modern many-core processors, as represented by the Intel Xeon Phi architectures, has created the need for an open-source, high performance and scalable task-based dense linear algebra package that can efficiently use this type of many-core hardware. In this paper, we examined the design modifications necessary when porting PLASMA, a task-based dense linear algebra library, run effectively on two generations of Intel's Xeon Phi architecture, known as knights corner (KNC) and knights landing (KNL). First, we modified PLASMA's tiled Cholesky decomposition to use OpenMP tasks for its scheduling mechanism to enable Xeon Phi compatibility. We then compared the performance of our modified code to that of the original dynamic scheduler running on an Intel Xeon Sandy Bridge CPU. Finally, we looked at the performance of the OpenMP tiled Cholesky decomposition on knights corner and knights landing processors. We detail the optimisations required to obtain performance on these platforms and compare with the highly tuned Intel MKL math library.