Parallel prefix computation on a pyramid computer

  • Cinque L
  • Bongiovanni G
  • 10

    Readers

    Mendeley users who have this article in their library.
  • 17

    Citations

    Citations of this article.

Abstract

The initial prefix problem is to compute all n initial prefixes a1,a1°a2,...,a1°a2°...°an, given n elements a1, a2, ..., anand a binary, associative operation denoted °. In this paper we present a parallel algorithm for the solution of such a problem on a pyramid computer. The algorithm is optimal, since for n elements it requires O(n/lg n) processors and O(lg n) time (excluding the time to load the image). © 1995.

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

Authors

  • L. Cinque

  • G. Bongiovanni

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free