skip to main content
Skip header Section
Loop Transformations for Restructuring Compilers: The FoundationsJanuary 1993
Publisher:
  • Kluwer Academic Publishers
  • 101 Philip Drive Assinippi Park Norwell, MA
  • United States
ISBN:978-0-7923-9318-4
Published:01 January 1993
Pages:
328
Skip Bibliometrics Section
Bibliometrics
Abstract

No abstract available.

Cited By

  1. ACM
    Sukumaran-Rajam A and Clauss P (2015). The Polyhedral Model of Nonlinear Loops, ACM Transactions on Architecture and Code Optimization, 12:4, (1-27), Online publication date: 7-Jan-2016.
  2. ACM
    Yuki T Revisiting loop transformations with x10 clocks Proceedings of the ACM SIGPLAN Workshop on X10, (1-6)
  3. ACM
    Jimborean A, Koukos K, Spiliopoulos V, Black-Schaffer D and Kaxiras S Fix the code. Don't tweak the hardware Proceedings of Annual IEEE/ACM International Symposium on Code Generation and Optimization, (262-272)
  4. ACM
    Clauss P Author retrospective for counting solutions to linear and nonlinear constraints through ehrhart polynomials ACM International Conference on Supercomputing 25th Anniversary Volume, (37-39)
  5. ACM
    Mitra S, Laguna I, Ahn D, Bagchi S, Schulz M and Gamblin T (2014). Accurate application progress analysis for large-scale parallel debugging, ACM SIGPLAN Notices, 49:6, (193-203), Online publication date: 5-Jun-2014.
  6. ACM
    Jimborean A, Koukos K, Spiliopoulos V, Black-Schaffer D and Kaxiras S Fix the code. Don't tweak the hardware Proceedings of Annual IEEE/ACM International Symposium on Code Generation and Optimization, (262-272)
  7. ACM
    Mitra S, Laguna I, Ahn D, Bagchi S, Schulz M and Gamblin T Accurate application progress analysis for large-scale parallel debugging Proceedings of the 35th ACM SIGPLAN Conference on Programming Language Design and Implementation, (193-203)
  8. ACM
    Bondhugula U, Bandishti V, Cohen A, Potron G and Vasilache N Tiling and optimizing time-iterated computations on periodic domains Proceedings of the 23rd international conference on Parallel architectures and compilation, (39-50)
  9. ACM
    Upadrasta R and Cohen A Sub-polyhedral scheduling using (unit-)two-variable-per-inequality polyhedra Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (483-496)
  10. ACM
    Upadrasta R and Cohen A (2013). Sub-polyhedral scheduling using (unit-)two-variable-per-inequality polyhedra, ACM SIGPLAN Notices, 48:1, (483-496), Online publication date: 23-Jan-2013.
  11. ACM
    Johnson N, Oh T, Zaks A and August D Fast condensation of the program dependence graph Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation, (39-50)
  12. ACM
    Johnson N, Oh T, Zaks A and August D (2013). Fast condensation of the program dependence graph, ACM SIGPLAN Notices, 48:6, (39-50), Online publication date: 23-Jun-2013.
  13. Jimborean A, Clauss P, Martinez J and Sukumaran-Rajam A Online dynamic dependence analysis for speculative polyhedral parallelization Proceedings of the 19th international conference on Parallel Processing, (191-202)
  14. ACM
    Bayliss S and Constantinides G Optimizing SDRAM bandwidth for custom FPGA loop accelerators Proceedings of the ACM/SIGDA international symposium on Field Programmable Gate Arrays, (195-204)
  15. ACM
    Österlund E and Löwe W Analysis of pure methods using garbage collection Proceedings of the 2012 ACM SIGPLAN Workshop on Memory Systems Performance and Correctness, (48-57)
  16. Jimborean A, Mastrangelo L, Loechner V and Clauss P VMAD Proceedings of the 21st international conference on Compiler Construction, (220-239)
  17. ACM
    Geelen B, Ferentinos V, Catthoor F, Lafruit G, Verkest D, Lauwereins R and Stouraitis T (2010). Modeling and exploiting spatial locality trade-offs in wavelet-based applications under varying resource requirements, ACM Transactions on Embedded Computing Systems (TECS), 9:3, (1-26), Online publication date: 1-Feb-2010.
  18. Raghavendra P, Behki A, Hariprasad K, Mohan M, Jain P, Bhat S, Thejus V and Prabhu V A study of performance scalability by parallelizing loop iterations on multi-core SMPs Proceedings of the 10th international conference on Algorithms and Architectures for Parallel Processing - Volume Part I, (476-486)
  19. Aslam A and Hendren L McFLAT Proceedings of the 23rd international conference on Languages and compilers for parallel computing, (1-15)
  20. ACM
    Kejariwal A, Veidenbaum A, Nicolau A, Girkar M, Tian X and Saito H (2009). On the exploitation of loop-level parallelism in embedded applications, ACM Transactions on Embedded Computing Systems (TECS), 8:2, (1-34), Online publication date: 1-Jan-2009.
  21. ACM
    Bai L, Yang L and Dick R (2009). MEMMU, ACM Transactions on Embedded Computing Systems, 8:3, (1-33), Online publication date: 1-Apr-2009.
  22. Mili A, Ben Ayed R, Aharon S and Nadkarni C (2009). Harnessing a Refinement Theory to Compute Loop Functions, Electronic Notes in Theoretical Computer Science (ENTCS), 243, (139-155), Online publication date: 1-Jul-2009.
  23. Mili A, Aharon S and Nadkarni C (2009). Mathematics for reasoning about loop functions, Science of Computer Programming, 74:11-12, (989-1020), Online publication date: 1-Nov-2009.
  24. Kwiatkowski J and Iwaszyn R Automatic program parallelization for multicore processors Proceedings of the 8th international conference on Parallel processing and applied mathematics: Part I, (236-245)
  25. ACM
    d'Auriol B, Chikkappaiah P, Yuan W, Lee S and Lee Y Query responsive awareness software Proceedings of the 2nd international conference on Ubiquitous information management and communication, (520-524)
  26. Torkey F, Salah A, El Desouky N and Gomaa S (2018). Transformations techniques for extracting parallelism in non-uniform nested loops, WSEAS Transactions on Computers, 7:9, (1395-1404), Online publication date: 1-Sep-2008.
  27. Torkey F, Salah A, El Desouky N and Gomaa S Affine and unimodular transformations for non-uniform nested loops Proceedings of the 12th WSEAS international conference on Computers, (414-419)
  28. ACM
    Rong H, Tang Z, Govindarajan R, Douillet A and Gao G (2007). Single-dimension software pipelining for multidimensional loops, ACM Transactions on Architecture and Code Optimization, 4:1, (7-es), Online publication date: 1-Mar-2007.
  29. ACM
    Hu Q, Kjeldsberg P, Vandecappelle A, Palkovic M and Catthoor F (2007). Incremental hierarchical memory size estimation for steering of loop transformations, ACM Transactions on Design Automation of Electronic Systems, 12:4, (50-es), Online publication date: 1-Sep-2007.
  30. Zhao J, Horsnell M, Rogers I, Dinn A, Kirkham C and Watson I Optimizing chip multiprocessor work distribution using dynamic compilation Proceedings of the 13th international Euro-Par conference on Parallel Processing, (258-267)
  31. Hu Q, Vandecappelle A, Palkovic M, Kjeldsberg P, Brockmeyer E and Catthoor F Hierarchical memory size estimation for loop fusion and loop shifting in data-dominated applications Proceedings of the 2006 Asia and South Pacific Design Automation Conference, (606-611)
  32. ACM
    Kejariwal A, Nicolau A, Saito H, Tian X, Girkar M, Banerjee U and Polychronopoulos C A general approach for partitioning N-dimensional parallel nested loops with conditionals Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures, (49-58)
  33. Claßen M and Griebl M Automatic code generation for distributed memory architectures in the polytope model Proceedings of the 20th international conference on Parallel and distributed processing, (227-227)
  34. Hillers M and Nebel W Impact of array data flow analysis on the design of energy-efficient circuits Proceedings of the 16th international conference on Integrated Circuit and System Design: power and Timing Modeling, Optimization and Simulation, (117-126)
  35. Parsa S and Lotfi S Loop parallelization in multi-dimensional cartesian space Proceedings of the 6th international Andrei Ershov memorial conference on Perspectives of systems informatics, (335-348)
  36. Chang W, Chu C and Wu J (2005). A Polynomial-Time Dependence Test for Determining Integer-Valued Solutions in Multi-Dimensional Arrays Under Variable Bounds, The Journal of Supercomputing, 31:2, (111-135), Online publication date: 1-Feb-2005.
  37. D'Alberto P, Nicolau A, Veidenbaum A and Gupta R (2005). Line Size Adaptivity Analysis of Parameterized Loop Nests for Direct Mapped Data Cache, IEEE Transactions on Computers, 54:2, (185-197), Online publication date: 1-Feb-2005.
  38. ACM
    Bulić P and Guštin V (2005). An efficient way to filter out data dependences with a sufficiently large distance between memory references, ACM SIGPLAN Notices, 40:4, (51-60), Online publication date: 1-Apr-2005.
  39. ACM
    Kejariwal A, Nicolau A, Banerjee U and Polychronopoulos C A novel approach for partitioning iteration spaces with variable densities Proceedings of the tenth ACM SIGPLAN symposium on Principles and practice of parallel programming, (120-131)
  40. Pop S, Cohen A and Silber G Induction variable analysis with delayed abstractions Proceedings of the First international conference on High Performance Embedded Architectures and Compilers, (218-232)
  41. Chang W, Chu C and Ho M (2018). Exploitation of parallelism to nested loops with dependence cycles, Journal of Systems Architecture: the EUROMICRO Journal, 50:12, (729-742), Online publication date: 1-Dec-2004.
  42. Rong H, Tang Z, Govindarajan R, Douillet A and Gao G Single-Dimension Software Pipelining for Multi-Dimensional Loops Proceedings of the international symposium on Code generation and optimization: feedback-directed and runtime optimization
  43. Kejariwal A, D'Alberto P, Nicolau A and Polychronopoulos C A geometric approach for partitioning n-dimensional non-rectangular iteration spaces Proceedings of the 17th international conference on Languages and Compilers for High Performance Computing, (102-116)
  44. D'Alberto P, Nicolau A, Veidenbaum A and Gupta R Static analysis of parameterized loop nests for energy efficient use of data caches Compilers and operating systems for low power, (193-207)
  45. Loechner V, Meister B and Clauss P (2019). Precise Data Locality Optimization of Nested Loops, The Journal of Supercomputing, 21:1, (37-76), Online publication date: 1-Jan-2002.
  46. Tembe W and Pande S (2002). Loop Restructuring for Data I/O Minimization on Limited On-Chip Memory Embedded Processors, IEEE Transactions on Computers, 51:10, (1269-1280), Online publication date: 1-Oct-2002.
  47. Ramasubramanian N, Subramanian R and Pande S (2002). Automatic Compilation of Loops to Exploit Operator Parallelism on Configurable Arithmetic Logic Units, IEEE Transactions on Parallel and Distributed Systems, 13:1, (45-66), Online publication date: 1-Jan-2002.
  48. O'Boyle M and Knijnenburg P (2002). Integrating Loop and Data Transformations for Global Optimization, Journal of Parallel and Distributed Computing, 62:4, (563-590), Online publication date: 1-Apr-2002.
  49. McCollum B, Corr P and Milligan P A meta-heuristic approach to parallel code generation Proceedings of the 5th international conference on High performance computing for computational science, (693-702)
  50. Joisha P and Banerjee P (2001). The Efficient Computation of Ownership Sets in HPF, IEEE Transactions on Parallel and Distributed Systems, 12:8, (769-788), Online publication date: 1-Aug-2001.
  51. Quilleré F, Rajopadhye S and Wilde D (2019). Generation of Efficient Nested Loops from Polyhedra, International Journal of Parallel Programming, 28:5, (469-498), Online publication date: 1-Oct-2000.
  52. Brooks D, Bose P, Schuster S, Jacobson H, Kudva P, Buyuktosunoglu A, Wellman J, Zyuban V, Gupta M and Cook P (2018). Power-Aware Microarchitecture, IEEE Micro, 20:6, (26-44), Online publication date: 1-Nov-2000.
  53. Lain A, Chakrabarti D and Banerjee P (2000). Compiler and Run-Time Support for Exploiting Regularity within Irregular Applications, IEEE Transactions on Parallel and Distributed Systems, 11:2, (119-135), Online publication date: 1-Feb-2000.
  54. ACM
    Ghosh S, Martonosi M and Malik S Automated cache optimizations using CME driven diagnosis Proceedings of the 14th international conference on Supercomputing, (316-326)
  55. Leupers R Code generation for embedded processors Proceedings of the 13th international symposium on System synthesis, (173-178)
  56. Yu Y and D'Hollander E Partitioning Loops with Variable Dependence Distances Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing
  57. ACM
    Corbera F, Asenjo R and Zapata E New shape analysis techniques for automatic parallelization of C codes Proceedings of the 13th international conference on Supercomputing, (220-227)
  58. ACM
    Lim A, Cheong G and Lam M An affine partitioning algorithm to maximize parallelism and minimize communication Proceedings of the 13th international conference on Supercomputing, (228-237)
  59. ACM
    Chatterjee S, Jain V, Lebeck A, Mundhra S and Thottethodi M Nonlinear array layouts for hierarchical memory systems Proceedings of the 13th international conference on Supercomputing, (444-453)
  60. Sasakura M, Joe K, Kunieda Y and Araki K (2018). NaraView, International Journal of Parallel Programming, 27:2, (111-129), Online publication date: 1-Apr-1999.
  61. ACM
    Ghosh S, Martonosi M and Malik S (1999). Cache miss equations, ACM Transactions on Programming Languages and Systems (TOPLAS), 21:4, (703-746), Online publication date: 1-Jul-1999.
  62. ACM
    Ghosh S, Martonosi M and Malik S (2019). Precise miss analysis for program transformations with caches of arbitrary associativity, ACM SIGPLAN Notices, 33:11, (228-239), Online publication date: 1-Nov-1998.
  63. ACM
    Ghosh S, Martonosi M and Malik S Precise miss analysis for program transformations with caches of arbitrary associativity Proceedings of the eighth international conference on Architectural support for programming languages and operating systems, (228-239)
  64. ACM
    Ghosh S, Martonosi M and Malik S (1998). Precise miss analysis for program transformations with caches of arbitrary associativity, ACM SIGOPS Operating Systems Review, 32:5, (228-239), Online publication date: 1-Dec-1998.
  65. Lengauer C, Gorlatch S and Herrmann C (2019). The Static Parallelization of Loops and Recursions, The Journal of Supercomputing, 11:4, (333-353), Online publication date: 1-Dec-1997.
  66. ACM
    Ghosh S, Martonosi M and Malik S Cache miss equations Proceedings of the 11th international conference on Supercomputing, (317-324)
  67. Bringmann O and Rosenstiel W Resource sharing in hierarchical synthesis Proceedings of the 1997 IEEE/ACM international conference on Computer-aided design, (318-325)
  68. ACM
    Lim A and Lam M Maximizing parallelism and minimizing synchronization with affine transforms Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (201-214)
  69. Bik A and Wijshoff H (2019). The Use of Iteration Space Partitioning to Construct Representative Simple Sections, Journal of Parallel and Distributed Computing, 34:1, (95-110), Online publication date: 10-Apr-1996.
  70. Bik A and Wijshoff H (1996). Automatic Data Structure Selection and Transformation for Sparse Matrix Computations, IEEE Transactions on Parallel and Distributed Systems, 7:2, (109-126), Online publication date: 1-Feb-1996.
  71. ACM
    Yoshida A, Koshizuka K and Kasahara H Data-localization for Fortran macro-dataflow computation using partial static task assignment Proceedings of the 10th international conference on Supercomputing, (61-68)
  72. Tseng S, King C and Tang C Profiling Dependence Vectors for Loop Parallelization Proceedings of the 10th International Parallel Processing Symposium, (23-27)
  73. ACM
    Mueller F and Whalley D Avoiding conditional branches by code replication Proceedings of the ACM SIGPLAN 1995 conference on Programming language design and implementation, (56-66)
  74. ACM
    Mueller F and Whalley D (1995). Avoiding conditional branches by code replication, ACM SIGPLAN Notices, 30:6, (56-66), Online publication date: 1-Jun-1995.
  75. ACM
    Gu J, Li Z and Lee G Symbolic array dataflow analysis for array privatization and program parallelization Proceedings of the 1995 ACM/IEEE conference on Supercomputing, (47-es)
  76. ACM
    Samsom H, Franssen F, Catthoor F and De Man H System level verification of video and image processing specifications Proceedings of the 8th international symposium on System synthesis, (144-149)
  77. ACM
    Su E, Lain A, Ramaswamy S, Palermo D, Hodges E and Banerjee P Advanced compilation techniques in the PARADIGM compiler for distributed-memory multicomputers Proceedings of the 9th international conference on Supercomputing, (424-433)
  78. ACM
    Hummel J, Hendren L and Nicolau A A general data dependence test for dynamic, pointer-based data structures Proceedings of the ACM SIGPLAN 1994 conference on Programming language design and implementation, (218-229)
  79. ACM
    Bik A and Wijshoff H Nonzero structure analysis Proceedings of the 8th international conference on Supercomputing, (226-235)
  80. ACM
    Kolson D, Nicolau A and Dutt N Minimization of memory traffic in high-level synthesis Proceedings of the 31st annual Design Automation Conference, (149-154)
  81. ACM
    Hummel J, Hendren L and Nicolau A (2019). A general data dependence test for dynamic, pointer-based data structures, ACM SIGPLAN Notices, 29:6, (218-229), Online publication date: 1-Jun-1994.
  82. Sass R and Mutka M Enabling unimodular transformations Proceedings of the 1994 ACM/IEEE conference on Supercomputing, (753-762)
  83. ACM
    Bik A and Wijshoff H Advanced compiler optimizations for sparse computations Proceedings of the 1993 ACM/IEEE conference on Supercomputing, (430-439)
Contributors
  • University of California, Irvine

Recommendations