Matrices over runtime systems at exascale

Handle URI:
http://hdl.handle.net/10754/575809
Title:
Matrices over runtime systems at exascale
Authors:
Agullo, Emmanuel; Bosilca, George; Bramas, Bérenger; Castagnede, Cedric; Coulaud, Olivier; Darve, Eric F.; Dongarra, Jack; Faverge, Mathieu; Furmento, Nathalie; Giraud, Luc; Lacoste, Xavier; Langou, Julien; Ltaief, Hatem ( 0000-0002-6897-1095 ) ; Messner, Matthias; Namyst, Raymond; Ramet, Pierre; Takahashi, Toru; Thibault, Samuel; Tomov, Stanimire Z.; Yamazaki, Ichitaro
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. © 2012 IEEE.
KAUST Department:
KAUST Supercomputing Laboratory (KSL); Extreme Computing Research Center
Publisher:
Institute of Electrical and Electronics Engineers (IEEE)
Journal:
2012 SC Companion: High Performance Computing, Networking Storage and Analysis
Conference/Event name:
2012 SC Companion: High Performance Computing, Networking Storage and Analysis, SCC 2012
Issue Date:
Nov-2012
DOI:
10.1109/SC.Companion.2012.167
Type:
Conference Paper
ISBN:
9780769549569
Appears in Collections:
Conference Papers; KAUST Supercomputing Laboratory (KSL); Extreme Computing Research Center; Extreme Computing Research Center

Full metadata record

DC FieldValue Language
dc.contributor.authorAgullo, Emmanuelen
dc.contributor.authorBosilca, Georgeen
dc.contributor.authorBramas, Bérengeren
dc.contributor.authorCastagnede, Cedricen
dc.contributor.authorCoulaud, Olivieren
dc.contributor.authorDarve, Eric F.en
dc.contributor.authorDongarra, Jacken
dc.contributor.authorFaverge, Mathieuen
dc.contributor.authorFurmento, Nathalieen
dc.contributor.authorGiraud, Lucen
dc.contributor.authorLacoste, Xavieren
dc.contributor.authorLangou, Julienen
dc.contributor.authorLtaief, Hatemen
dc.contributor.authorMessner, Matthiasen
dc.contributor.authorNamyst, Raymonden
dc.contributor.authorRamet, Pierreen
dc.contributor.authorTakahashi, Toruen
dc.contributor.authorThibault, Samuelen
dc.contributor.authorTomov, Stanimire Z.en
dc.contributor.authorYamazaki, Ichitaroen
dc.date.accessioned2015-08-24T09:26:48Zen
dc.date.available2015-08-24T09:26:48Zen
dc.date.issued2012-11en
dc.identifier.isbn9780769549569en
dc.identifier.doi10.1109/SC.Companion.2012.167en
dc.identifier.urihttp://hdl.handle.net/10754/575809en
dc.description.abstractThe 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. © 2012 IEEE.en
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE)en
dc.titleMatrices over runtime systems at exascaleen
dc.typeConference Paperen
dc.contributor.departmentKAUST Supercomputing Laboratory (KSL)en
dc.contributor.departmentExtreme Computing Research Centeren
dc.identifier.journal2012 SC Companion: High Performance Computing, Networking Storage and Analysisen
dc.conference.date10 November 2012 through 16 November 2012en
dc.conference.name2012 SC Companion: High Performance Computing, Networking Storage and Analysis, SCC 2012en
dc.conference.locationSalt Lake City, UTen
dc.contributor.institutionINRIA, Hiepacs Project, 350 cours de la Liberation, 33400 Talence, Franceen
dc.contributor.institutionInnovative Computing Laboratory, University of Tennessee Knoxville, United Statesen
dc.contributor.institutionStanford University, United Statesen
dc.contributor.institutionDepartment of Mathematical and Statistical Sciences, University of Colorado Denver, United Statesen
dc.contributor.institutionNagoya University, Japanen
kaust.authorLtaief, Hatemen
All Items in KAUST are protected by copyright, with all rights reserved, unless otherwise indicated.