How to get number of ways of L2 cache based on the following performance graph?
I was reading this
article
And they have this graph they got programatically
They say in the article they can't use this graph to calculate the associativity of cache L2 because they need more strides.
What I don't get is why can't they simply divide 1048576 (or 524288,262144) for 32768 (16384,8192; respectively), achieving 32 ways - the same way they do to achieve the number of ways in L1 (through the following image) - where 1048576/262144 = 4 which is the number of ways of L1.
Also, not only I don't know why they can't do this, but they seem to be right, since the number of ways of L2 is not 32 but 4 (just like L1) (they have it in the article).
caching memory hardware processor associativity
asked Nov 20 at 23:53
Tiago Oliveira
193
add a comment |
I was reading this
article
And they have this graph they got programatically
They say in the article they can't use this graph to calculate the associativity of cache L2 because they need more strides.
What I don't get is why can't they simply divide 1048576 (or 524288,262144) for 32768 (16384,8192; respectively), achieving 32 ways - the same way they do to achieve the number of ways in L1 (through the following image) - where 1048576/262144 = 4 which is the number of ways of L1.
Also, not only I don't know why they can't do this, but they seem to be right, since the number of ways of L2 is not 32 but 4 (just like L1) (they have it in the article).
caching memory hardware processor associativity
asked Nov 20 at 23:53
Tiago Oliveira
193
add a comment |
I was reading this
article
And they have this graph they got programatically
They say in the article they can't use this graph to calculate the associativity of cache L2 because they need more strides.
What I don't get is why can't they simply divide 1048576 (or 524288,262144) for 32768 (16384,8192; respectively), achieving 32 ways - the same way they do to achieve the number of ways in L1 (through the following image) - where 1048576/262144 = 4 which is the number of ways of L1.
Also, not only I don't know why they can't do this, but they seem to be right, since the number of ways of L2 is not 32 but 4 (just like L1) (they have it in the article).
caching memory hardware processor associativity
asked Nov 20 at 23:53
Tiago Oliveira
193
I was reading this
article
And they have this graph they got programatically
They say in the article they can't use this graph to calculate the associativity of cache L2 because they need more strides.
What I don't get is why can't they simply divide 1048576 (or 524288,262144) for 32768 (16384,8192; respectively), achieving 32 ways - the same way they do to achieve the number of ways in L1 (through the following image) - where 1048576/262144 = 4 which is the number of ways of L1.
Also, not only I don't know why they can't do this, but they seem to be right, since the number of ways of L2 is not 32 but 4 (just like L1) (they have it in the article).
caching memory hardware processor associativity
caching memory hardware processor associativity
asked Nov 20 at 23:53
Tiago Oliveira
193
asked Nov 20 at 23:53
Tiago Oliveira
193
edited Nov 21 at 0:15
asked Nov 20 at 23:53
Tiago Oliveira
193
asked Nov 20 at 23:53
Tiago Oliveira
193
asked Nov 20 at 23:53
Tiago Oliveira
193
193
add a comment |
add a comment |
active
oldest
votes
Your Answer
StackExchange.ifUsing("editor", function () {
StackExchange.using("externalEditor", function () {
StackExchange.using("snippets", function () {
StackExchange.snippets.init();
});
});
}, "code-snippets");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "1"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f53403361%2fhow-to-get-number-of-ways-of-l2-cache-based-on-the-following-performance-graph%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
Thanks for contributing an answer to Stack Overflow!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
To learn more, see our tips on writing great answers.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f53403361%2fhow-to-get-number-of-ways-of-l2-cache-based-on-the-following-performance-graph%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
