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
Store prefetch policies: Analysis and new proposals
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology.
2018 (English)Independent thesis Advanced level (professional degree), 20 credits / 30 HE creditsStudent thesis
Abstract [en]

This thesis is focusing on how to gain performance when executing programs on a CPU. More specifically the store instructions are studied. These instructions often cause huge delays while waiting on write per- mission for a particular data block. If an out-of-order (OoO) CPU fills up the entire store buffer with stores waiting for write permission, the CPU has to stall, and cycles are going to be wasted. To over overcome this issue, the idea is to use predictors to try to predict which write per- missions that are needed in the future and brought it to the L1 cache in advance. This method is similar to that of the branch predictor where the CPU is fed with instructions to start working in advance based on the prediction of whether or not a branch is to be taken. Naturally, you would want the prediction to be correct, but even if we assume that the predictor always grants needed write permission ahead of time there might still be a problem, and that is when to grant store permission for the data block. Too late and you still need to wait since the need for it occurs before it is in place. Too early and it is going to be evicted from the L1 cache due to space issues, and there are going to be an idle time bring it back in when the need occurs. Furthermore, it is also a waste of energy since we brought in something to be evicted before use. The question I aim to answer with this master thesis is when to prefetch data permission to gain optimal performance.

Place, publisher, year, edition, pages
2018. , p. 61
Series
UPTEC IT, ISSN 1401-5749 ; 18022
National Category
Engineering and Technology
Identifiers
URN: urn:nbn:se:uu:diva-375209OAI: oai:DiVA.org:uu-375209DiVA, id: diva2:1283204
Educational program
Master of Science Programme in Information Technology Engineering
Supervisors
Examiners
Available from: 2019-01-28 Created: 2019-01-28 Last updated: 2019-01-28Bibliographically approved

Open Access in DiVA

fulltext(1067 kB)20 downloads
File information
File name FULLTEXT01.pdfFile size 1067 kBChecksum SHA-512
0bc6f8b2bca77d308cad4ea731a419032ad569461203a90a622fc8176f89e409838b5ef94065ac147fdc2d0f4823be870857a351a7ce7f8df3e604452034dad9
Type fulltextMimetype application/pdf

By organisation
Department of Information Technology
Engineering and Technology

Search outside of DiVA

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