.png){kind=icon}
Return
Multi-GPU-based Swendsen-Wang multi-cluster algorithm with reduced data traffic
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cpc.2015.04.025.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The computational performance of multi-GPU applications can be degraded by the data communication between each GPU. To realize high-speed computation with multiple GPUs, we should minimize the cost of this data communication. In this paper, I propose a multiple GPU computing method for the Swendsen-Wang (SW) multi-cluster algorithm that reduces the data traffic between each GPU. I realize this reduction in data traffic by adjusting the connection information between each GPU in advance. The code is implemented on the large-scale open science TSUBAME 2.5 supercomputer, and its performance is evaluated using a simulation of the three-dimensional Ising model at the critical temperature. The results show that the data communication between each GPU is reduced by 90%, and the number of communications between each GPU decreases by about half. Using 512 GPUs, the computation time is 0.005 ns per spin update at the critical temperature for a total system size of N = 4096(3). (C) 2015 Elsevier B.V. All rights reserved.
Keywords:
Monte Carlo simulation
Cluster algorithm
Ising model
Parallel computing
Multi-GPU
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.4
Papers:
1.2W
Citations:
3.7W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSave
View more