Skip to main content
SpringerLink
Log in

Parallelism Detection in Nested Loops, Optimal

  • Reference work entry
Encyclopedia of Parallel Computing

  • 223 Accesses

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

Access this chapter

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 1,600.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 1,799.99
Price excludes VAT (USA)
  • Durable hardcover 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

Bibliography

  1. Alias C, Darte A, Feautrier P, Gonnord L (2010) Multi-dimensional rankings, program termination, and complexity bounds of flowchart programs. In 17th International Static Analysis Symposium (SAS’10). Lecture notes in computer science, vol 6337. Springer Verlag, Perpignan, pp 117–133

    Google Scholar 

  2. Allen JR, Kennedy K (1987) Automatic translation of Fortran programs to vector form. ACM Trans Program Lang Syst 9(4): 491–542

    MATH  Google Scholar 

  3. Bondhugula U, Baskaran MM, Krishnamoorthy S, Ramanujam J, Rountev A, Sadayappan P (2008) Automatic transformations for communication-minimized parallelization and locality optimization in the polyhedral model. In Compiler Construction (CC’08). Lecture notes in computer science, vol 4959. Springer Verlag, pp 132–146

    Google Scholar 

  4. Collard J-F, Feautrier P, Risset T (1995) Construction of DO loops from systems of affine constraints. Parallel Process Lett 5(3): 421–436

    Google Scholar 

  5. Colón MA, Sipma HB (2002) Practical methods for proving program termination. In 14th International Conference on Computer Aided Verification (CAV). Lecture notes in computer science, vol 2404. Springer Verlag, pp 442–454

    Google Scholar 

  6. Cousot P, Halbwachs N (1978) Automatic discovery of linear restraints among variables of a program. In 5th ACM Symposium on Principles of Programming Languages (POPL’78). ACM, Tucson, pp 84–96

    Google Scholar 

  7. Darte A (2010) Understanding loops: The influence of the decomposition of Karp, Miller, and Winograd. In 8th ACM/IEEE International Conference on Formal Methods and Models for Codesign (MEMOCODE’10). IEEE Computer Society, Grenoble, pp 139–148

    Google Scholar 

  8. Darte A, Huard G (2002) Complexity of multi-dimensional loop alignment. In 19th International Symposium on Theoretical Aspects of Computer Science (STACS’02), vol 2285. Springer Verlag, pp 179–191

    Google Scholar 

  9. Darte A, Khachiyan L, Robert Y (1991) Linear scheduling is nearly optimal. Parallel Process Lett 1(2):73–81

    Google Scholar 

  10. Darte A, Robert Y, Vivien F (2000) Scheduling and Automatic Parallelization. Birkhauser. ISBN 0-8176-4149-1

    MATH  Google Scholar 

  11. Darte A, Vivien F (1995) Revisiting the decomposition of Karp, Miller, and Winograd. Parallel Process Lett 5(4):551–562

    Google Scholar 

  12. Darte A, Vivien F (1997) On the optimality of Allen and Kennedy’s algorithm for parallelism extraction in nested loops. J Parallel Algorithms Appl 12(1–3):83–112

    MATH  MathSciNet  Google Scholar 

  13. Darte A, Vivien F (1997) Optimal fine and medium grain parallelism detection in polyhedral reduced dependence graphs. Int J Parallel Program 25(6):447–497

    Google Scholar 

  14. Feautrier P (1988) Parametric integer programming. RAIRO Rech Opérationnelle 22:243–268

    MATH  MathSciNet  Google Scholar 

  15. Feautrier P (1991) Dataflow analysis of array and scalar references. Int J Parallel Program 20(1):23–51

    MATH  Google Scholar 

  16. Feautrier P (1992) Some efficient solutions to the affine scheduling problem, part II: Multi-dimensional time. Int J Parallel Program 21(6):389–420

    MATH  MathSciNet  Google Scholar 

  17. Gulwani S, Mehra KK, Chilimbi T (2009) SPEED: Precise and efficient static estimation of program computational complexity. In 36th ACM Symposium on Principles of Programming Languages (POPL’09). ACM, Savannah, pp 127–139

    Google Scholar 

  18. Karp RM, Miller RE, Winograd S (1967) The organization of computations for uniform recurrence equations. J ACM 14(3):563–590

    MATH  MathSciNet  Google Scholar 

  19. Lamport L (1974) The parallel execution of DO loops. Commun ACM 17(2):83–93

    MATH  MathSciNet  Google Scholar 

  20. Leiserson CE, Saxe JB (1991) Retiming synchronous circuitry. Algorithmica 6(1):5–35

    MATH  MathSciNet  Google Scholar 

  21. Lim AW, Lam MS (1997) Maximizing parallelism and minimizing synchronization with affine transforms. In 24th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL’97). ACM, New York, pp 201–214

    Google Scholar 

  22. Podelski A, Rybalchenko A (2004) A complete method for the synthesis of linear ranking functions. In Verification, Model Checking, and Abstract Interpretation (VMCAI’03). Lecture notes in computer science, vol 2937. Springer Verlag, pp 239–251

    Google Scholar 

  23. Schrijver A (1986) Theory of Linear and Integer Programming. Wiley, New York

    MATH  Google Scholar 

  24. Vivien F (2003) On the optimality of Feautrier’s scheduling algorithm. Concurr Comput 15(11–12):1047–1068

    MATH  Google Scholar 

  25. Wolf ME, Lam MS (1991) A loop transformation theory and an algorithm to maximize parallelism. IEEE Trans Parallel Distributed Syst 2(4):452–471

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. CNRS, Compsys team, LIP, Computer Science Laboratory, École Normale Supérieure de Lyon, UMR 5668 CNRS—ENS Lyon—UCB Lyon—Inria, Lyon, France

    Alain Darte (Dr.)

Authors
  1. Alain Darte
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of Illinois at Urbana-Champaign, Urbana, IL, USA

    David Padua

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer Science+Business Media, LLC

About this entry

Cite this entry

Darte, A. (2011). Parallelism Detection in Nested Loops, Optimal. In: Padua, D. (eds) Encyclopedia of Parallel Computing. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-09766-4_519

Download citation

Publish with us

Policies and ethics

Search

Navigation