A Task Scheduling Algorithm Based on Classification Mining in Fog Computing Environment

Table 1

Summary of the notations.

var	definition
TS(k)	TS contains k task sets that needs to be scheduled
T	T=t1,t2,⋯,tn} is a set of n tasks. In this set, all of the tasks in T are independent tasks
N	N=P0, P1, …, denotes the set of processors
D	An edge ∈D denotes a link between processor Pi and Pj
b	the bandwidth between processor Pi and Pj
P	P=(N,D) denotes the topology of a fog computing network
Time	Time descripts the estimated running time of the task ti on fog node Pj
D	Scheduling transaction set contains z transactions
R	Task scheduling relationship contains the scheduling relationship between the task set T and the fog node N
STi	The start execution time of task ti
ATi	Actual arrival time of task ti
FTi	the completion time of the task ti
TST	Total task scheduling execution time is the maximum value of all tasks’ completion time
AWT	Average waiting time is TST divided by n, AWT=