default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDParallel Computing, Volume 57
Volume 57, September 2016
- R. Oguz Selvitopi, Cevdet Aykanat:
Reducing latency cost in 2D sparse matrix partitioning models. 1-24 - Alejandro Acosta
, Sergio Afonso, Francisco Almeida:
Extending Paralldroid with object oriented annotations. 25-36 - Keisuke Tsugane, Taisuke Boku, Hitoshi Murai, Mitsuhisa Sato, William M. Tang, Bei Wang:
Hybrid-view programming of nuclear fusion simulation code in the PGAS parallel programming language XcalableMP. 37-51 - Ketan Date, Rakesh Nagi:
GPU-accelerated Hungarian algorithms for the Linear Assignment Problem. 52-72 - Sean Wallace, Zhou Zhou, Venkatram Vishwanath, Susan Coghlan, John R. Tramm, Zhiling Lan, Michael E. Papka:
Application power profiling on IBM Blue Gene/Q. 73-86 - Emanuel H. Rubensson, Elias Rudberg:
Locality-aware parallel block-sparse matrix-matrix multiplication using the Chunks and Tasks programming model. 87-106
- Abhinav Vishnu, Andres Marquez, Dimitrios S. Nikolopoulos:
Editorial of the Special issue: SI: E2SC. 107 - Ziming Zhang, Michael Lang, Scott Pakin, Song Fu:
TracSim: Simulating and scheduling trapped power capacity to maximize machine room throughput. 108-124 - Lena Oden, Benjamin Klenk, Holger Fröning:
Analyzing GPU-controlled communication with dynamic parallelism in terms of performance and energy. 125-134
- Peter Arbenz, Laura Grigori, Rolf Krause, Olaf Schenk:
Special issue on Parallel Matrix Algorithms and Applications (PMAA'14). 135-136 - Radu Popescu, Michael A. Heroux, Simone Deparis:
Parallel subdomain solver strategies for the algebraic additive Schwarz preconditioner. 137-153 - Lubomír Ríha, Tomás Brzobohatý, Alexandros Markopoulos, Marta Jarosová, Tomás Kozubek, David Horák, Vaclav Hapla:
Implementation of the efficient communication layer for the highly parallel total FETI and hybrid total FETI solvers. 154-166 - Karl E. Prikopa, Wilfried N. Gansterer, Elias Wimmer:
Parallel iterative refinement linear least squares solvers based on all-reduce operations. 167-184 - Gemma Sanjuan, Tomàs Margalef, Ana Cortés:
Applying domain decomposition to wind field calculation. 185-196 - Bruno Carpentieri, Jia Liao, Masha Sosonkina, Aldo Bonfiglioli, Sven Baars:
Using the VBARMS method in parallel computing. 197-211 - Martin Köhler, Jens Saak:
On GPU acceleration of common solvers for (quasi-) triangular generalized Lyapunov equations. 212-221 - Lars Karlsson, Daniel Kressner, André Uschmajew:
Parallel algorithms for tensor completion in the CP format. 222-234 - Jean-Guillaume Dumas, Thierry Gautier, Clément Pernet, Jean-Louis Roch, Ziad Sultan:
Recursion based parallelization of exact dense linear algebra routines for Gaussian elimination. 235-249
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-04-25 17:36 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
