• Login
    View Item 
    •   Home
    • UA Faculty Research
    • UA Faculty Publications
    • View Item
    •   Home
    • UA Faculty Research
    • UA Faculty Publications
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Browse

    All of UA Campus RepositoryCommunitiesTitleAuthorsIssue DateSubmit DateSubjectsPublisherJournalThis CollectionTitleAuthorsIssue DateSubmit DateSubjectsPublisherJournal

    My Account

    LoginRegister

    About

    AboutUA Faculty PublicationsUA DissertationsUA Master's ThesesUA Honors ThesesUA PressUA YearbooksUA CatalogsUA Libraries

    Statistics

    Most Popular ItemsStatistics by CountryMost Popular Authors

    An approach for code generation in the Sparse Polyhedral Framework

    • CSV
    • RefMan
    • EndNote
    • BibTex
    • RefWorks
    Thumbnail
    Name:
    Strout-PARCO-March-2016.pdf
    Size:
    979.8Kb
    Format:
    PDF
    Description:
    Final Accepted Manuscript
    Download
    Author
    Strout, Michelle Mills
    LaMielle, Alan cc
    Carter, Larry
    Ferrante, Jeanne
    Kreaseck, Barbara
    Olschanowsky, Catherine
    Affiliation
    Computer Science Department, University of Arizona
    Issue Date
    2016-04
    Keywords
    Inspector/executor strategies
    Runtime reordering transformations
    Sparse Polyhedral Framework
    
    Metadata
    Show full item record
    Publisher
    ELSEVIER SCIENCE BV
    Citation
    An approach for code generation in the Sparse Polyhedral Framework 2016, 53:32 Parallel Computing
    Journal
    Parallel Computing
    Rights
    Copyright © 2016 Elsevier B.V. All rights reserved.
    Collection Information
    This item from the UA Faculty Publications collection is made available by the University of Arizona with support from the University of Arizona Libraries. If you have questions, please contact us at repository@u.library.arizona.edu.
    Abstract
    Applications that manipulate sparse data structures contain memory reference patterns that are unknown at compile time due to indirect accesses such as A[B[i]]. To exploit parallelism and improve locality in such applications, prior work has developed a number of Run-Time Reordering Transformations (RTRTs). This paper presents the Sparse Polyhedral Framework (SPF) for specifying RTRTs and compositions thereof and algorithms for automatically generating efficient inspector and executor code to implement such transformations. Experimental results indicate that the performance of automatically generated inspectors and executors competes with the performance of hand-written ones when further optimization is done.
    Note
    Available online 4 March 2016. 24 month embargo.
    ISSN
    0167-8191
    DOI
    10.1016/j.parco.2016.02.004
    Version
    Final accepted manuscript
    Sponsors
    We thank Jon Roelofs for his implementation of the IEGenCC tool, which converts C programs into the specification format IEGen expects as input. We thank Christopher Krieger, Andrew Stone, Tomofumi Yuki, and anonymous reviewers for their careful reading and suggestions. This work was sponsored by NSF CAREER Grant CCF-0746693, DOE Early Career Grant DE-SC3956, the CSCAPES Institute DOE Grant 7F-00323, and the CACHE project DOE Grant DE-SC04030.
    Additional Links
    http://linkinghub.elsevier.com/retrieve/pii/S0167819116000557
    ae974a485f413a2113503eed53cd6c53
    10.1016/j.parco.2016.02.004
    Scopus Count
    Collections
    UA Faculty Publications

    entitlement

     
    The University of Arizona Libraries | 1510 E. University Blvd. | Tucson, AZ 85721-0055
    Tel 520-621-6442 | repository@u.library.arizona.edu
    DSpace software copyright © 2002-2017  DuraSpace
    Quick Guide | Contact Us | Send Feedback
    Open Repository is a service operated by 
    Atmire NV
     

    Export search results

    The export option will allow you to export the current search results of the entered query to a file. Different formats are available for download. To export the items, click on the button corresponding with the preferred download format.

    By default, clicking on the export buttons will result in a download of the allowed maximum amount of items.

    To select a subset of the search results, click "Selective Export" button and make a selection of the items you want to export. The amount of items that can be exported at once is similarly restricted as the full export.

    After making a selection, click one of the export format buttons. The amount of items that will be exported is indicated in the bubble next to export format.