基于动态优先权的进程调度算法的模拟实现

本文介绍了利用C语言模拟实现动态优先权的进程调度算法的方法,并给出相应的核心代码程序。在设计中,充分考虑了进程在执行过程中可能发生的多种情况,更好的体现了进程的就绪态、执行态、阻塞态三者之间的关系以及相互的转换。程序的运行过程清晰的体现了动态优先权的调度算法的执行过程,有利于加深对算法的理解和掌握。

Simulation and Implementation Based on Dynamic Priority Scheduling Algorithms

The thesis describes the methed of simulation and implementation based on dynamic priority scheduling algorithms by C-language, and gives the kenal programs. In the design, giving may occur in a variety of conditions for the process implementation, which is better reflected the relationship between ready state, implementation state, and blocking state, and their mutual conversions. Procedures for the operation of the process clearly reflects dynamic priority scheduling algorithms, which can deepening the understanding and grasp of the algorithm.