Prefix Scan and Minimum Spanning Tree with OpenCLReport
GPUs have been widely used to achieve wide data-parallelism to facilitate the execution of concurrent computations for performance and effciency. A lot of prior work have been done for CUDA, while OpenCL, as an open standard with the advantage of being able to run across multiple GPU platforms, still lacks development and effcient data primitives in its open standard libraries. This report discusses our work on constructing an effcient OpenCL implementation for parallel prefix scan and its improved performance over the scan primitive in the OpenCL standard library CLPP. The report also discusses our work on implementing the minimum spanning tree algorithm in OpenCL using our parallel segmented scan primitive and its improved performance over the original sequential execution.
All rights reserved (no additional license for public reuse)
Sun, Yixin, and Kevin Skadron. "Prefix Scan and Minimum Spanning Tree with OpenCL." University of Virginia Dept. of Computer Science Tech Report (2013).
University of Virginia, Department of Computer Science