Matches in UGent Biblio for { <https://biblio.ugent.be/publication/680955#aggregation> ?p ?o. }
Showing items 1 to 32 of
32
with 100 items per page.
- aggregation classification "P1".
- aggregation creator person.
- aggregation creator person.
- aggregation date "2008".
- aggregation format "application/pdf".
- aggregation hasFormat 680955.bibtex.
- aggregation hasFormat 680955.csv.
- aggregation hasFormat 680955.dc.
- aggregation hasFormat 680955.didl.
- aggregation hasFormat 680955.doc.
- aggregation hasFormat 680955.json.
- aggregation hasFormat 680955.mets.
- aggregation hasFormat 680955.mods.
- aggregation hasFormat 680955.rdf.
- aggregation hasFormat 680955.ris.
- aggregation hasFormat 680955.txt.
- aggregation hasFormat 680955.xls.
- aggregation hasFormat 680955.yaml.
- aggregation isPartOf urn:isbn:9781595939784.
- aggregation language "eng".
- aggregation publisher "Association for Computing Machinery (ACM)".
- aggregation rights "I have transferred the copyright for this publication to the publisher".
- aggregation subject "Technology and Engineering".
- aggregation title "COLE: Compiler Optimization Level Exploration".
- aggregation abstract "Modern compilers implement a large number of optimizations which all interact in complex ways, and which all have a different impact oil code quality, compilation time, code size, energy consumption, etc. For this reason, compilers typically provide a limited number of standard optimization levels, such as -01, -02, -03 and -0s, that combine various optimizations providing a number of trade-offs between multiple objective functions (such as code quality, compilation time and code size). The construction of these optimization levels, i.e., choosing which optimizations to activate at each level, is a manual process typically done using high-level heuristics based on the compiler developer's experience. This paper proposes COLE, Compiler Optimization Level Exploration, a framework or automatically finding Pareto optimal optimization levels through multi-objective evolutionary searching. Our experimental results using GCC and the SPEC CPU benchmarks show that the automatic construction of optimization levels is feasible in practice, and in addition, yields better optimization levels than GCC's manually derived (-0s, -01, -02 and -03) optimization levels, as well as the optimization levels obtained through random sampling. We also demonstrate that COLE can be used to gain insight into the effectiveness of compiler optimizations as well as to better understand a benchmark's sensitivity to compiler optimizations.".
- aggregation authorList BK232116.
- aggregation endPage "174".
- aggregation startPage "165".
- aggregation aggregates 980838.
- aggregation isDescribedBy 680955.
- aggregation similarTo 1356058.1356080.
- aggregation similarTo LU-680955.