Parallel Recurrence Solvers for Vector and SIMD Supercomputers

In this paper we present two algorithms for the parallel solution of first-order linear recurrences, We show that the algorithms can be used to efficiently solve both scalar and blocked versions of the problem on vector and SIMD architectures. The first algorithm is a parallel approach whose resulti...

Full description

Saved in:
Bibliographic Details
Published inJournal of parallel and distributed computing Vol. 23; no. 3; pp. 435 - 441
Main Authors Conn, H.E., Podrazik, L.J.
Format Journal Article
LanguageEnglish
Published San Diego, CA Elsevier Inc 01.12.1994
Elsevier
Subjects
Algorithmics. Computability. Computer arithmetics
Applied sciences
Computer science; control theory; systems
Exact sciences and technology
Programming theory
Theoretical computing
Supercomputer
Recurrence
Parallel algorithm
Algorithm performance
SIMD computer
Parallelism
Recursive algorithm
Communication
Online AccessGet full text

Cover

More Information
Summary:In this paper we present two algorithms for the parallel solution of first-order linear recurrences, We show that the algorithms can be used to efficiently solve both scalar and blocked versions of the problem on vector and SIMD architectures. The first algorithm is a parallel approach whose resulting code can be explicitly vectorized, making it suitable for efficient execution on vector architectures such as the Cray 2. The second algorithm is a modified recursive approach designed to reduce the communication overhead encountered in SIMD architectures such as the Connection Machine 2 (CM-2). We present the performance exhibited by the parallel algorithm implementations on the Cray 2 and CM-2 for both scalar and blocked versions of the recurrence problem.
ISSN:0743-7315
1096-0848
DOI:10.1006/jpdc.1994.1153