Check out the new USENIX Web site. next up previous
Next: 5.6 Engineering a VMD Up: 5.5 Connected components Previous: Output: Algorithm:
Each connected component ($VDC$, $VDC'$, $VDC''$, etc) represents one particular assignment of $vm_{i} \in
VM$ to $vd_{i} \in VD$, i.e. a particular $vmap$ meeting all the $vmap$ requirements
So from amongst all such possible connected components (assignments) we choose that which has the least cost associated with it, i.e. $\sum_{\forall
vd_i,vd_j \in VDC'} cost(vde_{i,j})$ is minimum over the set of all possible connected components
This is equivalent to enumerating all the possible connected components of size $\mid$ VM $\mid$ and then choosing the one which has the least cost associated with it.

Ananth Sundararaj 2004-02-17