Zobrazeno 1 - 10
of 19
pro vyhledávání: '"Andrew Lenharth"'
Autor:
Maciej Woźniak, Muhamm Amber Hassaan, Andrew Lenharth, Maciej Paszyński, Keshav Pingali, Marcin Łoś
Publikováno v:
Computer Physics Communications. 217:99-116
In this paper we present a fast explicit solver for solution of non-stationary problems using L 2 projections with isogeometric finite element method. The solver has been implemented within GALOIS framework. It enables parallel multi-core simulations
Publikováno v:
Communications of the ACM. 59:78-87
Data-centric abstractions and execution strategies are needed to exploit parallelism in large-scale graph analytics.
Publikováno v:
ASPLOS
Approximate computing trades off accuracy of results for resources such as energy or computing time. There is a large and rapidly growing literature on approximate computing that has focused mostly on showing the benefits of approximate computing. Ho
Publikováno v:
ICCS
The paper presents an extension of the hypergraph grammar model of the hp-adaptive finite element method algorithm with rectangular elements to the case of non-stationary problems. In our approach the finite element mesh is represented by hypergraphs
Autor:
Loc Hoang, Marc Snir, Gurbinder Gill, Alex Brooks, Andrew Lenharth, Nikoli Dryden, Hoang-Vu Dang, Roshan Dathathri, Keshav Pingali
Publikováno v:
IPDPS
Distributed-memory multi-core clusters enable in-memory processing of very large graphs with billions of nodes and edges. Recent distributed graph analytics systems have been built on top of MPI. However, communication in graph applications is very i
Publikováno v:
Euro-Par 2018: Parallel Processing ISBN: 9783319969824
Euro-Par
Euro-Par
The trend towards processor heterogeneity and distributed-memory has significantly increased the complexity of parallel programming. In addition, the mix of applications that need to run on parallel platforms today is very diverse, and includes graph
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a5b85b3b339becdee597985c0275d1c6
https://doi.org/10.1007/978-3-319-96983-1_18
https://doi.org/10.1007/978-3-319-96983-1_18
Autor:
Damian Goik, Mikhail Moshkov, Konrad Jopek, Victor M. Calo, Donald Nguyen, Keshav Pingali, Hassan AbouEisha, Anna Paszyńska, Maciej Woźniak, Andrew Lenharth, Maciej Paszyński, Piotr Gurgul
Publikováno v:
Scientific Programming, Vol 2015 (2015)
We construct quasi-optimal elimination trees for 2D finite element meshes with singularities. These trees minimize the complexity of the solution of the discrete system. The computational cost estimates of the elimination process model the execution
Publikováno v:
ICCS
In this paper, we present a multi-frontal solver algorithm for the adaptive finite element method expressed by graph grammar productions. The graph grammar productions construct first the binary elimination tree, and then process frontal matrices sto
Autor:
Donald Nguyen, Andrew Lenharth, María Jesús Garzarán, Keshav Pingali, David Padua, Saeed Maleki
Publikováno v:
ICS
The Single Source Shortest Path (SSSP) problem consists in finding the shortest paths from a vertex (the source vertex) to all other vertices in a graph. SSSP has numerous applications. For some algorithms and applications, it is useful to solve the
Autor:
María Jesús Garzarán, Saeed Maleki, Keshav Pingali, Andrew Lenharth, Donald Nguyen, David Padua
Publikováno v:
PPOPP
The Single-Source Shortest Path (SSSP) problem is to find the shortest paths from a source vertex to all other vertices in a graph. In this paper, we introduce the Dijkstra Strip-Mined Relaxation (DSMR) algorithm, an efficient parallel SSSP algorithm