Sciweavers

Share
SC
2009
ACM

Dynamic task scheduling for linear algebra algorithms on distributed-memory multicore systems

9 years 9 months ago
Dynamic task scheduling for linear algebra algorithms on distributed-memory multicore systems
This paper presents a dynamic task scheduling approach to executing dense linear algebra algorithms on multicore systems (either shared-memory or distributed-memory). We use a task-based library to replace the existing linear algebra subroutines such as PBLAS to transparently provide the same interface and computational function as the ScaLAPACK library. Linear algebra programs are written with the task-based library and executed by a dynamic runtime system. We mainly focus our runtime system design on the metric of performance scalability. We propose a distributed algorithm to solve data dependences without process cooperation. We have implemented the runtime system and applied it to three linear algebra algorithms: Cholesky, LU, and QR factorizations. Our experiments on both sharedmemory machines (16, 32 cores) and distributed-memory machines (1024 cores) demonstrate that our runtime system is able to achieve good scalability. Furthermore, we provide analytical analysis to show why ...
Fengguang Song, Asim YarKhan, Jack Dongarra
Added 19 May 2010
Updated 19 May 2010
Type Conference
Year 2009
Where SC
Authors Fengguang Song, Asim YarKhan, Jack Dongarra
Comments (0)
books