Skip to content
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.

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

the answer of 6.37 maybe wrong #79

Open
sttttwv opened this issue Mar 31, 2022 · 2 comments
Open

the answer of 6.37 maybe wrong #79

sttttwv opened this issue Mar 31, 2022 · 2 comments

Comments

@sttttwv
Copy link

sttttwv commented Mar 31, 2022

N=64, sumB
The size of array is four times of cache's, that means every sixteen rows in the array are mapped to the same row in the cache, for example the row 0, 16, 32, 48 would be mapped to the first row of cache. After the first inner loop is completed, the data in cache is the first four numbers of lines 48 to 63. If search the number in lines 0 to 15, it will be missed. So the miss rate is 100%.

@sttttwv sttttwv changed the title 6.37答案不太对 the answer of 6.37 maybe wrong Mar 31, 2022
@sttttwv
Copy link
Author

sttttwv commented Mar 31, 2022

N=64, sumC
I think the answer is 50%.

@AE-GG
Copy link

AE-GG commented Mar 31, 2022

My answer is same to you.

Function $N=64$ $N=60$
sumA $25 %$ $25 %$
sumB $100 %$ $100 %$
sumC $50 %$ $50 %$

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

2 participants