default search action
10th IA3@SC 2020: Atlanta, GA, USA
- 10th IEEE/ACM Workshop on Irregular Applications: Architectures and Algorithms, IA3 2020, Atlanta, GA, USA, November 11, 2020. IEEE 2020, ISBN 978-1-6654-1557-6
- Nuwan Jayasena:
Memory Performance Optimization. ix - Mary W. Hall:
Research Challenges in Compiler Technology for Sparse Tensors. viii - Boro Sofranac, Ambros M. Gleixner, Sebastian Pokutta:
Accelerating Domain Propagation: An Efficient GPU-Parallel Algorithm over Sparse Matrices. 1-11 - Leonardo Solis-Vasquez, Diogo Santos-Martins, Andreas F. Tillack, Andreas Koch, Jérôme Eberhardt, Stefano Forli:
Parallelizing Irregular Computations for Molecular Docking. 12-21 - Stephen W. Timcheck, Jeremy D. Buhler:
Reducing Queuing Impact in Irregular Data Streaming Applications. 22-30 - Daniel Thuerck:
Supporting Irregularity in Throughput-Oriented Computing by SIMT-SIMD Integration. 31-35 - Da Zheng, Chao Ma, Minjie Wang, Jinjing Zhou, Qidong Su, Xiang Song, Quan Gan, Zheng Zhang, George Karypis:
DistDGL: Distributed Graph Neural Network Training for Billion-Scale Graphs. 36-44 - Tahsin Reza, Matei Ripeanu, Geoffrey Sanders, Roger Pearce:
Labeled Triangle Indexing for Efficiency Gains in Distributed Interactive Subgraph Search††This work was performed under the auspices of the U.S. Department of Energy by Lawrence Livermore National Laboratory under Contract DE-AC52-07NA27344 (LLNL-CONF-814976). Experiments were performed at the Livermore Computing facility. 45-53 - Ian Bogle, Erik G. Boman, Karen D. Devine, Sivasankaran Rajamanickam, George M. Slota:
Distributed Memory Graph Coloring Algorithms for Multiple GPUs. 54-62 - Zheming Jin, Hal Finkel:
Performance Evaluation of the Vectorizable Binary Search Algorithms on an FPGA Platform. 63-67
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.