Skip to main content
Springer Nature Link
Log in

Communication Optimization for Affine Recurrence Equations Using Broadcast and Locality

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

Abstract

This paper deals with communication optimization which is a crucial issue in automatic parallelization. From a system of parameterized affine recurrence equations we propose a heuristic that determines a set of efficient space-time transformations. It focuses on distant communications removal using broadcast—including anticipated broadcast, and locality enforcement.

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. P. Quinton and V. Van Dongen, The Mapping of Linear Recurrence Equations on Regular Arrays, J. VLSI Signal Processing, 1:95–113 (1989).

    Google Scholar 

  2. C. Lengauer, Loop Parallelization in the Polytope Model, CONCUR (1993).

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

    Google Scholar 

  4. M. Dion, C. Randriamaro, and Y. Robert, How to Optimize Residual Communications? Research Report 95–27, LIP, Ecole Normale Supérieure de Lyon, France (October 1995).

    Google Scholar 

  5. M. Dion and Y. Robert, Mapping Affine Loop Nests: New Results. In B. Hertzberger and G. Serazzi, (eds.), Intl. Conf. on High-Performance Computing and Networking, Milan, Italy, Springer-Verlag, pp. 184–189 (May 1995).

    Google Scholar 

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

  7. P. Feautrier, Compiling for Massively Parallel Architectures: A Perspective, Microprogr. Microproc., 41:425–439 (1995).

    Google Scholar 

  8. V. Loechner and D. K. Wilde, Parameterized Polyhedra and their Vertices, IJPP, 25(6):525–549 (December 1997).

    Google Scholar 

  9. C. Mongenet, Ph. Clauss, and G. R. Perrin, A Geometrical Coding to Compile Affine Recurrence Equations on Regular Arrays, Fifth Intl. Parallel Processing Symp. IPPS (1991).

  10. P. Feautrier, Some Efficient Solutions to the Affine Scheduling Problem, Part 1: One-dimensional Time, IJPP, 21(5):313–348 (October 1992).

    Google Scholar 

  11. P. Feautrier, Some Efficient Solutions to the Affine Scheduling Problem, Part 2: Multi-dimensional Time, IJPP, 21(6):389–420 (December 1992).

    Google Scholar 

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

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

    Google Scholar 

  14. C. Mongenet, Affine Dependence Classification for Communications Minimization, IJPP, 25(6):497–524 (December 1997).

    Google Scholar 

  15. V. Loechner and C. Mongenet, Solutions to the Communication Minimization Problem for Affine Recurrence Equations. In C. Lengauer, M. Griebl, and S. Gorlatch, (eds.), Europar'97, Springer-Verlag, LNCS 1300, pp. 328–337 (August 1997).

  16. D. K. Wilde, A Library for Doing Polyhedral Operations, Technical Report 785, IRISA, Rennes, France (1993).

    Google Scholar 

  17. Ph. Clauss, Counting Solutions to Linear and Nonlinear Constraints through Ehrhart Polynomials: Applications to Analyze and Transform Scientific Programs, Tenth ACM Intl. Conf. on Supercomputing, Philadelphia, Pennsylvania (1996).

  18. V. Loechner and C. Mongenet, Memory Cost Due to Anticipated Broadcast, Eight Workshop on Compilers for Parallel Computers, CPC, Aussois, France (January 2000).

  19. V. Loechner, Contribution à l'Etude des Polyàdres Paramétrés et Applications en Parallélisation Automatique, Ph.D. Thesis, Université Louis Pasteur, Strasbourg (1997). http://icps.u-strasbg.fr/pub-97/.

    Google Scholar 

  20. Ph. Clauss, Handling Memory Cache Policy with Integer Points Countings. In C. Lengauer, M. Griebl, and S. Gorlatch, (eds.), Euro-Par'97, Passau, pp. 285–293, Springer-Verlag, LNCS 1300 (August 1997).

  21. W. Kelly and W. Pugh, Minimizing Communication while Preserving Parallelism, Tenth ACM Intl. Conf. on Supercomputing, Philadelphia, Pennsylvania (1996).

  22. A. W. Lim, G. I. Cheong, and M. S. Lam, An Affine Partitioning Algorithm to Maximize Parallelism and Minimize Communication, 13th ACM Intl. Conf. Supercomputing, Rhodes, Greece (1999).

  23. A. W. Lim and M. S. Lam, Maximizing Parallelism and Minimizing Synchronization with Affine Transforms, 24th ACM SIGPLAN Symp. Principles of Progr. Lang. (1997).

  24. A. W. Lim and M. S. Lam, Maximizing Parallelism and Minimizing Synchronization with Affine Partitions, Parallel Computing, 24:445–475 (1998).

    Google Scholar 

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

    Google Scholar 

  26. A. Platonoff, Automatic Data Distribution for Massively Parallel Computers, Fifth Intl. Workshop on Compilers for Parallel Computers, Malaga University, Spain (June 1995).

    Google Scholar 

  27. Ph. Clauss and V. Loechner, Parametric Analysis of Polyhedral Iteration Spaces, J. VLSI Signal Processing, 19(2):179–194 (July 1998).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoire ICPS, Université Louis Pasteur de Strasbourg, Bd. S. Brant, F-67400, Illkirch, France

    Vincent Loechner & Catherine Mongenet

  2. Laboratoire LRIM, Université de Metz, Ile du Saulcy, BP 80794, F-57012, Metz Cedex 1, France

    Vincent Loechner

Authors
  1. Vincent Loechner
    View author publications

    You can also search for this author in PubMed Google Scholar

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

Loechner, V., Mongenet, C. Communication Optimization for Affine Recurrence Equations Using Broadcast and Locality. International Journal of Parallel Programming 28, 47–102 (2000). https://doi.org/10.1023/A:1007559710855

Download citation

  • Issue Date:

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