Digitala Vetenskapliga Arkivet

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
Evaluating Mixed-Precision Tuning on a Per-Function Basis
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology.
2025 (English)Independent thesis Advanced level (degree of Master (Two Years)), 20 credits / 30 HE creditsStudent thesis
Abstract [en]

Mixed-precision tuning is the process of tuning the precision of variables in programs to enhance performance. This is done while adhering to some kind of error threshold, to maintain accuracy. Most tools currently, typically work on the granularity of variables, meaning that for each program, every variable is considered for a change in precision. These tools do this automatically by utilizing search techniques to optimize the search, since a brute-force approach is not viable. Even then, these tools take a long time to tune programs due to the amount of configurations. This thesis introduces mixed-precision tuning at a per-function granularity, to analyze how effective it is compared to per-variable granularity tuning. This is important since a program typically has significantly fewer functions than variables, thus naturally reduce the search space. To implement this, an LLVM pass was developed that downcasts specified functions, including all variables and operations inside of the function, except for arrays. Automating this process involved writing a Python script that supplied configurations to the LLVM pass. We found that the amount of time it takes to finish a full tuning pipeline is around 65-78 times faster, when running each configuration 5 times. However, the performance gain varied significantly, ranging from a maximum of 22.7% improvement to a 35.08% slowdown. These findings suggest that mixed-precision tuning at a per-function granularity shows promise, but future work is needed — particularly in handling arrays — since these introduce a lot of casting overhead that can negate performance gains.

Place, publisher, year, edition, pages
2025. , p. 50
Series
IT ; mDV 25 017
National Category
Natural Sciences Computer Sciences
Identifiers
URN: urn:nbn:se:uu:diva-563019OAI: oai:DiVA.org:uu-563019DiVA, id: diva2:1980810
Educational program
Master Programme in Computer Science
Supervisors
Examiners
Available from: 2025-07-03 Created: 2025-07-02 Last updated: 2025-07-03Bibliographically approved

Open Access in DiVA

fulltext(789 kB)113 downloads
File information
File name FULLTEXT01.pdfFile size 789 kBChecksum SHA-512
00c7aaaf5f4caeddc7db050bb53a8c81e960c1355134001c74ee105809d01e2e4ee6b9351b6e6e6d5330fab76cd73373f578c3fbb5c95967da8ce0f621872443
Type fulltextMimetype application/pdf

By organisation
Department of Information Technology
Natural SciencesComputer Sciences

Search outside of DiVA

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