An Adaptive Procedure for Task Scheduling Optimization in Mobile Cloud Computing

Algorithm 1

Greedy for cost algorithm.

Input: Task graph , processor graph TG =

Output: A new task scheduling

Function greedyForCostScheduling (, TG)

  Sort task into list according to priority;

  for each

    Find the best processor which minimize the execution cost of task ;

    Assign on ;

  return a new task scheduling;