Developing an Efficient Vector-Friendly Implementation of the Breadth-First Search Algorithm for NEC SX-Aurora TSUBASA-Reference-Cited by-同舟云学术

Developing an Efficient Vector-Friendly Implementation of the Breadth-First Search Algorithm for NEC SX-Aurora TSUBASA

Published:2020 Issue: Volume: Page:131-145
ISSN:1865-0929
Container-title:Communications in Computer and Information Science
language:
Short-container-title:

Author:

Afanasyev Ilya V.^ORCID,Voevodin Vladimir V.^ORCID,Komatsu Kazuhiko^ORCID,Kobayashi Hiroaki^ORCID

Publisher

Springer International Publishing

Link

https://link.springer.com/content/pdf/10.1007/978-3-030-55326-5_10

Reference21 articles.

1. Afanasyev, I.V., et al.: Developing efficient implementations of bellman-ford and forward-backward graph algorithms for nec SX-ACE. Supercomput. Front. Innov. 5(3), 65–69 (2018)

2. Lecture Notes in Computer Science;IV Afanasyev,2019

3. Beamer, S., Asanović, K., Patterson, D.: Direction-optimizing breadth-first search. Sci. Program. 21(3–4), 137–148 (2013)

4. Beamer, S., Asanović, K., Patterson, D.: The gap benchmark suite. arXiv preprint arXiv:1508.03619 (2015)

5. Besta, M., Marending, F., Solomonik, E., Hoefler, T.: Slimsell: a vectorizable graph representation for breadth-first search. In: 2017 IEEE International Parallel and Distributed Processing Symposium (IPDPS), pp. 32–41. IEEE (2017)

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Page-Address Coalescing of Vector Gather Instructions for Efficient Address Translation;2022 IEEE/ACM Workshop on Irregular Applications: Architectures and Algorithms (IA3);2022-11

2. A dynamic parameter tuning method for SpMM parallel execution;Concurrency and Computation: Practice and Experience;2021-12-09