The implementation of the operating system schedul
2016-08-23
0 0 0
4.0
Other
Earn points
1. Use a "first come, first served (FCFS)" algorithm and the "shortest job first (SJF)" algorithm simulates job scheduling.
Requirements: Enter the job according to the order of arrival of each job requires running time, according to the scheduling algorithm outputs the average turnaround time.
For example (FCFS), enter: 8 (arrival time 0), 5 (arrival time 2), 7 (arrival time 3), 1 (arrival time 6)
Note: The format of any input, as long as the output of the average turnaround time can be.
2. Analog "FIFO (FIFO)" algorithm is FIFO
Analog "least recently used (LRU)" LRU algorithm
Analog "Best replacement (OPT)" algorithm OPT
Requirements: Enter the job according to the order of arrival of each job requires running time, according to the scheduling algorithm outputs the average turnaround time.
For example (FCFS), enter: 8 (arrival time 0), 5 (arrival time 2), 7 (arrival time 3), 1 (arrival time 6)
Note: The format of any input, as long as the output of the average turnaround time can be.
2. Analog "FIFO (FIFO)" algorithm is FIFO
Analog "least recently used (LRU)" LRU algorithm
Analog "Best replacement (OPT)" algorithm OPT
c++
算法
操作系统
实现
作业
页面
置换
调度
Related Source Codes
Local Path Planning Algorithm - DWA Algorithm
0
0
no vote
Classic Interview Questions for Digital City Front
0
0
no vote
enDAQ-Shock-Data-Share-SRS-Blog
0
0
no vote
Homemade biomimetic DOS
0
0
no vote
HDU-2553 N Queen Question
0
0
no vote
No comment