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, School of Information and Communication Technology (ICT), Software and Computer systems, SCS.ORCID iD: 0000-0001-6794-6413
Swedish Institute of Computer Science.
Swedish Institute of Computer Science.
KTH, School of Information and Communication Technology (ICT), Software and Computer systems, SCS.ORCID iD: 0000-0002-6283-7004
2015 (English)In: Principles and Practice of Constraint Programming: 21st International Conference, CP 2015, Cork, Ireland, August 31 -- September 4, 2015, Proceedings / [ed] Gilles Pesant, Springer, 2015, Vol. 9255, 609-626 p.Conference 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 unifies 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
Springer, 2015. Vol. 9255, 609-626 p.
Series
Lecture Notes in Computer Science, 9255
Keyword [en]
instruction selection, global code motion, code generation, optimizing compilers, program representations, modern processor architectures
National Category
Computer Systems
Research subject
Computer Science
Identifiers
URN: urn:nbn:se:kth:diva-169684DOI: 10.1007/978-3-319-23219-5_42Scopus ID: 2-s2.0-84944558675ISBN: 978-3-319-23219-5 (print)OAI: oai:DiVA.org:kth-169684DiVA: diva2:824504
Conference
21st International Conference on Principles and Practice of Constraint Programming,August 31-September 4, 2015, Ireland
Funder
Swedish Research Council, VR 621-2011-6229
Note

QC 20150828

Available from: 2015-06-22 Created: 2015-06-22 Last updated: 2015-08-28Bibliographically approved

Open Access in DiVA

fulltext(364 kB)158 downloads
File information
File name FULLTEXT01.pdfFile size 364 kBChecksum SHA-512
3096e02a2139eedf6439495fefb97a3cc59bb7d536b9f2ee3e2278a62cf4e63bcf3f630cde330f357de6f9c4876ca85b9b5ab5d2c59839e250c2384dc4ed461d
Type fulltextMimetype application/pdf

Other links

Publisher's full textScopusConference websiteThe final publication is available at www.springerlink.com

Authority records BETA

Hjort Blindell, GabrielSchulte, Christian

Search in DiVA

By author/editor
Hjort Blindell, GabrielSchulte, Christian
By organisation
Software and Computer systems, SCS
Computer Systems

Search outside of DiVA

GoogleGoogle Scholar
Total: 158 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: 324 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