Adaptive optimizing compilers for the 21st century
From MaRDI portal
Publication:698478
DOI10.1023/A:1015729001611zbMATH Open0994.68537OpenAlexW1509875415MaRDI QIDQ698478FDOQ698478
Devika Subramanian, Linda Torczon, Keith D. Cooper
Publication date: 18 September 2002
Published in: The Journal of Supercomputing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1015729001611
Recommendations
Cited In (15)
- Fuzzy configuration of matching runtime implementation strategies
- Assembly Code Analysis Using Stochastic Process Algebra
- Semi-automatic composition of loop transformations for deep parallelism and memory hierarchies
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- ViDoC - Visual Design of Optimizing Compilers
- A methodology pruning the search space of six compiler transformations by addressing them together as one problem and by exploiting the hardware architecture details
- A methodology for speeding up loop kernels by exploiting the software information and the memory architecture
- A Very Simple Method to Calculate the (Positive) Largest Lyapunov Exponent Using Interval Extensions
- Title not available (Why is that?)
This page was built for publication: Adaptive optimizing compilers for the 21st century
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q698478)