Taming code explosion in supercompilation
2011 (English)In: Proceedings of the 20th ACM SIGPLAN workshop on Partial evaluation and program manipulation: PEMP 11, New York: ACM Digital Library, 2011, 33-42 p.Conference paper (Refereed)
Supercompilation algorithms can perform great optimizations but sometimes suffer from the problem of code explosion. This results in huge binaries which might hurt the performance on a modern processor. We present a supercompilation algorithm that is fast enough to speculatively supercompile expressions and discard the result if it turned out bad. This allows us to supercompile large parts of the imaginary and spectral parts of nofib in a matter of seconds while keeping the binary size increase below 5%.
Place, publisher, year, edition, pages
New York: ACM Digital Library, 2011. 33-42 p.
Research subject Dependable Communication and Computation Systems
IdentifiersURN: urn:nbn:se:ltu:diva-39898DOI: 10.1145/1929501.1929507Local ID: ed11791a-f6cb-43c8-a76e-f94de65fef03ISBN: 978-1-4503-0485-6OAI: oai:DiVA.org:ltu-39898DiVA: diva2:1013417
Godkänd; 2011; 20110214 (pj)2016-10-032016-10-03Bibliographically approved