Efficient Delay-Aware Task Scheduling for IoT Devices in Mobile Cloud Computing

Algorithm 2

Dinic’s algorithm to find the optimal solution.

	Input: Bipartite graph between tasks and threads
	Output: initial solution
(1)	while we can use SPFA algorithm to find augmenting path do
(2)	Augmentation with DFS algorithm
(3)	Accumulate max flow, min fee
(4)	Reduce flow on the forward side, add flow on the reverse side
(5)	end while
(6)	for all edge in this graph do
(7)	if in least cost side then
(8)	cost + =
(9)	pair + =
(10)	end if
(11)	end for
(12)	Return initial solution and cost