Question related to Discrete Markov Chains
Consider a dual core processor which operates using a cache memory.
Two processes cannot simultaneously access the cache i.e. if a process is
accessing the cache and another process tries to access it, there is a conflict and
the latter must wait for the former to finish accessing.
Assume one process is running on each of the two cores and the probabilities of
accessing the cache in any time slot are p1 and p2 respectively for the two
processes. Also, the time spent to fetch the cache contents is exactly one time
slot. You can assume that all requests made are independent of each other and no
more retrieval requests can be generated by a process if a previous request is yet
to be completed. Model the above system using a DTMC and give the transition matrix.
How do I approach this problem? I am unsure of what the states should be.
probability probability-theory markov-chains markov-process
asked Nov 27 at 7:09
puffles
669
add a comment |
Consider a dual core processor which operates using a cache memory.
Two processes cannot simultaneously access the cache i.e. if a process is
accessing the cache and another process tries to access it, there is a conflict and
the latter must wait for the former to finish accessing.
Assume one process is running on each of the two cores and the probabilities of
accessing the cache in any time slot are p1 and p2 respectively for the two
processes. Also, the time spent to fetch the cache contents is exactly one time
slot. You can assume that all requests made are independent of each other and no
more retrieval requests can be generated by a process if a previous request is yet
to be completed. Model the above system using a DTMC and give the transition matrix.
How do I approach this problem? I am unsure of what the states should be.
probability probability-theory markov-chains markov-process
asked Nov 27 at 7:09
puffles
669
Can you be more precise? When both processes aren't using the cache and then they try to use the cache at the same time, what happens? Maybe give an example of 10 or so time steps.
– Tki Deneb
Nov 27 at 14:33
@TkiDeneb Ok. Let me edit it. So far I'm only given this info.
– puffles
Nov 29 at 18:00
add a comment |
Consider a dual core processor which operates using a cache memory.
Two processes cannot simultaneously access the cache i.e. if a process is
accessing the cache and another process tries to access it, there is a conflict and
the latter must wait for the former to finish accessing.
Assume one process is running on each of the two cores and the probabilities of
accessing the cache in any time slot are p1 and p2 respectively for the two
processes. Also, the time spent to fetch the cache contents is exactly one time
slot. You can assume that all requests made are independent of each other and no
more retrieval requests can be generated by a process if a previous request is yet
to be completed. Model the above system using a DTMC and give the transition matrix.
How do I approach this problem? I am unsure of what the states should be.
probability probability-theory markov-chains markov-process
asked Nov 27 at 7:09
puffles
669
Consider a dual core processor which operates using a cache memory.
Two processes cannot simultaneously access the cache i.e. if a process is
accessing the cache and another process tries to access it, there is a conflict and
the latter must wait for the former to finish accessing.
Assume one process is running on each of the two cores and the probabilities of
accessing the cache in any time slot are p1 and p2 respectively for the two
processes. Also, the time spent to fetch the cache contents is exactly one time
slot. You can assume that all requests made are independent of each other and no
more retrieval requests can be generated by a process if a previous request is yet
to be completed. Model the above system using a DTMC and give the transition matrix.
How do I approach this problem? I am unsure of what the states should be.
probability probability-theory markov-chains markov-process
probability probability-theory markov-chains markov-process
asked Nov 27 at 7:09
puffles
669
asked Nov 27 at 7:09
puffles
669
asked Nov 27 at 7:09
puffles
669
asked Nov 27 at 7:09
puffles
669
asked Nov 27 at 7:09
puffles
669
669
Can you be more precise? When both processes aren't using the cache and then they try to use the cache at the same time, what happens? Maybe give an example of 10 or so time steps.
– Tki Deneb
Nov 27 at 14:33
@TkiDeneb Ok. Let me edit it. So far I'm only given this info.
– puffles
Nov 29 at 18:00
add a comment |
Can you be more precise? When both processes aren't using the cache and then they try to use the cache at the same time, what happens? Maybe give an example of 10 or so time steps.
– Tki Deneb
Nov 27 at 14:33
@TkiDeneb Ok. Let me edit it. So far I'm only given this info.
– puffles
Nov 29 at 18:00
Can you be more precise? When both processes aren't using the cache and then they try to use the cache at the same time, what happens? Maybe give an example of 10 or so time steps.
– Tki Deneb
Nov 27 at 14:33
Can you be more precise? When both processes aren't using the cache and then they try to use the cache at the same time, what happens? Maybe give an example of 10 or so time steps.
– Tki Deneb
Nov 27 at 14:33
@TkiDeneb Ok. Let me edit it. So far I'm only given this info.
– puffles
Nov 29 at 18:00
@TkiDeneb Ok. Let me edit it. So far I'm only given this info.
– puffles
Nov 29 at 18:00
add a comment |
active
oldest
votes
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
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
},
noCode: 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%2fmath.stackexchange.com%2fquestions%2f3015444%2fquestion-related-to-discrete-markov-chains%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 Mathematics Stack Exchange!
- 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.
Use MathJax to format equations. MathJax reference.
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%2fmath.stackexchange.com%2fquestions%2f3015444%2fquestion-related-to-discrete-markov-chains%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
Can you be more precise? When both processes aren't using the cache and then they try to use the cache at the same time, what happens? Maybe give an example of 10 or so time steps.
– Tki Deneb
Nov 27 at 14:33
@TkiDeneb Ok. Let me edit it. So far I'm only given this info.
– puffles
Nov 29 at 18:00