A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
PERFORMANCE ANALYSIS OF THE PARALLEL CUPID CODE IN DISTRIBUTED MEMORY SYSTEM BASED ETHERNET AND INFINIBAND NETWORK
이더넷과 인피니밴드 네트워크 기반의 분산 메모리 시스템에서 병렬성능 분석
2014
Journal of computational fluids engineering
이더넷과 인피니밴드 네트워크 기반의 분산 메모리 시스템에서 병렬성능 분석
In this study, a parallel performance of CUPID-code has been investigated for both Ethernet and Infiniband network system to examine the effect of cache memory and network-speed. Bi-conjugate gradient solver of CUPID-code has been parallelised by using domain decomposition method and message passing interface (MPI). It is shown that the parallel performance of Ethernet-network system is worse than that of Infiniband-network system due to the slow network-speed and a small cache memory. It is
doi:10.6112/kscfe.2014.19.2.024
fatcat:xjm36lo3brdgnpjmwnap2o2mty