Skip to main content
SpringerLink
Log in

Automatic Coarse-Grained Parallelization Techniques

  • Chapter
Advances in High Performance Computing

Part of the book series: NATO ASI Series ((ASHT,volume 30))

Abstract

We present a complete automatic coarse-grained parallelization tool allowing the execution of sequential programs on distributed memory parallel computers. It is based on the PlusPyr parameterized task graph builder and a new dynamic scheduling algorithm whose computational complexity and experimental performances are analyzed.

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

Access this chapter

Log in via an institution
eBook
USD 16.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. U. Banerjee, An Introduction to a Formal Theory of Dependence Analysis, The Journal of Supercomputing 2,2, 1988, pp. 133–149

    Google Scholar 

  2. P. Boulet et al.,(Pen)-ultimate tiling, Research Report LIP-CNRS-ENS LYON 93–36, 1993

    Google Scholar 

  3. T. Brandes et al, IIPFIT: A Set of Integrated Tools for the Parallelization of Applications Using HPF, In J.J. Dongarra and B. Tourancheau, editors, Third Workshop on Environments and Tools for Parallel Scientific Computing, Faverges, August 1996. SIAM.

    Google Scholar 

  4. Th. Brandes and F. Zimmermann, ADAPTOR - A Transformation Tool for HPF Programs, In K.M. Decker and R.M. Rehmann, editors, Programming Environments for Massively Parallel Distributed Systems, pages 91–96. Birkhäuser, April 1994.

    Google Scholar 

  5. Z. Chamski, Environnement logiciel de programmation d’un accélérateur de calcul parallèe, Ph. D. Thesis Université Rennes I, Rennes France, 1993

    Google Scholar 

  6. J.Y. Colin and P. Chretienne, Grain Size and Communication Channels on Distributed Memory Multiprocessors, РarСo93, 1993, pp. 281–286

    Google Scholar 

  7. M. Cosnard and M. Loi, Automatic task graph generation techniques, Parallel Processing Letters, 5,4 (1995), 527–538.

    Article  Google Scholar 

  8. M. Cosnard and M. Loi, A Simple Algorithm for the Generation of Efficient Loop Structures International Journal of Parallel Processing, to appear.

    Google Scholar 

  9. R. Cytron, M. Hind and W. Hsieh, Automatic generation of DAG Parallelism, Proceedings of the ACM SIGPLAN’89 Conference on Programming Language Design and Implementation, 1989

    Google Scholar 

  10. P. Feautrier, Parametric Integer Programming,RAIRO Recherche Opérationelle 22, 1988, pp. 243–268

    MathSciNet  MATH  Google Scholar 

  11. P. Feautrier, Dataflow analysis of array and scalar references, Int. Journal of Parallel Programming 20 (1991), no. 1, 23–53.

    Article  MATH  Google Scholar 

  12. P. Feautrier, Some Efficient Solutions to the A,ffinе Scheduling Scheduling Problem, Part I, One Dimensional Time, Int. Journal of Parallel Programming 21 (1992)

    Google Scholar 

  13. High Performance Fortran Forum, High Performance Fortran Language Specification, Version 2.0.а.3, Department of Computer Science, Rice University, August 1996.

    Google Scholar 

  14. E. Horowitz, S. Sahni, S. Anderson-Freed, Fundamentals of data structures in C, W.H. Freeman and company, New-York, 1993.

    Google Scholar 

  15. F. Irigoin and R. Triolet, Supernode Partitioning, ACM SIGACT-SIGPLAN SPPL 88, 1988, pp. 319–329

    Google Scholar 

  16. B. Kruatrachue and T. Lewis, Grain Size Determination for Parallel Processing, IEEESOFT 5, 1, 1988, pp. 23–32

    Google Scholar 

  17. V. M. Lo and al., OREGAMI: Tools for Mapping Parallel Computations to Parallel Architectures, Parallel Computing, 1992, pp. 237

    Google Scholar 

  18. M. Loi, Construction et exécution de graphes de tâches acycliques d gros grains, PhD thesis, ENS Lyon, France, 1996.

    Google Scholar 

  19. V. Maslow, Lazy array data-flow dependences analysis, Conference Record of the 21st ACM SIGPLAN Symposium on Principles of Programming Languages, January 1994, pp. 311–325.

    Chapter  Google Scholar 

  20. W. Pugh and D. Wonnacott, An evaluation of exact methods for analysis of value-based array data dependences,Sixth Annual Workshop on Programming Languages and Compilers for Parallel Computing (Portland, Oregon), August 1993.

    Google Scholar 

  21. S. Rajopadhye, LACS: A language for ajfine communication structures, Research Report IRISA PI-712, 1993

    Google Scholar 

  22. S. Rajopadhye and D. K. Wilde, Allocating memory arrays for polyhedra, Research Report IRISA PI-749, 1993

    Google Scholar 

  23. A. Schrijver Theory of linear and integer programming, John Wiley & sons, 1986.

    MATH  Google Scholar 

  24. M. Ujaldon et al. Vienna-Fortran/HPF Extensions for Sparse and Irregular Problems and Their Compilation,Technical Report TR 95–5, University of Vienna, 1995.

    Google Scholar 

  25. D. K. Wilde, A library for doing polyhedral operations, Research Report IRISA PI-785, 1993

    Google Scholar 

  26. T. Yang and A. Gerasoulis,Pyrrol: Static task scheduling and code generation for message passing multiprocessors, 6th ACM International Conference on Supercomputing (Washington, D.C.), July 1992, pp. 428–437.

    Google Scholar 

  27. T. Yang and A. Gerasoulis, DSC: Scheduling Parallel Tasks on an Unbounded Number of Processors,IEEE Transaction on Parallel and Distributed Systems, vol 5, No 9, september 1994, pp.951–967.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoire de l’Informatique du Parallélisme, CNRS, Ecole Normale Supérieure de Lyon, 69364, Lyon, France

    M. Cosnard & E. Jeannot

Authors
  1. M. Cosnard
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. E. Jeannot
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Rende(Cosenza), Italy

    Lucio Grandinetti

  2. Seattle, Washington, USA

    Janusz Kowalik

  3. Bratislava, Slovakia

    Marian Vajtersic

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer Science+Business Media Dordrecht

About this chapter

Cite this chapter

Cosnard, M., Jeannot, E. (1997). Automatic Coarse-Grained Parallelization Techniques. In: Grandinetti, L., Kowalik, J., Vajtersic, M. (eds) Advances in High Performance Computing. NATO ASI Series, vol 30. Springer, Dordrecht. https://doi.org/10.1007/978-94-011-5514-4_15

Download citation

  • DOI: https://doi.org/10.1007/978-94-011-5514-4_15

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-94-010-6322-7

  • Online ISBN: 978-94-011-5514-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation