Showing papers on "Parallel algorithm published in 1974"

Parallel solution of recurrence problems

Abstract: An mth-order recurrence problem is defined as the computation of the sequence x1,, xN, where x1 = f(ai, xi-1,,xi-m), and ai, is some vector of parameters This paper investigates general algorithms for solving such problems on highly parallel computers We show that if the recurrence function f has associated with it two other functions that satisfy certain composition properties, then we can construct elegant and efficient parallel algorithms that can compute all N elements of the series in time proportional to ⌈log2N⌉ The class of problems having this property includes linear recurrences of all orders- both homogeneous and inhomogeneous, recurrences involving matrix or binary quantities, and various nonlinear problemsin volving operations such as computation with matrix inverses, exponentiation, and modulo division

On the efficient computation of recurrence relations

Abstract: A new parallel algorithm for the solution of a general linear recurrence is described. Its relation to the work of Kogge and Stone is discussed.

Parallel Algorithms for Joining Two Points by a Straight-Line Segment

Abstract: After an overview of the cellular logic image processor, CLIP 3, parallel algorithms for joining two points are described. These real time algorithms are simple, work properly, preserve the connectivity, are based only on logic, and show much of the behavior of processing occurring in sensory elements of animals.

A New Parallel Algorithm for Network Flow Problems

Abstract: Recently Chen and Feng [i] developed an algorithm for solving the maximum flow problem with an associative processor. The algorithm is based upon the matrix multiplication [3] which requires O(n 3) computations sequentially and (n 2) computations with a parallel processor where n is the dimension of the matrix. In this paper, we present a new algorithm which requires about 0(n 2) computations sequentially, and 0(n) computations parallelly. This new algorithm is based on node-exclusion from a graph. Let N 1 be the source node and Nn be the sink node. A node N k is excluded from a graph if (i) Clk = 0, or (2) after the following operation: i. CIj ÷ min. (Clk , Ckj ) ....... (i)