Accelerating CUDA graph algorithms at maximum warp
- 12 February 2011
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGPLAN Notices
- Vol. 46 (8) , 267-276
- https://doi.org/10.1145/2038037.1941590
Abstract
No abstract availableThis publication has 14 references indexed in Scilit:
- Language virtualization for heterogeneous parallel computingPublished by Association for Computing Machinery (ACM) ,2010
- Debunking the 100X GPU vs. CPU mythPublished by Association for Computing Machinery (ACM) ,2010
- The GPU Computing EraIEEE Micro, 2010
- Rodinia: A benchmark suite for heterogeneous computingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2009
- SNAP, Small-world Network Analysis and Partitioning: An open-source parallel graph framework for the exploration of large-scale networks2008 IEEE International Symposium on Parallel and Distributed Processing, 2008
- Graph Analysis with High-Performance ComputingComputing in Science & Engineering, 2008
- Designing Multithreaded Algorithms for Breadth-First Search and st-connectivity on the Cray MTA-2Published by Institute of Electrical and Electronics Engineers (IEEE) ,2006
- A Parallel External-Memory Frontier Breadth-First Traversal Algorithm for Clusters of WorkstationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2006
- A Scalable Distributed Parallel Breadth-First Search Algorithm on BlueGene/LPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- R-MAT: A Recursive Model for Graph MiningPublished by Society for Industrial & Applied Mathematics (SIAM) ,2004