A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Co-locating Graph Analytics and HPC Applications
2017
2017 IEEE International Conference on Cluster Computing (CLUSTER)
We evaluate the on-node interference caused when co-locating traditional high-performance computing applications with a big-data application. Using kernel benchmarks from the NPB suite and a state-of-art graph analytics code, we explore different process placements and effects they have on application performance. Our results show that the most memory intensive HPC application (MG) experienced the highest performance variation during co-location.
doi:10.1109/cluster.2017.111
dblp:conf/cluster/BrownM17
fatcat:jygg43ks75envhuj2sfeqkndx4