Research Article

Optimized Speculative Execution to Improve Performance of MapReduce Jobs on Virtualized Computing Environment

Algorithm 2

Backing up the stragglers with a global optimization.
Input: the set SL of slots to be free in the next interval; the queue of tasks to be assigned.
Output: assignment plan AP.
Begin
While is not empty do
Begin
;
 For each slot in SL do
 Begin
  If sloti.capacity >= Q.element[i].demand then
   PID = GetPID(Q.element[i], slotj.Background);
   If min > PID then
   begin
    min = PID;
    AP_candidate[i]=slotj;
   end
 End
 If min < threshold then
  AP[i] = AP_candidate[i];
end
Return AP;
 End