Skip to main content
SpringerLink
Log in

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

  • Nonnumerical Parallel Algorithms
  • Conference paper
  • First Online:
Conpar 81 (CONPAR 1981)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 111))

Included in the following conference series:

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.

This work was supported in part by the National Science Foundation under Grant No. US NSF MCS80-01561.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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.

    Article  MATH  MathSciNet  Google Scholar 

  2. 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. 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. 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.

    Article  MATH  MathSciNet  Google Scholar 

  5. 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.

    Article  MathSciNet  Google Scholar 

  6. R. E. Landner and M. J. Fisher, "Parallel Prefix Computation," Journ. of the ACM, Vol. 27, No. 4, pp. 831–838, Oct. 1980.

    Article  Google Scholar 

  7. A. H. Sameh and R. P. Brent, "Solving Triangular Systems on a Parallel Computer," SIAM Journ. Numerical Analysis, Vol. 14, pp. 1101–1113, 1977.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Illinois at Urbana-Champaign, 61801, Urbana, Illinois

    Daniel D. Gajski

Authors
  1. Daniel D. Gajski
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

W. Brauer P. Brinch Hansen D. Gries C. Moler G. Seegmüller J. Stoer N. Wirth Wolfgang Händler

Rights and permissions

Reprints and permissions

Copyright information

© 1981 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gajski, D.D. (1981). Recurrence semigroups and their relation to data storage in fast recurrence solvers on parallel machines. In: Brauer, W., et al. Conpar 81. CONPAR 1981. Lecture Notes in Computer Science, vol 111. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0105129

Download citation

  • DOI: https://doi.org/10.1007/BFb0105129

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-10827-6

  • Online ISBN: 978-3-540-38715-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation