- Category:
- CSharp
- Tags:
-
[WORD]
- File Size:
- 5.35kb
- Update:
- 2008-10-13
- Downloads:
- 0 Times
- Uploaded by:
- zhaoya526
Description: 1. The priority number of scheduling algorithms: the process in the ready queue in priority order of the number of smallest size, scheduling algorithm always select a few high-priority queue of the process put into operation, the use of dynamically changing the priority number of methods, each running process a priority corresponding to minus 2, thus avoiding a long-term occupation of processor operation, when scheduling the opportunity arise, the scheduling algorithm re-scheduling a timely manner, the first run to determine whether this process finished, is not running again after this process to determine whether the priority equivalent to queue in the first process priority number. If established, it continued to implement, so make repeat until ready queue is empty.
File list (Check if you may need any files):
Download