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
Adapting a Constraint-Based Compiler Tool to a New VLIW Architecture
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology.
2019 (English)Independent thesis Advanced level (degree of Master (Two Years)), 20 credits / 30 HE creditsStudent thesis
Abstract [en]

he compiler tool Unison uses combinatorial optimisation to perform integrated register allocation and instruction scheduling, and is designed to be possible to adapt to different processor architectures. Black Arrow is a VLIW (very long instruction word) architecture designed for signal processing within the field of mobile communication technology. Black Arrow has structural traits that complicate the register allocation and instruction scheduling process. Most important of these is that functionally equivalent execution units within the processor are not topologically equivalent, since their distances to other execution units vary. This means that an instruction schedule must indicate not only in what cycle each instruction is to be executed, but also the execution unit that will execute it. This thesis presents and evaluates a version of Unison that has been adapted to Black Arrow. A central point in the adaptation is how the problem of assigning each Black Arrow instruction to a specific execution unit is solved through the use of Unison’s ability to choose between several alternative instructions implementing the same operation. The evaluation shows that the Black Arrow version of Unison, when optimising for minimal execution time and a variant of minimal code size, is able to find optimal solutions to the register allocation and instruction scheduling problems for several common integer algorithms, within reasonable time.

Place, publisher, year, edition, pages
2019. , p. 74
Series
IT ; 19060
National Category
Engineering and Technology
Identifiers
URN: urn:nbn:se:uu:diva-397816OAI: oai:DiVA.org:uu-397816DiVA, id: diva2:1373108
Educational program
Master Programme in Computer Science
Supervisors
Examiners
Available from: 2019-11-26 Created: 2019-11-26 Last updated: 2019-12-11Bibliographically approved

Open Access in DiVA

fulltext(582 kB)9 downloads
File information
File name FULLTEXT02.pdfFile size 582 kBChecksum SHA-512
3574d7432fbd97b56761b8398eacad8982250efe7326a031e4ff49722ed8dce7e51f3c95b05244f30504930f225eaa1423ef87b1c62b2ae4157bea0392d1ae5a
Type fulltextMimetype application/pdf

By organisation
Department of Information Technology
Engineering and Technology

Search outside of DiVA

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

urn-nbn

Altmetric score

urn-nbn
Total: 9 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