Solving linear recurrence systems on a Cray Y-MP

  • Marcin Paprzycki
  • Przemysław Stpiczyński
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 879)

Abstract

Three divide-and-conquer algorithms for solving linear recurrence systems are introduced. Two of them are algorithms for the general case whereas the third is designed to take full advantage of the constant coefficient case. All three algorithms were implemented on an 8-processor Cray Y-MP and the results of experiments are presented.

Keywords

Linear recurrence systems divide-and-conquer algorithms shared-memory multiprocessors speedup 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    A. Borodin and I. Munro, The computational complexity of algebraic and numerical problems (American Elsevier, New York 1975).Google Scholar
  2. [2]
    D.A. Carlson, Solving linear recurrence systems on mesh-connected computers with multiple global buses, J. Parallel and Distrib. Comput. 8(1990) 89–95.Google Scholar
  3. [3]
    S.-C. Chen, Speedup of iterative programs in multiprocessing systems. Dissertation, University of Illinois at Urbana 1975.Google Scholar
  4. [4]
    S.-C. Chen and D.J. Kuck, Time and parallel processor bounds for linear recurrence systems. IEEE Trans, on Computers 24(1975) 701–717.Google Scholar
  5. [5]
    J. Dongarra and L. Johnsson, Solving Banded Systems on Parallel Processor. Parallel Comput. 5(1987) 219–246.Google Scholar
  6. [6]
    D. Heller, A survey of parallel algorithms in numerical linear algebra. SIAM Review 20(1978) 740–777.Google Scholar
  7. [7]
    A.C. Greenberg, R.E. Lander, M.S. Paterson and Z. Galil, Efficient parallel algorithms for linear recurrence computation, Inf. Proc. Letters 15(1982) 31–35.Google Scholar
  8. [8]
    D.J. Kuck, Structure of Computers and Computations (Wiley, New York, 1978).Google Scholar
  9. [9]
    J. Modi, Parallel Algorithms and Matrix Computations (Oxford University Press, Oxford, 1988).Google Scholar
  10. [10]
    M. Paprzycki and I. Gladwell, Solving Almost Block Diagonal Systems on Parallel Computers. Parallel Comput. 17(1991) 133–153.Google Scholar
  11. [11]
    M. Paprzycki and P. Stpiczyński, Solving linear recurrence systems on parallel computers, Proceedings of the Mardi Gras '94 Conference, Baton Rouge, Feb. 10–12, 1994 (Nova Science Publishers, New York, 1994) — to appear.Google Scholar
  12. [12]
    P. Stpiczyński, Parallel algorithms for solving linear recurrence systems, in: L. Bougé et al. eds., Lecture Notes in Computer Science 634, (Springer-Verlag, Berlin, 1992) 343–348.Google Scholar
  13. [13]
    P. Stpiczyński, Error analysis of two parallel algorithms for solving linear recurrence systems, Parallel Comput. 19(1993) 917–923.Google Scholar
  14. [14]
    P. Stpiczyński, M. Paprzycki and R. Daniel, Parallel algorithm for solving linear recurrence sytems with constant coefficients, in preparation.Google Scholar

Copyright information

© Springer-Verlag 1994

Authors and Affiliations

  • Marcin Paprzycki
    • 1
  • Przemysław Stpiczyński
    • 2
  1. 1.Department of Mathematics and Computer ScienceUniversity of Texas of the Permian BasinOdessa
  2. 2.Institute of Mathematics, Numerical Analysis DepartmentMarie Curie-Skłodowska UniversityLublinPoland

Personalised recommendations