An important class of scheduling algorithms is the class of dynamic priority algorithms. The most important dynamic priority algorithm is Earliest Deadline First (EDF). Earliest-deadline-first (EDF) is good for scheduling real-time tasks in or

模拟操作系统执行进程调度的小程序,就是大学生学习的操作系统页置换算法相关的东西。-Simulation of the operating system s the process of scheduling small programs, that is students the operating system page replacement algorithm related stuff.

用JAVA编写了一个最低松弛度优先算法 使其能够实现优先调度-JAVA prepared with a minimum laxity first algorithm to enable it to achieve priority scheduling

辅助Agent中心，用于Agent任务分配调度并完成PSO算法-Center of auxiliary Agent, used to assign a scheduling Agent task and complete the PSO algorithm