Good algorithm design style for multiprocessors

  • Authors:

  • Deng; Gu

  • Affiliations:

  • Dept. of Comput. Sci., York Univ., North York, Ont., Canada;-

  • Venue:
  • SPDP '94 Proceedings of the 1994 6th IEEE Symposium on Parallel and Distributed Processing
  • Year:
  • 1994

Quantified Score

Hi-index 0.00

Visualization

Abstract

We discuss a style of designing parallel algorithms with the following characteristics for a problem of the best known sequential time T(n): C1. Each processor spends O(T(n)/P) time in computing. C2. Each processor sends and/or receives O(n/P) messages of one-word-size. C3. The number of communication phases/sup 1/ is constant, independent of the input size n. We show this is possible to achieve for several fundamental computational problems.