@conference{10902/31395,
year = {2016},
url = {https://hdl.handle.net/10902/31395},
abstract = {As BigData applications have gained momentum over the last years, the Graph500 benchmark has appeared in an attempt to steer the design of HPC systems to maximize the performance under memory-constricted application workloads. A realistic simulation of such benchmarks for architectural research is challenging due to size and detail limitations, and synthetic traffic workloads constitute one of the least resource-consuming methods to evaluate the performance. In this work, we propose a synthetic traffic model that emulates the behavior of the Graph500 communications. Our model is empirically obtained through a characterization of several executions of the benchmark with different input parameters. We verify the validity of our model against a characterization of the execution of the benchmark with different parameters. Our model is well-suited for implementation in an architectural simulator.},
organization = {The authors would like to thank the European HiPEAC Network of Excellence for partially funding this work through a Collaboration Grant, as well as Cristóbal Camarero for his help. This work has been supported by the Spanish Ministry of Education, FPU grant FPU13/00337, the Spanish Science and Technology Commission (CICYT) under contract TIN2013-46957-C2-2-P, and by the Mont-Blanc project. The Mont-Blanc project has received funding from the European Union’s Horizon 2020 research and innovation programme under grant agreement No. 671697.},
publisher = {Algorithms and Architectures for Parallel Processing, Springer, 2016},
title = {Synthetic Traffic Model of the Graph500 Communications},
author = {Fuentes Saez, Pablo and Vallejo Gutiérrez, Enrique and Bosque Orero, José Luis and Beivide Palacio, Ramón and Anghe, Andreea and Rodríguez, Germán and Gusat, Mitch and Minkenberg, Cyriel},
}