Simulation the Min-Min Algortithm for Cloud Computing

(1) for all tasks t, in meta-task Mv (in an arbitrary order) (2) for all machines mj (in a fixed arbitrary order) 1J (4) do until all tasks in Mv are mapped (5)for each task in Mv find the earliest completion time and the machine that obtains it completion time earliest completion time (6)find the task tk with the minimum earliest (7)assign task t to the machine mi that gives the (9)delete task tk from Mv (10)update r (11)update cu for all i (12) enddo FIG. 1. The Min-min heuristic. (1) for all tasks t, in meta-task Mv (in an arbitrary order) (2) for all machines mj (in a fixed arbitrary order) 1J (4) do until all tasks in Mv are mapped (5)for each task in Mv find the earliest completion time and the machine that obtains it completion time earliest completion time (6)find the task tk with the minimum earliest (7)assign task t to the machine mi that gives the (9)delete task tk from Mv (10)update r (11)update cu for all i (12) enddo FIG. 1. The Min-min heuristic