Algorithm 1: Proposed PSO scheduler.

Input: taskMap: Set of tasks with their length in MI and     vmMap: Set of VMs with their processing capacity(MIPS)  Output: gbFMap: global best based final mapping of tasks to VMs  vmList = getVmList(vmMap)  taskList = gettaskList(taskMap)  taskCount = taskList.size()  vmCount= vmlist.size()  pos = 0, v = Randnbr(0, 1), w = 0.0, SS = 0  noParticles = 20, itr = 1, MaxItr = 200  c${}_1$ = 2, c${}_2$ = 1.49455, w${}_1$ = 0.9, w${}_2$ = 0.4  pbMap<Integer, Double> = Null  vRTMap <Integer, Double> = Null  pMap<task, Vm> = Null  prtsMap<Integer, Map<task, Vm>> = Null  pbMap = initializeParticles(taskCount, vmCount, pbMap, pMap, gbFMap, noParticles)