进程调度算法

Directory: OS Develop
Plat: C/C++
Size: 19KB
Downloads: 3
Upload time: 2018-05-22 12:51:25
Uploader: 刺激小王子
Description:   Whether in batch or time-sharing systems, the number of user processes is generally more than the number of processors, which will cause them to compete with each other for processors. In addition, the system process also needs to use the processor. This requires the process scheduler to allocate the processor to a certain process in the ready queue dynamically according to certain policies, so that it can be executed. The process scheduling algorithms include FIFO, priority number scheduling algorithm, time slice rotation scheduling algorithm, and FIFO and priority number scheduling algorithm (static priority). The essence of the experiment is that the operating system allocates resources according to a predetermined strategy. The purpose of process scheduling is to allocate CPU resources. The algorithm includes first come first served (FCFS) scheduling algorithm, priority number scheduling algorithm and time slice round robin scheduling algorithm.

File list:
进程调度算法.docx, 20982 , 2018-05-22

Download users:

Relate files:

Comment: Add Comment

Favorite users: