Optimizing Sweep3D for graphic processor unit

11Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

Abstract

As a powerful and flexible processor, the Graphic Processing Unit (GPU) can offer great faculty in solving many high-performance computing applications. Sweep3D, which simulates a single group timeindependent discrete ordinates (Sn) neutron transport deterministically on 3D Cartesian geometry space, represents the key part of a real ASCI application. The wavefront process for parallel computation in Sweep3D limits the concurrent threads on the GPU. In this paper, we present multi-dimensional optimization methods for Sweep3D, which can be efficiently implemented on the fine grained parallel architecture of the GPU. Our results show that the performance of overall Sweep3D on CPU-GPU hybrid platform can be improved up to 2.25 times as compared to the CPU-based implementation. © Springer-Verlag Berlin Heidelberg 2010.

Cite

CITATION STYLE

APA

Gong, C., Liu, J., Gong, Z., Qin, J., & Xie, J. (2010). Optimizing Sweep3D for graphic processor unit. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6081 LNCS, pp. 416–426). https://doi.org/10.1007/978-3-642-13119-6_36

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free