Graph Problems Performance Comparison Using Intel Xeon and Intel Xeon-Phi

Autor:	Jiří Hanzelka, Kateřina Slaninová, Jan Martinovič, Robert Skopal, Jiří Dvorský
Rok vydání:	2017
Předmět:	Intel iPSC Xeon Computer science x86 Itanium Graph (abstract data type) Pentium Hyper-threading Parallel computing Xeon Phi
Zdroj:	Advances in Intelligent Systems and Computing ISBN: 9789811034084 ACSS (1)
DOI:	10.1007/978-981-10-3409-1_5
Popis:	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.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::6bc3387d188f63b2fb7ebeb9317ca259 https://doi.org/10.1007/978-981-10-3409-1_5 Zobrazit plný text záznamu