Location:
Search - rr ready queue
Search list
Description: diaodu1完成基本模块框架
diaodu2完成了先进先出，和输出显示模块。
diaodu2-1准备将FCFS的到达时间按从小到大排列进行实现。未果
diaodu3完成了SJF，优化了输出精度
diaodu4基本完成了RR但是有一个小bug，
diaodu5完成了RR
diaodu6优化了一些输入输出，但是发现RR等于4时正确，大于或小于4都有问题。算法出现问题
diaodu7解决了RR的问题。程序基本完成
diaodu8优化了代码，并完善了RR输出时间轴表示的代码，和main函数中输入操作命令转换为大写字母的比较方式。-diaodu1 completed basic module framework diaodu2 completed the first-in first-out. and output module. Diaodu2-1 ready to FCFS queue by the time of arrival from small to large to achieve alignment. Diaodu3 unsuccessful completion of the SJF, Optimizing the output accuracy diaodu4 basically completed the RR However, there is a small bug, diaodu5 RR diaodu6 completed the optimization of input and output, But RR was found to 4:00 correct, or less than 4 had problems. Diaodu7 algorithm to solve problems of the RR. Diaodu8 completed basic procedures to optimize the code, and improve the time frame indicated RR output code, and the main function entry orders converted to uppercase the comparative approach.
Platform: |
Size: 10728 |
Author: billdong |
Hits:
Description: Round-robin scheduling algorithm is one of the simplest scheduling algorithms. It is designed especially for time-sharing systems. The ready queue is treated as a circular queue. The algorithm assigns a time slice(also called time quantum) to each process in the ready queue in order, handling all processes without priority. A maximum of one time slice is allocated at once. If the remaining request is less than a time slice, only the remaining request time is allocated. Round-robin scheduling is both simple and easy to implement. It is also starvation-free.
Platform: |
Size: 81019 |
Author: 邓思兵 |
Hits:
Description: diaodu1完成基本模块框架
diaodu2完成了先进先出，和输出显示模块。
diaodu2-1准备将FCFS的到达时间按从小到大排列进行实现。未果
diaodu3完成了SJF，优化了输出精度
diaodu4基本完成了RR但是有一个小bug，
diaodu5完成了RR
diaodu6优化了一些输入输出，但是发现RR等于4时正确，大于或小于4都有问题。算法出现问题
diaodu7解决了RR的问题。程序基本完成
diaodu8优化了代码，并完善了RR输出时间轴表示的代码，和main函数中输入操作命令转换为大写字母的比较方式。-diaodu1 completed basic module framework diaodu2 completed the first-in first-out. and output module. Diaodu2-1 ready to FCFS queue by the time of arrival from small to large to achieve alignment. Diaodu3 unsuccessful completion of the SJF, Optimizing the output accuracy diaodu4 basically completed the RR However, there is a small bug, diaodu5 RR diaodu6 completed the optimization of input and output, But RR was found to 4:00 correct, or less than 4 had problems. Diaodu7 algorithm to solve problems of the RR. Diaodu8 completed basic procedures to optimize the code, and improve the time frame indicated RR output code, and the main function entry orders converted to uppercase the comparative approach.
Platform: |
Size: 10240 |
Author: billdong |
Hits:
Description: Round-robin scheduling algorithm is one of the simplest scheduling algorithms. It is designed especially for time-sharing systems. The ready queue is treated as a circular queue. The algorithm assigns a time slice(also called time quantum) to each process in the ready queue in order, handling all processes without priority. A maximum of one time slice is allocated at once. If the remaining request is less than a time slice, only the remaining request time is allocated. Round-robin scheduling is both simple and easy to implement. It is also starvation-free.
Platform: |
Size: 148480 |
Author: 邓思兵 |
Hits:
Description: 时间片轮转调度是一种最古老，最简单，最公平且使用最广的算法。每个进程被分配一个时间段，称作它的时间片，即该进程允许运行的时间。如果在时间片结束时进程还在运行，则CPU将被剥夺并分配给另一个进程。如果进程在时间片结束前阻塞或结束，则CPU当即进行切换。调度程序所要做的就是维护一张就绪进程列表，当进程用完它的时间片后，它被移到队列的末尾。-CPU will be denied and assigned to another process. If the process before the end of the time slice blocking or over, immediately switch the CPU. Scheduler to do is to maintain a ready list of processes, when the process runs out of its time slice, it was moved to the end of the queue.
Platform: |
Size: 3072 |
Author: 缪缪 |
Hits: