Skip to content

Merge #3

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
nicolasying wants to merge 1 commit into
base: master
Choose a base branch
from
Open

Merge #3

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
5 changes: 3 additions & 2 deletions report.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -289,8 +289,9 @@ The program actually access the data:

in total 8+1+2+2 = 13.

Practically, a cache that is large enough to contain 8 integers (32 cache size units) would provide a promising hit rate as they are the most frequently used data.
In addition, if a data cache is large enough to cache all the data accessed, data miss would only be generated the first time it is accessed.
Practically, a cache that is large enough to contain 8 integers (32 cache size units) would provide a promising hit rate as they are the most frequently used data. And we can observe that when the cache provide enough space to store 16 > 13 integers (cache size = 128), we can see that the hit rate is nearly 100%.

In addition, if a data cache is large enough to cache all the data accessed, data miss would only be generated the first time it is accessed, namely compulsory miss. On the contrary, if the cache size is not adequate, the data miss consist mainly of the capacity miss.

## Final question

Expand Down
Binary file modified report.pdf
View file
Open in desktop
Binary file not shown.