ETD system

Electronic theses and dissertations repository

 

Tesi etd-09252019-191627


Thesis type
Tesi di laurea magistrale
Author
FOTI, DAVIDE
URN
etd-09252019-191627
Title
Study of worst-case cache access times under predictable execution models
Struttura
INGEGNERIA DELL'INFORMAZIONE
Corso di studi
COMPUTER ENGINEERING
Commissione
relatore Stea, Giovanni
correlatore Virdis, Antonio
Parole chiave
  • networkcalculus
  • memoria
  • memory
  • cache
  • accesso
  • access
  • predictable
  • predicibile
  • esecuzione
  • wcet
  • worstcase
Data inizio appello
14/10/2019;
Consultabilità
secretata d'ufficio
Data di rilascio
14/10/2022
Riassunto analitico
This work aims to analyse the most commonly cache memory structures in order to find an analytical model able to predict the worst-case access time, under specific hypothesis. The proposed model is made by using the Network Calculus theory, where the cache hardware block and the memory accesses are treated as a normal network router and packets, respectively. Since the memory access ordering is application dependent, the framework called AMBA traffic profile has been used, which defines access patterns through a set of parameters (i.e., address base, address range). A cache simulator have been developed, which provides, given a specific traffic profile, the cache performances. Through the information given by the simulator and the cache memory model, an estimation of the worst-case access time is computed. Different classes of applications, defined by its AMBA profiles, have been studied.
File