High Utilization Cluster
-
himanshudongre 10 years ago The description of the problem states that the 1st part of the output should be (VMPLACEDBEGIN/VMPLACEDEND) and second should be (VMNOPLACEDBEGIN/VMNOPLACEDEND).However in all the examples we can only see (VMNOPLACEDBEGIN/VMNOPLACEDEND) and not (VMPLACEDBEGIN/VMPLACEDEND).e.g-In the first example I see that vm1 and vm2 were placed in host,but output does not show any (VMPLACEDBEGIN/VMPLACEDEND).It just shows that vm3 was not placed.Can someone explain this?
-
JageenShukla 10 years ago For the outout related question my guess is as below,
there are two host
host1,5,100
host2,2,50and three vms
vm1,1,50
vm2,4,20
vm3,1,80
BUT flow of starting vm are vm1,vm3,vm2
So, first vm1 will take host1 (having 5 cpu and 100 memory) so remaning resources are
host1,4,50
host2,2,50NOW, vm3 is ON but there is no host with 1 CPU and 80 memory so it will not fit
Then vm2 is ON and there is host1 with 4 cpu and 50 memory so it will ho with host1,
This way vm1 and vm2 will schedule but vm3 will not-
79man 10 years ago For three VMs:
vm1,1,50
vm2,4,20
vm3,1,80
and 2 hosts:
host1,5,100
host2,2,50
I think all three can be placed, as shown below:-
- vm1 ON : place it on host2
remaining resources are:-
host1,5,100
host2,1,0
- vm3 ON : place it on host 1
remaining resources are:-
host1,4,20
host2,1,0
- vm2 ON : place it on host 1
remaining resources are:-
host1,0,0
host2,1,0
Isn't this right? What am I missing?
I mean is there a rule that one host can only run one VM at a time?-
DeadCereal 10 years ago You are correct, however for Problem 1, VMotion is set to off. So Each VM will be placed into the first Host that can fit it. VM1 will go on host 1, VM 3 won't be able to find anywhere to fit so it won't be placed, then VM 2 will be placed on host 2. For the other 2 scenarios, VMotion is turned on, so the cluster should load balance and all VMs should be placed.
- vm1 ON : place it on host2
-
-
mickeyvn 10 years ago Just print out the unplaced VMs.
-
hacker_9kk2z7t1 10 years ago Well this is not clear from the problem statement: "The first part of the file (VMPLACEDBEGIN/VMPLACEDEND) will be the name of the VM and the host it was placed on. The second part of the file (VMNOPLACEDBEGIN/VMNOPLACEDEND) will be the names of the VM's that you could not place."
There is a mention of 2 parts of the output file, while all the samples seem to mention only the second part.
The wording got me very confused.
-
-
-
kostadis 10 years ago FOLKS it was FUN! Signing off! Ask questions And I will respond!
-
-
kostadis 10 years ago Hey folks,
Just wanted to tell u all that I got injured and will do live solution next week. I am doing fine but can't really code for a week :(
Sorry for the delay but life happened. i will try to answer questions
You can find out more:
midlifecrisistriathlete.kostadis.org
if you want read my technical blog check out
wrongtool.kostadis.com
-
mickeyvn 10 years ago Get well soon and post more challenges when you come back :)
-
ashish_nautiyal 10 years ago Hope you get well soon :)
-
Rashmi_Margani 10 years ago Get well soon sir.................
-
-
sitangud 10 years ago could you give us an overview of more complex load balancing algorithms used in practice :)?
-
kostadis 10 years ago Turns out that they all pretty simple :-) The trick is how much state do you have to look at before making a decision.
The problem with my solution is that I basically recomputed everything every time. A more realistic algorithm implementation would try to avoid that that.
-
kostadis 10 years ago Also it depends on how frequently you want to run. The more frequently you need to run, the simpler the algorithm. The more complex the less frequently.
Things you would consider to add complexity is history and prediction.
-
kostadis 10 years ago What makes VMWare' DRS really complex is that I assumed all CPU the same, and no rules about where VM's get placed.
-
-
-
Sort 38 Discussions, By:
Please Log In in order to post a comment