Skip to main content
SpringerLink
Log in
Book cover

European Conference on Distributed Memory Computing

EDMCC 1991: Distributed Memory Computing pp 90–99Cite as

Interleaving partitions of systolic algorithms for programming distributed memory multiprocessors

  • Tools
  • Conference paper
  • First Online:

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

Abstract

In this paper we present a systematic method for mapping systolizable problems onto Distributed Memory Multiprocessors. A systolizable problem is a problem for which it is possible to design a Systolic Algorithm. As a first stage, we design a Systolic Algorithm for the problem to be solved. Then, different transformations are applied to this Systolic Algorithm in order to adapt it to the available Distributed Memory Multiprocessor. One of these transformations is what we call band interleaving. This transformation which is the main contribution of this paper permits to increase the granularity of the parallel algorithm reducing in this way the communication requirements. We will show how the proposed transformations modify the original sequential code in order to obtain the parametrized code for each Processing Element of the Distributed Memory Multiprocessor. The method is illustrated with an example consisting in the design of a parallel algorithm to solve a triangular system of equations on a Distributed Memory Multiprocessor System with a ring topology. Some measurements of performance are presented for the case of a Transputer-based network.

This work has been supported by the Ministry of Education of Spain (CICYT) in program TIC 299/89, and ESPRIT PCA 4146.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   74.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. D.Callahan and K.Kennedy. "Compiling Programs for Distributed-Memory Multiprocessors". J.Supercomputing 2, october 1988, pp. 151–169, Kluwer Academic Publishers.

    Google Scholar 

  2. A.Fernández, J.M.Llaberia, J.J.Navarro, M.Valero-García and M.Valero. "On the Use of Systolic Algorithms for Programming Distributed Memory Multiprocessors", Proc. Int'l. Conference on Systolic Arrays, Prentice Hall, pp. 631.640, 1989.

    Google Scholar 

  3. J.A.B.Fortes and D.I.Moldovan. "Data Broadcasting in Linearly Scheduled Array Processors", Proc. 11th Int'l Annual Symp on Computer Architecture, pp. 224–231, 1984.

    Google Scholar 

  4. G. A. Geist and M. T. Heath. "Parallel Algorithms for Matrix Computations", The Characteristics of Parallel Algorithms, MIT 1987, pp. 233–251.

    Google Scholar 

  5. M. Heath and C. Romine. "Parallel Solution of RTriangular Systems on Distributed-Memory Multiprocessors", SIAM J. Sci. Stat. Comput. 9 (1988), pp. 558–588.

    Article  Google Scholar 

  6. O.H. Ibarra and S.M. Sohn. "On Mapping Systolic Algorithms onto the Hypercube". Int'l Conf. on Parallel Processing, Vol.I, pp 121–124, 1989.

    Google Scholar 

  7. C.T. King, L.M. Ni, "Grouping in Nested Loops for Parallel Execution on Multicomputers", Int'l Conf. on Parallel Processing, Vol.II, pp 31–38, 1989.

    Google Scholar 

  8. H.T.Kung and C.E.Leiserson. "Systolic Arrays (for VLSI)", Sparse Matrix Proc. 1978, 1979, Society for Industrial and Applied Mathematics (SIAM), pp.256–282.

    Google Scholar 

  9. C.Lengauer. "Towards Systolizing Compilation: an Overview". Proc. Parallel Architectures and Languages Europe, PARLE'89. Lecture Notes in Computer Science 366, Springer-Verlag, pp. 253–272, 1989.

    Google Scholar 

  10. G. Li and T. Coleman. "A Parallel Triangular Solver for a Distributed-Memory Multiprocessor", SIAM J. Sci. Stat. Comput. 9 (1988), pp. 485–502.

    Article  MathSciNet  Google Scholar 

  11. D.I. Moldovan. "On the Design of Algorithms for VLSI Systolic Arrays", Proc. of the IEEE, vol 71, no. 1, 1983. pp. 113–120.

    Article  Google Scholar 

  12. C. Moler. "Matrix Computation on Distributed Memory Multiprocessors", Hypercube Multiprocessors 1986, pp 181–195.

    Google Scholar 

  13. D. I. Moldovan and J. A. B. Fortes. "Partitioning and Mapping Algorithms into Fixed Size Systolic Arrays", IEEE Trans. on Computers, Vol. 35, no. 1, 1986, pp. 1–12.

    Article  Google Scholar 

  14. P.Quinton. "Automatic Synthesis of Systolic Arrays from Uniform Recurrent Equations", 11th Int'l Annual Symp. on Computer Architecture, pp.208–214, 1984.

    Google Scholar 

  15. J.Ramanujan and P.Sadayappan. "A Methodology for Parallelizing Programs for Multicomputers and Complex Memory Multiprocessors", Supercomputing 89, pp 637–646, 1989.

    Google Scholar 

  16. J.Torres, E.Ayguade, J.Labarta, J.M.Llabería, M.Valero. "On Automatic Loop Data-Mapping for Distributed-Memory Multiprocessors", Proceedings of the 2nd European Distributed Memory Computers Conference, Springer-Verlag (in this volume), 1991.

    Google Scholar 

  17. V.VanDongen and P.Quinton. "Uniformization of Linear Recurrence Equations: a Step Towards the Automatic Synthesis of Systolic Arrays", Proc. Int'l Conf. on Systolic Arrays, pp. 473–482, 1988.

    Google Scholar 

  18. C. Whitty-Stevens. "The Transputer". Proc 12th Int'l Symp. of Computer Architecture, 1985, pp. 292–300.

    Google Scholar 

  19. Y.Won and J.M.Delosme. "Boadcast Removal in Systolic Algorithms", Proc Int'l Conf. on Systolic Arrays, pp. 403–412, 1988.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department d'Arquitectura de Computadors, Universitat Politècnica de Catalunya c/ Sor Eulalia de Anzizu, Mòdul D4, 08034, Barcelona, Spain

    A. Fernández, J. M. Liabería, J. J. Navarro & M. Valero-García

Authors
  1. A. Fernández
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. J. M. Liabería
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. J. J. Navarro
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. M. Valero-García
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Arndt Bode

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fernández, A., Liabería, J.M., Navarro, J.J., Valero-García, M. (1991). Interleaving partitions of systolic algorithms for programming distributed memory multiprocessors. In: Bode, A. (eds) Distributed Memory Computing. EDMCC 1991. Lecture Notes in Computer Science, vol 487. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0032926

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-53951-3

  • Online ISBN: 978-3-540-46478-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation