article

Developing Efficient Implementations of Bellman-Ford and Forward-Backward Graph Algorithms for NEC SX-ACE

Authors:

Ilya V. Afanasyev,

Alexander S. Antonov,

Dmitry A. Nikitenko,

Vadim V. Voevodin,

Vladimir V. Voevodin,

Kazuhiko Komatsu,

Osamu Watanabe,

Akihiro Musa,

Hiroaki KobayashiAuthors Info & Claims

Supercomputing Frontiers and Innovations, Volume 5, Issue 3

Pages 65 - 69

https://doi.org/10.14529/jsfi180311

Published: 15 September 2018 Publication History

Abstract

The main goal of this work is to demonstrate that the development of data-intensive applications for vector systems is not only important and interesting, but is also very possible. In this paper we describe possible implementations of two fundamental graph-processing algorithms for an NEC SX-ACE vector computer: the Bellman-Ford algorithm for single source shortest paths computation and the Forward-Backward algorithm for strongly connected components detection. The proposed implementations have been developed and optimised in accordance with features and properties of the target architecture, which allowed them to achieve performance comparable to other traditional platforms, such as Intel Skylake, Intel Knight Landing or IBM Power processors.

References

[1]

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). IEEE (may 2017).

Crossref

Google Scholar

[2]

Fleischer, L.K., Hendrickson, B., Pnar, A.: On identifying strongly connected components in parallel. In: Lecture Notes in Computer Science, pp. 505-511. Springer Berlin Heidelberg (2000). 68

Crossref

Google Scholar

[3]

Jiang, L., Chen, L., Qiu, J.: Performance characterization of multi-threaded graph processing applications on many-integrated-core architecture. In: 2018 IEEE International Symposium on Performance Analysis of Systems and Software (ISPASS). IEEE (apr 2018).

Crossref

Google Scholar

[4]

Nepomniaschaya, A.S.: An associative version of the bellman-ford algorithm for finding the shortest paths in directed graphs. In: Lecture Notes in Computer Science, pp. 285-292. Springer Berlin Heidelberg (2001). 28

Crossref

Google Scholar

Cited By

View all

Suplatov DShegay MSharapova YTimokhin IPopova NVoevodin VŠvedas V(2021)Co-designing HPC-systems by computing capabilities and management flexibility to accommodate bioinformatic workflows at different complexity levelsThe Journal of Supercomputing10.1007/s11227-021-03691-x77:11(12382-12398)Online publication date: 1-Nov-2021
https://dl.acm.org/doi/10.1007/s11227-021-03691-x
Afanasyev IVoevodin VKomatsu KKobayashi H(2021)VGL: a high-performance graph processing framework for the NEC SX-Aurora TSUBASA vector architectureThe Journal of Supercomputing10.1007/s11227-020-03564-977:8(8694-8715)Online publication date: 1-Aug-2021
https://dl.acm.org/doi/10.1007/s11227-020-03564-9
Muite BAseeri S(2019)Benchmarking Solvers for the One Dimensional Cubic Nonlinear Klein Gordon Equation on a Single CoreBenchmarking, Measuring, and Optimizing10.1007/978-3-030-49556-5_18(172-184)Online publication date: 14-Nov-2019
https://dl.acm.org/doi/10.1007/978-3-030-49556-5_18

Index Terms

Developing Efficient Implementations of Bellman-Ford and Forward-Backward Graph Algorithms for NEC SX-ACE

Index terms have been assigned to the content through auto-classification.

Recommendations

Towards high-performance implementations of a custom HPC kernel using ® array building blocks
Facing the Multicore-Challenge II

Today's highly parallel machines drive a new demand for parallel programming. Fixed power envelopes, increasing problem sizes, and new algorithms pose challenging targets for developers. HPC applications must leverage SIMD units, multi-core ...
Efficient execution of graph algorithms on CPU with SIMD extensions
CGO '21: Proceedings of the 2021 IEEE/ACM International Symposium on Code Generation and Optimization

Existing state-of-the-art CPU graph frameworks take advantage of multiple cores, but not the SIMD capability within each core. In this work, we retarget an existing GPU graph algorithm compiler to obtain the first graph framework that uses SIMD ...
VGL: a high-performance graph processing framework for the NEC SX-Aurora TSUBASA vector architecture
Abstract
Developing efficient graph algorithms implementations is an extremely important problem of modern computer science, since graphs are frequently used in various real-world applications. Graph algorithms typically belong to the data-intensive class, ...

Comments

Information & Contributors

Information

Published In

cover image Supercomputing Frontiers and Innovations: an International Journal

Supercomputing Frontiers and Innovations: an International Journal Volume 5, Issue 3

September 2018

133 pages

ISSN:2409-6008

EISSN:2313-8734

Issue’s Table of Contents

Publisher

South Ural State University

Chelyabinsk, Russian Federation

Publication History

Published: 15 September 2018

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 13 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Suplatov DShegay MSharapova YTimokhin IPopova NVoevodin VŠvedas V(2021)Co-designing HPC-systems by computing capabilities and management flexibility to accommodate bioinformatic workflows at different complexity levelsThe Journal of Supercomputing10.1007/s11227-021-03691-x77:11(12382-12398)Online publication date: 1-Nov-2021
https://dl.acm.org/doi/10.1007/s11227-021-03691-x
Afanasyev IVoevodin VKomatsu KKobayashi H(2021)VGL: a high-performance graph processing framework for the NEC SX-Aurora TSUBASA vector architectureThe Journal of Supercomputing10.1007/s11227-020-03564-977:8(8694-8715)Online publication date: 1-Aug-2021
https://dl.acm.org/doi/10.1007/s11227-020-03564-9
Muite BAseeri S(2019)Benchmarking Solvers for the One Dimensional Cubic Nonlinear Klein Gordon Equation on a Single CoreBenchmarking, Measuring, and Optimizing10.1007/978-3-030-49556-5_18(172-184)Online publication date: 14-Nov-2019
https://dl.acm.org/doi/10.1007/978-3-030-49556-5_18

Abstract

References

Cited By

Index Terms

Recommendations

Towards high-performance implementations of a custom HPC kernel using ® array building blocks

Efficient execution of graph algorithms on CPU with SIMD extensions

VGL: a high-performance graph processing framework for the NEC SX-Aurora TSUBASA vector architecture

Comments

Information

Published In

Publisher

Publication History

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations