Description: Analog achieve round-robin scheduling algorithm, as follows:
Setting process member: arrival time, service time,, process status process name, process (W wait, R run, F completed), inter-process link pointer
Initialization process: process name entered by the user, the service time to initialize, and the status of the initialization process for the W.
Display Function: Before scheduling process, scheduling and dispatch after the display.
Sort function: The process according to the ready state into the ready queue time of ordering, the new arrival will be priority should be given to the process just d enters the tail of the ready queue. Note Consider Time
Scheduling function: Every first team the ready queue scheduling process s a superior, state changes. And, after the implementation of a time slice, service time, state changes. When the service time is 0, the state changes to F.
Delete function: The revocation status of the F s.
To Search:
File list (Check if you may need any files):
01\01.cpp
..\01.dsp
..\01.dsw
..\01.ncb
..\01.opt
..\01.plg
..\Debug\01.exe
..\.....\01.ilk
..\.....\01.obj
..\.....\01.pch
..\.....\01.pdb
..\.....\vc60.idb
..\.....\vc60.pdb
..\处理机调度.doc
..\Debug
01
Download