Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Taming code explosion in supercompilation
Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Embedded Internet Systems Lab.
Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
2011 (English)In: Proceedings of the 20th ACM SIGPLAN workshop on Partial evaluation and program manipulation: PEMP 11, New York: ACM Digital Library, 2011, p. 33-42Conference paper, Published paper (Refereed)
Abstract [en]

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. p. 33-42
National Category
Computer Sciences
Research subject
Dependable Communication and Computation Systems
Identifiers
URN: urn:nbn:se:ltu:diva-39898DOI: 10.1145/1929501.1929507Scopus ID: 2-s2.0-79952127127Local ID: ed11791a-f6cb-43c8-a76e-f94de65fef03ISBN: 978-1-4503-0485-6 (print)OAI: oai:DiVA.org:ltu-39898DiVA, id: diva2:1013417
Projects
ESIS
Note
Godkänd; 2011; 20110214 (pj)Available from: 2016-10-03 Created: 2016-10-03 Last updated: 2023-09-06Bibliographically approved

Open Access in DiVA

fulltext(202 kB)520 downloads
File information
File name FULLTEXT01.pdfFile size 202 kBChecksum SHA-512
39de248bf10debe42d240b2c52cb9ad6c451a6448fc599fd0069bac2a79959b8a7b7c53ccdb2ce44e202dcd511b498e2950c10048af82a7f8253c954391b4534
Type fulltextMimetype application/pdf

Other links

Publisher's full textScopus

Authority records

Jonsson, PeterNordlander, Johan

Search in DiVA

By author/editor
Jonsson, PeterNordlander, Johan
By organisation
Embedded Internet Systems LabComputer Science
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar
Total: 520 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 128 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf