![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
5. IA3@SC 2015: Austin, Texas, USA
- Antonino Tumeo, John Feo, Oreste Villa:
Proceedings of the 5th Workshop on Irregular Applications - Architectures and Algorithms, IA3 2015, Austin, Texas, USA, November 15, 2015. ACM 2015, ISBN 978-1-4503-4001-4 - Alex Pothen:
How to match in parallel: approximation algorithms and multicore machines. 1:1 - Daniel Sánchez:
A scalable architecture for ordered irregular parallelism. 2:1 - Mohamed Wahib, Naoya Maruyama:
Data-centric GPU-based adaptive mesh refinement. 3:1-3:7 - Justus A. Calvin, Cannada A. Lewis, Edward F. Valeev
:
Scalable task-based algorithm for multiplication of block-rank-sparse matrices. 4:1-4:8 - Shaden Smith, George Karypis
:
Tensor-matrix products with a compressed sparse tensor. 5:1-5:7 - A. N. Yzelman:
Generalised vectorisation for sparse matrix: vector multiplication. 6:1-6:8 - Maya B. Gokhale, G. Scott Lloyd, Chris Macaraeg:
Hybrid memory cube performance characterization on data-centric workloads. 7:1-7:8 - David C. Anastasiu
, George Karypis
:
PL2AP: fast parallel cosine similarity search. 8:1-8:8 - Aditya M. Deshpande, Jeffrey T. Draper, J. Brian Rigdon, Richard F. Barrett:
PathFinder: a signature-search miniapp and its runtime characteristics. 9:1-9:4 - Mohammad M. Hossain, Thomas M. Tucker, Thomas R. Kurfess, Richard W. Vuduc
:
A GPU-parallel construction of volumetric tree. 10:1-10:4 - Peter Zhang, Eric Holk, John Matty, Samantha Misurda, Marcin Zalewski, Jonathan Chu, Scott McMillan, Andrew Lumsdaine
:
Dynamic parallelism for simple and efficient GPU graph algorithms. 11:1-11:4 - Massimo Bernaschi, Giancarlo Carbone, Flavio Vella
:
Betweenness centrality on Multi-GPU systems. 12:1-12:4 - Scott Beamer, Krste Asanovic, David A. Patterson:
GAIL: the graph algorithm iron law. 13:1-13:4 - Dominique LaSalle, Md. Mostofa Ali Patwary, Nadathur Satish, Narayanan Sundaram, Pradeep Dubey, George Karypis
:
Improving graph partitioning for modern graphs and architectures. 14:1-14:4
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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.