PACAM: A Pairwise-Allocated Strategy and Capability Average Matrix-Based Task Scheduling Approach for Edge Computing

Algorithm 2

identify_device (D, k, s_i).

	Input: The set of device D; the maximal consecutive services k; the service
	Output: The set of available devices available_D)
(1)	for each service () do
(2)	for each device in do
(3)	() get tasks of the previous services for ;
(4)	if () contains a Rest-status then
(5)	put into avaiable_D;
(6)	for each service () do
(7)	for each device do
(8)	put into avaiable_D;
(9)	Return available_D