• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations

DMCA

A technique for Compilation to Exposed Memory Hierarchy (1999)

Cached

  • Download as a PDF

Download Links

  • [www.cag.csail.mit.edu]
  • [cag.lcs.mit.edu]
  • [www.cag.lcs.mit.edu]
  • [cag.csail.mit.edu]
  • [csail.mit.edu]
  • [compiler.lcs.mit.edu]
  • [people.csail.mit.edu]
  • [www.cag.csail.mit.edu]
  • [www.cag.lcs.mit.edu]
  • [www.cabbagesandkings.net]
  • [www.cabbagesandkings.net]

  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Benjamin Eliot Greenwald
Citations:8 - 2 self
  • Summary
  • Citations
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@TECHREPORT{Greenwald99atechnique,
    author = {Benjamin Eliot Greenwald},
    title = {A technique for Compilation to Exposed Memory Hierarchy},
    institution = {},
    year = {1999}
}

Share

Facebook Twitter Reddit Bibsonomy

OpenURL

 

Abstract

requirements for the degree ofMaster of Science Abstract A tremendous amount of compiler research effort over the past ten years has been devotedto compensating for the deficiencies in hardware cache memory hierarchy. In this thesis, we propose a refocus of these energies towards compilation for memory hierarchy whichis exposed to the compiler. With software exposure of memory hierarchy, not only can replacement policies be tailored to the application, but pollution can be minimized or elim-inated, allowing programs to achieve memory reference locality with less local memory than would be needed by a cache. Additionally, prefetch latencies are fully exposed andcan be hidden by the compiler, thereby improving overall performance. We have developed a technique we call Compiler Controlled Hierarchical Reuse Man-agement (or C-CHARM), implemented using the Stanford SUIF compiler system, which gathers compile time reuse information coupled with array dependence information, rewritesloops to use a truly minimal amount of local memory, and generates the necessary explicit data movement operations for the simple, software exposed hierarchical memory system ofthe M.I.T. RAW machine. Thesis Supervisor: Saman AmarasingheTitle: Assistant Professor 2

Keyphrases

exposed memory hierarchy    local memory    prefetch latency    past ten year    memory hierarchy whichis    minimal amount    science abstract tremendous amount    thesis supervisor    necessary explicit data movement operation    array dependence information    energy towards compilation    memory hierarchy    saman amarasinghetitle    software exposure    compiler controlled hierarchical reuse man-agement    assistant professor    degree ofmaster    overall performance    compile time reuse information    memory reference locality    hardware cache memory hierarchy    compiler research effort    stanford suif compiler system   

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University