Abstract
The goal of Matrices Over Runtime Systems at Exascale (MORSE) project is to design dense and sparse linear algebra methods that achieve the fastest possible time to an accurate solution on large-scale multicore systems with GPU accelerators, using all the processing power that future high end systems can make available. In this poster, we propose a framework for describing linear algebra algorithms at a high level of abstraction and delegating the actual execution to a runtime system in order to design software whose performance is portable accross architectures. We illustrate our methodology on three classes of problems: dense linear algebra, sparse direct methods and fast multipole methods. The resulting codes have been incorporated into Magma, Pastix and ScalFMM solvers, respectively.
Original language | English |
---|---|
Title of host publication | Proceedings - 2012 SC Companion |
Subtitle of host publication | High Performance Computing, Networking Storage and Analysis, SCC 2012 |
Pages | 1330-1332 |
Number of pages | 3 |
DOIs | |
State | Published - 2012 |
Externally published | Yes |
Event | 2012 SC Companion: High Performance Computing, Networking Storage and Analysis, SCC 2012 - Salt Lake City, UT, United States Duration: Nov 10 2012 → Nov 16 2012 |
Publication series
Name | Proceedings - 2012 SC Companion: High Performance Computing, Networking Storage and Analysis, SCC 2012 |
---|
Conference
Conference | 2012 SC Companion: High Performance Computing, Networking Storage and Analysis, SCC 2012 |
---|---|
Country/Territory | United States |
City | Salt Lake City, UT |
Period | 11/10/12 → 11/16/12 |