Advertisement

Recurrence semigroups and their relation to data storage in fast recurrence solvers on parallel machines

  • Daniel D. Gajski
Nonnumerical Parallel Algorithms
Part of the Lecture Notes in Computer Science book series (LNCS, volume 111)

Abstract

There is a wealth of algorithms for solving recurrence systems on parallel machines. However, none of them takes into account the time and cost necessary to supply data to processors and data organization in parallel memory modules. It is shown how algorithms based on semigroups of recurrences lead naturally to the solution of this problem. Furthermore, it is shown that a parallel processor with a shift unit for rearranging data in memories is sufficient for solving recurrence systems.

Keywords

Parallel Processor Functional Composition Recurrence System Storage Scheme Arithmetic Element 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [ChKS78]
    S. C. Chen, D. J. Kuck, and A. H. Sameh, "Practical Parallel Band Triangular System Solvers," ACM Trans. on Mathematical Software, Vol. 4, No. 3, pp. 270–277, Sept. 1978.MATHCrossRefMathSciNetGoogle Scholar
  2. [Gajs78a]
    D. D. Gajski, "Processor Arrays for Computing Linear Recurrence Systems," Proc. of the 1978 Int'1. Conf. on Parallel Processing, Bellaire, Michigan, pp. 246–256, 1978.Google Scholar
  3. [Gajs78b]
    D. D. Gajski, "An Algorithm for Solving Linear Recurrence Systems on Parallel and Pipelined Machines," University of Illinois, Department of Computer Science Report No. 78–953, Dec. 1978.Google Scholar
  4. [HyKu77]
    L. Hyafil and H. T. Kung, "The Complexity of Parallel Evaluation of Linear Recurrences," Journ. of the ACM, Vol. 24, No. 3, pp. 513–521, July 1977.MATHCrossRefMathSciNetGoogle Scholar
  5. [KoSt73]
    P. M. Kogge and H. S. Stone, "A Parallel Algorithm for the Efficient Solution of a General Class of Recurrence Equations," IEEE Trans. on Computers, Vol. C-22, pp. 786–793, Aug. 1973.MathSciNetCrossRefGoogle Scholar
  6. [LaFi77]
    R. E. Landner and M. J. Fisher, "Parallel Prefix Computation," Journ. of the ACM, Vol. 27, No. 4, pp. 831–838, Oct. 1980.CrossRefGoogle Scholar
  7. [SaBr77]
    A. H. Sameh and R. P. Brent, "Solving Triangular Systems on a Parallel Computer," SIAM Journ. Numerical Analysis, Vol. 14, pp. 1101–1113, 1977.MATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1981

Authors and Affiliations

  • Daniel D. Gajski
    • 1
  1. 1.Department of Computer ScienceUniversity of Illinois at Urbana-ChampaignUrbana

Personalised recommendations