Skip to main content
Springer Nature Link
Log in

Affine Dependence Classification for Communications Minimization

  • Published:
International Journal of Parallel Programming Aims and scope Submit manuscript

Abstract

This paper introduces results on placement and communications minimization for systems of affine recurrence equations. We show how to classify the dependences according to the number and nature of communications they may result in. We give both communication-free conditions and conditions for an efficient use of broadcast or neighbor-to-neighbor communication primitives. Since the dependences of a problem can generally not be all communication-free, we finally introduce a heuristic to globally minimize the communications based on the classification of dependences.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

REFERENCES

  1. D. J. Kuck, R. H. Kuhn, B. R. Leasure, and M. J. Wolfe, The Structure of an Advanced Retargetable Vectorizer, Supercomputers: Design and Applications Tutorial, pp. 967–974 (1984).

  2. H. P. Zima, H. J. Bast, and H. M. Gerndt, Superb: A Tool for Semi-Automatic mimd/simd Parallelization. Parallel Computing 6: 1–18 (1988).

    Google Scholar 

  3. U. Banerjee, R. Eigenman, A. Nicolau, and A. Padua, Automatic Program Parallelization. Proc. IEEE 81(2): 211–243 (February 1993).

    Google Scholar 

  4. S. P. Amarasinghe, J. M. Anderson, M. S. Lam, and C. W. Tseng, The Suif Compiler for Scalable Parallel Machines, in Proc. Seventh SIAM Conf. on Parallel Processing for Scientific Computing (February 1995).

  5. C. H. Huang and P. Sadayappan. Communication-free Hyperplane Partitioning of Nested Loops. In V. Banerjee, D. Gelernter, A. Nicolau, and D. Padua, (eds.), Languages and Compilers for Parallel Computing, LNCS No. 589, Springer Verlag, pp. 186–200 (1991).

  6. J. Ramanujam and P. Sadayappan. Compile-time Techniques for Data Distribution in Distributed Memory Machines, IEEE Trans. Parallel and Distribut. Syst. 2(4): 472–482 (October 1991).

    Google Scholar 

  7. M. Gupta and P. Banerjee, A Methodology for High-Level Synthesis of Communication on Multicomputers, Sixth ACM Int. Conf. on Supercomputing. ICS'92, ACM Press, pp. 357–367 (1992).

  8. J. M. Anderson and M. S. Lam. Global Optimizations for Parallelism and Locality on Scalable Parallel Machines. ACM Sigplan Notices 28(6): 112–125 (1993).

    Google Scholar 

  9. A. Darte and Y. Robert. On the Alignment Problem, Parallel Processing Letters 4(3). 259–270 (1994).

    Google Scholar 

  10. P. Feautrier. Towards Automatic Distribution, Parallel Processing Letters 4(3): 233–244 (1994).

    Google Scholar 

  11. W. Shang and Z. Shu, Data Alignment of Loop Nests without Nonlocal Communications, IEEE Int. Conf. Application Specific Array Processors, IEEE Computer Society Press, ASAP'94, pp 439–450 (August 1994).

  12. P. Feautrier. Compiling for Massively Parallel Architectures: A Perspective, Microprogramming and Microprocessors 41: 425–439 (1995).

    Google Scholar 

  13. C. Mongenet, Mapping for Communications Minimization Using Distribution and Alignment, Int. Conf. Parallel Architectures and Compilation Techniques, PACT'95, Cyprus, ACM Press, pp. 185–193 (June 1995).

  14. Y. Yaacoby and P. R. Cappello, Converting Affine Recurrence Equations to Quasiuniform Recurrence Equations, Journal of VLSI Signal Processing 11: 113–131 (1995).

    Google Scholar 

  15. P. Quinton and V. Van Dongen, The Mapping of Linear Recurrence Equations on Regular Arrays. The Journal of VLSI Signal Processing 1: 95–113 (1989).

    Google Scholar 

  16. M. Dion and Y. Robert, Mapping Affine Loop Nests: New Results, in B. Hertzberger and G. Serazzi, (eds.), Int. Conf. on High-Performance Computing and Networking, LNCS No. 919, Springer Verlag, HPCN'95, pp. 184–189 (May 1995). Milan, Italy.

    Google Scholar 

  17. C. Mongenet, Ph. Clauss, and G. R. Perrin, Geometrical Tools to Map Systems of Affine Recurrence Equations on Regular Arrays, Acta Informatica 31: 137–160 (1994).

    Google Scholar 

  18. M. Dion, Cyril Randriamaro, and Y. Robert, How to Optimize Residual Communications? Research Report 95-27, LIP, Ecole Normale Supérieure de Lyon, France (Octobre 1995).

    Google Scholar 

  19. V. Loechner and C. Mongenet. Solutions to the Communication Minimization Problem for Affine Recurrence Equations, EUROPAR'97, Passau, Germany, LNCS No. 1300. Springer Verlag (august 1997).

  20. A. Platonoff, Contribution à la Distribution Automatique des Données pour Machines Massivement Parallèles. Ph.D. Thesis, Université Paris 6, Ecole Nationale Supérieure des Mines de Paris (March 1995).

  21. C. Mongenet. Data Compiling for Systems of Affine Recurrence Equations, IEEE Int. Conf. on Application Specific Array Processors, IEEE Computer Society Press, ASAP'94, pp. 212–223 (1994).

Download references

Author information

Authors and Affiliations

  1. Laboratoire ICPS, Pôle API, Université Louis Pasteur de Strasbourg, Boulevard Sébastien Brant, 67400, Illkirch, France

    Catherine Mongenet

Authors
  1. Catherine Mongenet
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Mongenet, C. Affine Dependence Classification for Communications Minimization. International Journal of Parallel Programming 25, 497–524 (1997). https://doi.org/10.1023/A:1025165407063

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1025165407063