Asynchronous Task-Based Polar Decomposition on Single Node Manycore Architectures

Dalal Sukkari (1) , Hatem Ltaief (1) , Mathieu Faverge (1, 2, 3) , David Keyes (1)

1 KAUST - King Abdullah University of Science and Technology [Saudi Arabia]
2 Bordeaux INP - Institut Polytechnique de Bordeaux
3 HiePACS - High-End Parallel Algorithms for Challenging Numerical Simulations

This paper introduces the first asynchronous, task-based formulation of the polar decomposition and its corresponding implementation on manycore architectures. Based on a new formulation of the iterative QR dynamically-weighted Halley algorithm (QDWH) for the calculation of the polar decomposition, the proposed implementation replaces the original and hostile LU factorization for the condition number estimator by the more adequate QR factorization to enable software portability across various architectures. Relying on fine-grained computations, the novel task-based implementation is also capable of taking advantage of the identity structure of the matrix involved during the QDWH iterations, which decreases the overall algorithmic complexity. Furthermore, the artifactual synchronization points have been weakened compared to previous implementations, unveiling look-ahead opportunities for better hardware occupancy. The overall QDWH-based polar decomposition can then be represented as a directed acyclic graph (DAG), where nodes represent computational tasks and edges define the inter-task data dependencies. The StarPU dynamic runtime system is employed to traverse the DAG, to track the various data dependencies and to asynchronously schedule the computational tasks on the underlying hardware resources, resulting in an out-of-order task scheduling. Benchmarking experiments show significant improvements against existing state-of-the-art high performance implementations (i.e., Intel MKL and Elemental) for the polar decomposition on latest shared-memory vendors' systems (i.e., Intel Haswell/Broadwell/Knights Landing, NVIDIA K80/P100 GPUs and IBM Power8), while maintaining high numerical accuracy.

Mots clés: Polar decomposition; Asynchronous execution; Dynamic runtime system; Fine-grained execution; Directed acyclic graph; High performance computing

Domaines: Calcul parallèle, distribué et partagé [cs.DC]

Dalal Sukkari, Hatem Ltaief, Mathieu Faverge, David Keyes. Asynchronous Task-Based Polar Decomposition on Single Node Manycore Architectures. IEEE Transactions on Parallel and Distributed Systems, 2017, XX, ⟨10.1109/TPDS.2017.2755655⟩. ⟨hal-01585079⟩