Abstract
While most modern well known performance benchmarks for high performance computers focused mainly on the speed of arithmetical operations, the increasing amount of nowadays problems depend also on the speed of memory access. This aspect is becoming crucial for all data driven computations. In this paper, two benchmarks focusing on the speed of memory access are examined. The first examined benchmark is well known Graph 500. This benchmark was developed in order to measure the computers performance in memory retrieval using the Breadth First Search algorithm on randomly generated graph. The second benchmark uses the real world data set (Czech Republic traffic network) as an input graph on which the betweenness centrality algorithm is performed. Both of these benchmarks were tested on SALOMON cluster comparing performance on both Xeon processors and Xeon-Phi co-processors. Obtained performance results were analyzed and discussed at the end of the paper.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
ANTAREX (AutoTuning and Adaptivity appRoach for Energy efficient eXascale HPC systems), 671623, H2020-FETHPC-2014: http://www.antarex-project.eu/
Angel, J.B., Flores, A.M., Heritage, J.S., Wardrip, N.C.: Graph 500 Performance on a Distributed-Memory Cluster. Technical Report HPCF-2012-11 (2012)
Brandes, U.: A Faster Algorithm For Betweenness Centrality (2001)
Checconi, F., Petrini, F., Willcock, J., Lumsdaine, A., Choudhury, A.R., Sabharwal, Y.: Breaking the speed and scalability barriers for graph exploration on distributed-memory machines. Supercomputing (2012)
Fujisawa, K., Matsuo, H.P.: Graph analysis & HPC Techniques for Realizing Urban OS (2015)
Lovász, L.: Large Networks And Graph Limits, vol. 60. Colloquium Publications (2012)
Intel VTune Amplifier XE: https://software.intel.com/en-us/intel-vtune-amplifier-xe
OpenStreetMap: https://www.openstreetmap.org
The Graph 500 Benchmark: http://www.graph500.org
The Top 500 Benchmark: http://www.top500.org
Acknowledgements
This work was supported by The Ministry of Education, Youth and Sports from the National Programme of Sustainability (NPU II) project ‘IT4Innovations excellence in science - LQ1602’, from the Large Infrastructures for Research, Experimental Development and Innovations project ‘IT4Innovations National Supercomputing Center LM2015070’ and co-financed by the internal grant agency of VŠB - Technical University of Ostrava, Czech Republic, under the projects no. SP2016/166 ‘HPC Usage for Analysis of Uncertain Time Series II’ and no. SP2016/179 ‘HPC Usage for Transport Optimisation based on Dynamic Routing II’.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer Nature Singapore Pte Ltd.
About this chapter
Cite this chapter
Hanzelka, J., Skopal, R., Slaninová, K., Martinovič, J., Dvorský, J. (2017). Graph Problems Performance Comparison Using Intel Xeon and Intel Xeon-Phi. In: Chaki, R., Saeed, K., Cortesi, A., Chaki, N. (eds) Advanced Computing and Systems for Security. Advances in Intelligent Systems and Computing, vol 567. Springer, Singapore. https://doi.org/10.1007/978-981-10-3409-1_5
Download citation
DOI: https://doi.org/10.1007/978-981-10-3409-1_5
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-10-3408-4
Online ISBN: 978-981-10-3409-1
eBook Packages: EngineeringEngineering (R0)