An Improved Task Scheduling Algorithm for Intelligent Control in Tiny Mechanical System

Algorithm 2

(1) Input: 𝑛,𝛽,𝑇_𝑖,𝐸_𝑖,𝜑_𝑖(𝑖=1,2,…,𝑛);

(2) Initializing 𝜉_𝑖=0; 𝑝𝑟𝑒𝑒_𝑖(𝛽)=0,(𝑖=1,2,…,𝑛);𝑝𝑟𝑒𝑒(𝛽)=0;

(3) Constructing TID = {𝑡𝑖𝑑₁,𝑡𝑖𝑑₂,…,𝑡𝑖𝑑_𝑁} and Set 𝑆(𝑟)={𝑟₁,𝑟₂,…,𝑟_𝑁}; // N

   ≤∑^𝑛_𝑖=1𝜏−𝜑_𝑖𝑇_𝑖+𝑛

(4) for   𝑘=1 to 𝑁;

(5) Detecting release time of all tasks;

(6) 𝑡=𝑟_𝑘; 𝑚=𝑡𝑖𝑑_𝑘;

(7) if   𝑠_𝑚(𝑡)−𝑠_𝑚(𝜉_𝑚)≤0  then

(8) Ending this loop, and detecting next release time;

(9) endif

(10) if   𝑠_𝑛(𝑡)−𝑠_𝑛(𝜉_𝑛)>0 then

(11) Refreshing 𝜉_𝑖=𝑡(𝑖=𝑚,𝑚+1,…,𝑛);

(12) Ending this loop, and detecting next release time;

(13) endif

(14) System finds the index 𝜆=𝑖 in 𝑚+1,𝑚+2,…,𝑛, and makes 𝑠_𝑖−1(𝑡)−𝑠_𝑖−1(𝜉_𝑖−1)>0 and

    𝑠_𝑖(𝑡)−𝑠_𝑖(𝜉_𝑖)≤0;

(15) if 𝑠_𝜆(𝑡)−𝑠_𝜆(𝜉_𝜆)≠0  then

(16) 𝑝𝑟𝑒𝑒_𝜆(𝛽)=𝑝𝑟𝑒𝑒_𝜆(𝛽)+1;

(17) endif

(18) Refreshing 𝜉_𝑖=𝑡(𝑖=𝑚,𝑚+1,…,𝜆−1);

(19) endfor

(20) Output: 𝑝𝑟𝑒𝑒_𝑖(𝛽),(𝑖=1,2,…,𝑛); the amount of task 𝑖 is preempted

    𝑝𝑟𝑒𝑒(𝛽)=∑^𝑛_𝑖=1𝑝𝑟𝑒𝑒_𝑖(𝛽); the amount of all preemptions