Intelligent Scheduling Method Supporting Stadium Sharing

Algorithm 1

Joint scheduling of service caching and task.

	Input: the number of iterations iN
	Output: amn, ESfmn, emn
(01)	Initialization: logarithmic barrier lb = 0.01
(02)	Initialization: amn = 0,
(03)	for edge server n ∈ Q, do
(04)	for service m ∈ P, do
(05)	compute service cache priority index ;
(06)	end for
(07)	Rank cpin in reverse order
(08)	Resource surplus rs = C
(09)	for service m ∈ service cache order com, do
(10)	if rs ≥ Thm, then
(11)	amn = 1
(12)	rs = rs − Thm
(13)	end if
(14)	end for
(15)	end for
(16)
(17)	for iN = 1 ⟶ iN, do
(18)
(19)
(20)	end for