A Unified Algorithm for Virtual Desktops Placement in Distributed Cloud Computing

Algorithm 1

Shortest delay VM placement algorithm (SD).

Input: : numbers of BCs

  : feasible DC set for BC and

  : VMs set for BC

Output: VM placement solution encoding

(1) for    do

(2)  Sort DCs in according to . Closer DC is selected

   with higher probability and denote the sorted sequence

   as

(3)  for    do

(4)   Randomly select non-assigned VM from and put

    it into a random non-full PM in until is full

    or reach the upper limit

(5)   ∖VMs assigned to )

(6)   if    then

(7)    break

(8)   end if

(9)  end for

(10) end for

(11) encoding the solution as according to Section 4.1