Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • 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
Complete and Practical Universal Instruction Selection
KTH, School of Information and Communication Technology (ICT), Software and Computer systems, SCS. SICS RISE.ORCID iD: 0000-0001-6794-6413
RISE SICS.ORCID iD: 0000-0003-3079-8095
KTH, School of Information and Communication Technology (ICT), Software and Computer systems, SCS. RISE SICS.ORCID iD: 0000-0002-2806-7333
KTH, School of Information and Communication Technology (ICT), Software and Computer systems, SCS. RISE SICS.ORCID iD: 0000-0002-6283-7004
2017 (English)In: ACM Transactions on Embedded Computing Systems, ISSN 1539-9087, E-ISSN 1558-3465Article in journal (Refereed) Published
Abstract [en]

In code generation, instruction selection chooses processor instructions to implement a program under compilation where code quality crucially depends on the choice of instructions. Using methods from combinatorial optimization, this paper proposes an expressive model that integrates global instruction selection with global code motion.The model introduces (1) handling of memory computations and function calls, (2) a method for inserting additional jump instructions where necessary, (3) a dependency-based technique to ensure correct combinations of instructions, (4) value reuse to improve code quality, and (5) an objective function that reduces compilation time and increases scalability by exploiting bounding techniques. The approach is demonstrated to be complete and practical, competitive with LLVM, and potentially optimal (w.r.t. the model) for medium-sized functions. The results show that combinatorial optimization for instruction selection is well-suited to exploit the potential of modern processors in embedded systems.

Place, publisher, year, edition, pages
ACM Press, 2017.
Keywords [en]
instruction selection, code generation, constraint programming, combinatorial optimization
National Category
Computer Systems Embedded Systems
Research subject
Computer Science
Identifiers
URN: urn:nbn:se:kth:diva-213968DOI: 10.1145/3126528ISI: 000414353800002Scopus ID: 2-s2.0-85030692980OAI: oai:DiVA.org:kth-213968DiVA, id: diva2:1139368
Conference
International Conferences on Compilers, Architectures and Synthesis for Embedded Systems
Funder
Swedish Research Council, 621-2011-6229
Note

QC 20170908

Available from: 2017-09-07 Created: 2017-09-07 Last updated: 2018-01-03Bibliographically approved

Open Access in DiVA

fulltext(1636 kB)144 downloads
File information
File name FULLTEXT01.pdfFile size 1636 kBChecksum SHA-512
62eeafe94844203de524576d9516c7172f5d3e571931f7f8bb7272f4e54bded4806576e264c32b43fb7980f2b3d773f83936915ea6075fb5e8936391d6e0e99b
Type fulltextMimetype application/pdf

Other links

Publisher's full textScopus

Authority records BETA

Hjort Blindell, GabrielCastañeda Lozano, RobertoSchulte, Christian

Search in DiVA

By author/editor
Hjort Blindell, GabrielCarlsson, MatsCastañeda Lozano, RobertoSchulte, Christian
By organisation
Software and Computer systems, SCS
In the same journal
ACM Transactions on Embedded Computing Systems
Computer SystemsEmbedded Systems

Search outside of DiVA

GoogleGoogle Scholar
Total: 144 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
urn-nbn

Altmetric score

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

Direct link
Cite
Citation style
  • apa
  • harvard1
  • 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