Description: 1, setting a plurality of the ready queue, and queue priority given to different series, the first highest, followed by diminishing.
2, giving each queue process execution time sheet size, higher priority queue, time slice is small.
In 3, when a new process into the memory, first put it in a column end, if in a time slice
End of fashion is not complete, the turn into the second queue end.
In 4, when a process from one column to the N queue, then in the N queue using the time slice rotation executed.
In 5, only when time is free, only second the process queue scheduling.
To Search:
File list (Check if you may need any files):
word1.doc
Download