Calculating makespan among several machines
$begingroup$
I have a question about makespan calculation. I know that makespan formula is like this:
Makespan = Time of completion of last job - Starting time of the first
job
but I can't figure out how we should use it for several machines. I have a load balancing algorithm that helps in processing of several independent jobs on 3 homogeneous machines. A central coordinator gathers the load on each machine (load = number of tasks on each machine) and if there is an overloaded device, the coordinator will move some of its tasks to a less-loaded machine. By the way jobs are not consisted of small tasks and all the job should be done on a single machine. I want to calculate makespan for this algorithm.
Now in order to calculate makespan, should I calculate makespan for each machine separately
or
I should do this among all machines? I mean should I find the time of earliest job arrived to these machines and also find the time of last job among 3 machines and apply the above formula to them?
algorithms
$endgroup$
add a comment |
$begingroup$
I have a question about makespan calculation. I know that makespan formula is like this:
Makespan = Time of completion of last job - Starting time of the first
job
but I can't figure out how we should use it for several machines. I have a load balancing algorithm that helps in processing of several independent jobs on 3 homogeneous machines. A central coordinator gathers the load on each machine (load = number of tasks on each machine) and if there is an overloaded device, the coordinator will move some of its tasks to a less-loaded machine. By the way jobs are not consisted of small tasks and all the job should be done on a single machine. I want to calculate makespan for this algorithm.
Now in order to calculate makespan, should I calculate makespan for each machine separately
or
I should do this among all machines? I mean should I find the time of earliest job arrived to these machines and also find the time of last job among 3 machines and apply the above formula to them?
algorithms
$endgroup$
add a comment |
$begingroup$
I have a question about makespan calculation. I know that makespan formula is like this:
Makespan = Time of completion of last job - Starting time of the first
job
but I can't figure out how we should use it for several machines. I have a load balancing algorithm that helps in processing of several independent jobs on 3 homogeneous machines. A central coordinator gathers the load on each machine (load = number of tasks on each machine) and if there is an overloaded device, the coordinator will move some of its tasks to a less-loaded machine. By the way jobs are not consisted of small tasks and all the job should be done on a single machine. I want to calculate makespan for this algorithm.
Now in order to calculate makespan, should I calculate makespan for each machine separately
or
I should do this among all machines? I mean should I find the time of earliest job arrived to these machines and also find the time of last job among 3 machines and apply the above formula to them?
algorithms
$endgroup$
I have a question about makespan calculation. I know that makespan formula is like this:
Makespan = Time of completion of last job - Starting time of the first
job
but I can't figure out how we should use it for several machines. I have a load balancing algorithm that helps in processing of several independent jobs on 3 homogeneous machines. A central coordinator gathers the load on each machine (load = number of tasks on each machine) and if there is an overloaded device, the coordinator will move some of its tasks to a less-loaded machine. By the way jobs are not consisted of small tasks and all the job should be done on a single machine. I want to calculate makespan for this algorithm.
Now in order to calculate makespan, should I calculate makespan for each machine separately
or
I should do this among all machines? I mean should I find the time of earliest job arrived to these machines and also find the time of last job among 3 machines and apply the above formula to them?
algorithms
algorithms
edited Feb 2 at 21:42
Pablo
asked Feb 2 at 19:37


PabloPablo
33
33
add a comment |
add a comment |
0
active
oldest
votes
Your Answer
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%2f3097700%2fcalculating-makespan-among-several-machines%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
0
active
oldest
votes
0
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.
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%2f3097700%2fcalculating-makespan-among-several-machines%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