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
Modeling Universal Instruction Selection
KTH Royal Institute of Technology, Sweden.
RISE, Swedish ICT, SICS, Computer Systems Laboratory. KTH Royal Institute of Technology, Sweden.ORCID iD: 0000-0002-2806-7333
RISE, Swedish ICT, SICS, Computer Systems Laboratory.ORCID iD: 0000-0003-3079-8095
RISE, Swedish ICT, SICS, Computer Systems Laboratory. KTH Royal Institute of Technology, Sweden.ORCID iD: 0000-0002-6283-7004
2015 (English)In: Principles and Practice of Constraint Programming, 2015, 7, Vol. 9255, p. 609-626Conference paper, Published paper (Refereed)
Abstract [en]

Instruction selection implements a program under compilation by selecting processor instructions and has tremendous impact on the performance of the code generated by a compiler. This paper introduces a graph-based universal representation that unifiees data and control flow for both programs and processor instructions. The representation is the essential prerequisite for a constraint model for instruction selection introduced in this paper. The model is demonstrated to be expressive in that it supports many processor features that are out of reach of state-of-the-art approaches, such as advanced branching instructions, multiple register banks, and SIMD instructions. The resulting model can be solved for small to medium size input programs and sophisticated processor instructions and is competitive with LLVM in code quality. Model and representation are significant due to their expressiveness and their potential to be combined with models for other code generation tasks.

Place, publisher, year, edition, pages
2015, 7. Vol. 9255, p. 609-626
Series
Lecture Notes in Computer Science (LNCS), ISSN 0302-9743, E-ISSN 1611-3349 ; 9255
National Category
Computer and Information Sciences
Identifiers
URN: urn:nbn:se:ri:diva-24436DOI: 10.1007/978-3-319-23219-5_42ISBN: 978-3-319-23218-8 (print)ISBN: 978-3-319-23219-5 (electronic)OAI: oai:DiVA.org:ri-24436DiVA, id: diva2:1043517
Conference
21st International Conference on the Principles and Practice of Constraint Programming (CP 2015), August 31 - September 4, 2015, Cork, Ireland
Projects
UnisonAvailable from: 2016-10-31 Created: 2016-10-31 Last updated: 2019-07-11Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full text

Authority records BETA

Castaneda Lozano, RobertoCarlsson, MatsSchulte, Christian

Search in DiVA

By author/editor
Castaneda Lozano, RobertoCarlsson, MatsSchulte, Christian
By organisation
Computer Systems Laboratory
Computer and Information Sciences

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 3 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
v. 2.35.7