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

Algorithm 1

Construct a bipartite graph.

	Input: All tasks sorted by task spawn time
	Output: Bipartite graph between tasks and threads
(1)	for All task do
(2)	ifthen
(3)	fordo
(4)	fordo
(5)	ifthen
(6)	add edge
(7)
(8)	end if
(9)	end for
(10)	end for
(11)	calc task
(12)	erase calc task in
(13)	And the length of also changes accordingly
(14)	else
(15)
(16)
(17)	end if
(18)	end for