@inproceedings {28037,
	title = {iPUG: Accelerating Breadth-First Graph~Traversals Using Manycore Graphcore~IPUs},
	journal = {High Performance Computing. ISC High Performance 2021},
	volume = {LNCS, volume 12728},
	year = {2021},
	pages = {291-309},
	publisher = {Springer International Publishing},
	address = {Cham},
	abstract = {The Graphcore Intelligence Processing Unit (IPU) is a newly developed processor type whose architecture does not rely on the traditional caching hierarchies. Developed to meet the need for more and more data-centric applications, such as machine learning, IPUs combine a dedicated portion of SRAM with each of its numerous cores, resulting in high memory bandwidth at the price of capacity. The proximity of processor cores and memory makes the IPU a promising field of experimentation for graph algorithms since it is the unpredictable, irregular memory accesses that lead to performance losses in traditional processors with pre-caching.This paper aims to test the IPU{\textquoteright}s suitability for algorithms with hard-to-predict memory accesses by implementing a breadth-first search (BFS) that complies with the Graph500 specifications. Precisely because of its apparent simplicity, BFS is an established benchmark that is not only subroutine for a variety of more complex graph algorithms, but also allows comparability across a wide range of architectures.We benchmark our IPU code on a wide range of instances and compare its performance to state-of-the-art CPU and GPU codes. The results indicate that the IPU delivers speedups of up\&nbsp;to\&nbsp;4{\texttimes}4{\texttimes}\&nbsp;over the fastest competing result on an NVIDIA V100 GPU, with typical speedups of about\&nbsp;1.5{\texttimes}1.5{\texttimes}\&nbsp;on most test instances.},
	keywords = {BFS, Graph500, IPU, Performance optimization},
	isbn = {978-3-030-78712-7},
	issn = {0302-9743},
	doi = {10.1007/978-3-030-78713-4},
	url = {https://link.springer.com/10.1007/978-3-030-78713-4},
	author = {Burchard, Luk and Moe, Johannes and Daniel Thilo {Schroeder} and Pogorelov, Konstantin and Langguth, Johannes},
	editor = {Bradford L. {Chamberlain} and Varbanescu, Ana-Lucia and Ltaief, Hatem and Luszczek, Piotr}
}
