default search action
8th GPGPU@PPOPP 2015: San Francisco, CA, USA
- David R. Kaeli, John Cavazos:
Proceedings of the 8th Workshop on General Purpose Processing using GPUs, GPGPU@PPoPP 2015, San Francisco, CA, USA, February 7, 2015. ACM 2015, ISBN 978-1-4503-3407-5
HPC
- Ayman Tarakji, Lukas Börger, Rainer Leupers:
A comparative investigation of device-specific mechanisms for exploiting HPC accelerators. 1-12
Cache and Shared Memory
- Javier Cabezas, Marc Jordà, Isaac Gelado, Nacho Navarro, Wen-mei W. Hwu:
GPU-SM: shared memory multi-GPU programming. 13-24 - Yingying Tian, Sooraj Puthoor, Joseph L. Greathouse, Bradford M. Beckmann, Daniel A. Jiménez:
Adaptive GPU cache bypassing. 25-35 - Mahmoud Khairy, Mohamed Zahran, Amr G. Wassal:
Efficient utilization of GPGPU cache hierarchy. 36-47
Optimization
- Jared Coplin, Martin Burtscher:
Effects of source-code optimizations on GPU performance and energy consumption. 48-58 - Azzam Haidar, Tingxing Dong, Piotr Luszczek, Stanimire Tomov, Jack J. Dongarra:
Optimization for performance and energy for batched matrix computations on GPUs. 59-69 - Thibaut Lutz, Christian Fensch, Murray Cole:
Helium: a transparent inter-kernel optimizer for OpenCL. 70-80
Applications
- Rashid Kaleem, Sreepathi Pai, Keshav Pingali:
Stochastic gradient descent on GPUs. 81-89 - Leiming Yu, Yan Zhang, Xiang Gong, Nilay Roy, Lee Makowski, David R. Kaeli:
High performance computing of fiber scattering simulation. 90-98 - Molly A. O'Neil, Martin Burtscher:
Rethinking the parallelization of random-restart hill climbing: a case study in optimizing a 2-opt TSP solver for GPU execution. 99-108 - Mahesh Ravishankar, Justin Holewinski, Vinod Grover:
Forma: a DSL for image processing applications to target GPUs and multi-core CPUs. 109-120
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.