Developing efficient implementations of Bellman-Ford and Forward-Backward graph algorithms for NEC SX-ACE

Ilya V. Afanasyev, Alexander S. Antonov, Dmitry A. Nikitenko, Vadim V. Voevodin, Vladimir V. Voevodin, Kazuhiko Komatsu, Osamu Watanabe, Akihiro Musa, Hiroaki Kobayashi

Research output: Contribution to journalArticlepeer-review

8 Citations (Scopus)

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.

Original languageEnglish
Pages (from-to)65-69
Number of pages5
JournalSupercomputing Frontiers and Innovations
Volume5
Issue number3
DOIs
Publication statusPublished - 2018

Keywords

  • Data-intensive applications
  • Graph algorithms
  • NEC SX-ACE
  • Vector computing

ASJC Scopus subject areas

  • Software
  • Information Systems
  • Hardware and Architecture
  • Computer Science Applications
  • Computer Networks and Communications
  • Computational Theory and Mathematics

Fingerprint Dive into the research topics of 'Developing efficient implementations of Bellman-Ford and Forward-Backward graph algorithms for NEC SX-ACE'. Together they form a unique fingerprint.

Cite this