Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.5555/528717.796653guideproceedingsArticle/Chapter ViewAbstractPublication PagesConference Proceedingsacm-pubtype
Article

Code generation for multiple mappings

Published: 06 February 1995 Publication History
  • Get Citation Alerts
  • Abstract

    There has been a great amount of recent work toward unifying iteration reordering transformations. Many of these approaches represent transformations as affine mappings from the original iteration space to a new iteration space. These approaches show a great deal of promise, but they all rely on the ability to generate code that iterates over the points in these new iteration spaces in the appropriate order. This problem has been fairly well-studied in the case where all statements use the same mapping. We have developed an algorithm for the less well-studied case where each statement uses a potentially different mapping. Unlike many other approaches, our algorithm can also generate code from mappings corresponding to loop blocking. We address the important trade-off between reducing control overhead and duplicating code.

    Cited By

    View all
    • (2016)The Pluto+ AlgorithmACM Transactions on Programming Languages and Systems10.1145/289638938:3(1-32)Online publication date: 8-Apr-2016
    • (2015)Polyhedral AST Generation Is More Than Scanning PolyhedraACM Transactions on Programming Languages and Systems10.1145/274301637:4(1-50)Online publication date: 15-Jul-2015
    • (2013)Improving polyhedral code generation for high-level synthesisProceedings of the Ninth IEEE/ACM/IFIP International Conference on Hardware/Software Codesign and System Synthesis10.5555/2555692.2555707(1-10)Online publication date: 29-Sep-2013
    • Show More Cited By

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image Guide Proceedings
    FRONTIERS '95: Proceedings of the Fifth Symposium on the Frontiers of Massively Parallel Computation (Frontiers'95)
    February 1995
    ISBN:0818669659

    Publisher

    IEEE Computer Society

    United States

    Publication History

    Published: 06 February 1995

    Author Tags

    1. code generation
    2. control overhead
    3. iteration reordering transformations
    4. loop blocking
    5. multiple mappings
    6. optimisation
    7. optimising compilers
    8. program compilers

    Qualifiers

    • Article

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)0
    • Downloads (Last 6 weeks)0
    Reflects downloads up to 10 Aug 2024

    Other Metrics

    Citations

    Cited By

    View all
    • (2016)The Pluto+ AlgorithmACM Transactions on Programming Languages and Systems10.1145/289638938:3(1-32)Online publication date: 8-Apr-2016
    • (2015)Polyhedral AST Generation Is More Than Scanning PolyhedraACM Transactions on Programming Languages and Systems10.1145/274301637:4(1-50)Online publication date: 15-Jul-2015
    • (2013)Improving polyhedral code generation for high-level synthesisProceedings of the Ninth IEEE/ACM/IFIP International Conference on Hardware/Software Codesign and System Synthesis10.5555/2555692.2555707(1-10)Online publication date: 29-Sep-2013
    • (2012)Polyhedra scanning revisitedACM SIGPLAN Notices10.1145/2345156.225412347:6(499-508)Online publication date: 11-Jun-2012
    • (2012)Polyhedra scanning revisitedProceedings of the 33rd ACM SIGPLAN Conference on Programming Language Design and Implementation10.1145/2254064.2254123(499-508)Online publication date: 11-Jun-2012
    • (2012)Parameterized loop tilingACM Transactions on Programming Languages and Systems10.1145/2160910.216091234:1(1-41)Online publication date: 4-May-2012
    • (2009)Efficient tiled loop generationProceedings of the 22nd international conference on Languages and Compilers for Parallel Computing10.1007/978-3-642-13374-9_20(293-307)Online publication date: 8-Oct-2009
    • (2009)Synchronization-Free automatic parallelizationProceedings of the 22nd international conference on Languages and Compilers for Parallel Computing10.1007/978-3-642-13374-9_16(233-246)Online publication date: 8-Oct-2009
    • (2008)A domain specific interconnect for reconfigurable computingACM SIGPLAN Notices10.1145/1379023.137566943:7(79-88)Online publication date: 12-Jun-2008
    • (2008)A practical automatic polyhedral parallelizer and locality optimizerACM SIGPLAN Notices10.1145/1379022.137559543:6(101-113)Online publication date: 7-Jun-2008
    • Show More Cited By

    View Options

    View options

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media