Efficient Parallel Prefix Algorithms on Fully Connected Message-Passing Computers

  • Authors:

  • Yen-Chun Lin;C. M. Lin

  • Affiliations:

  • -;-

  • Venue:
  • HIPC '96 Proceedings of the Third International Conference on High-Performance Computing (HiPC '96)
  • Year:
  • 1996

Quantified Score

Hi-index 0.00

Visualization

Abstract

Given n values v(0), v(1),..., v(n P 1) and an associative binary operation, denoted by o, the prefix problem is to compute the n prefixes v(0) o v(1) o ... o v(i), 0