Nearly logarithmic-time parallel algorithms for the class of ±2b ASCEND computations on a SIMD hypercube

Document Type

Conference Proceeding

Publication Date

12-1-1992

Abstract

Recently, we have studied two important classes of algorithms requiring ±2b communications: ±2b-descend, and ±2b-ascend. Let N = 2n be the number of PEs in a SIMD hypercube which restricts all communications to a single fixed dimension at a time. In [5], we developed an efficient O(n) algorithm for the descend class. In [6], we obtained a simple O(n2/log n) algorithm for the ascend class, requiring O(log n) words of local memory per PE. In this paper, we present two new algorithms for the ascend class on a SIMD hypercube. The first algorithm runs in O(n1.5) time and requires O(1) space per PE. The second algorithm, which is discussed only briefly here, runs in O(n√n/log n) time and requires O(log n) space per PE.

Identifier

0026995430 (Scopus)

ISBN

[0818626720]

Publication Title

Proceedings of the International Conference on Parallel Processing

ISSN

01903918

First Page

122

Last Page

129

This document is currently not available here.

Share

COinS