Research Article
Optimization Method of Art Design Resource Scheduling for 6G Network Environment in Colleges and Universities
Algorithm 1
Execution process of the algorithm.
| Input: real time task set t; | | Output: mapping between each task and virtual host, mapping between virtual host and physical host; | | ① RH; / Scroll through the task set t /; | | ② When the new task T1 ∈ t reaches do; | | ③ Delete the mapping relationship between waiting task and virtual host in RH, and update the ready | | time of virtual host; | | ④ Task T1 is added to RH; | | ⑤ All tasks in RH are sorted by non decreasing deadline; | | ⑥ For task T1 belongs to RH do; | | ⑦end for; | | ⑧end whilr。 |
|