Adaptive optimizing compilers for the 21st century

DOI10.1023/A:1015729001611zbMath0994.68537OpenAlexW1509875415MaRDI QIDQ698478

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

zbMATH Keywords

biased random searchconfigurable compilersoptimizing compilersorder of optimization

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20) Computing methodologies and applications (68U99)

Related Items (4)

Semi-automatic composition of loop transformations for deep parallelism and memory hierarchies ⋮ A Very Simple Method to Calculate the (Positive) Largest Lyapunov Exponent Using Interval Extensions ⋮ 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

This page was built for publication: Adaptive optimizing compilers for the 21st century