Hot Search : Source embeded web remote control p2p game More...
Location : Home Search - ProcessScheduling
Search - ProcessScheduling - List
此为CPU进程调度的C语言源程序,很有用,自己编译后运行后觉得还可以,希望试试。-this process for CPU scheduling C language source code and useful, they compiled after the operation I felt that I could, Try hope.
Date : 2025-12-25 Size : 2kb User : huangchao

C语言编写的进程调度算法程序,在Turboc2.0下编译通过,界面友好-C language procedures for the process of scheduling algorithm in the compiler under Turboc2.0 approved, user-friendly
Date : 2025-12-25 Size : 2kb User : liuwei

实现进程的调度,实现spf和rr算法的基本要求,操作系统实验-nothing
Date : 2025-12-25 Size : 105kb User : 文子

进程调度模拟实验,为学校操作系统课程设计内容-Process scheduling simulation experiments, the content of curriculum design for schools operating system
Date : 2025-12-25 Size : 519kb User : 杨子江

操作系统: 进程调度模拟程序设计 2,实现的功能:实现了进程调度模拟程序设计中的基于动态优先权的算法。 3,优点: 在程序的窗口给出了最开始的时候的队列里的状况,随机生成了每个进程的“优先权”和“要求运行时间”,并考虑到了避免产生 较大的数而导致程序长时间陷入循环,(即设定了优先权和要求运行时间的上下限); 可以方便的添加或者删除进程数目,(只需要改动源代码中的MAXN值即可,其他的不需要改动)而不影响程序的运行,健壮性好。 4,缺点: 对按“优先权”进行排序采用的是快排的方式,这样当进程的数目较多时可能会耗费一定的时间。 -Process scheduling simulation program design 2, functions: to achieve the design process scheduling simulation program based on dynamic priority algorithm. 3, the advantages: the procedure given in the beginning of the window when the status of the queue is randomly generated for each process of the " priority" and " time required to run" , and to avoid taking into account the result of the larger number program for a long time into the cycle, (ie, setting the priorities and requirements of the upper and lower running time) You can easily add or remove the number of processes (only need to change the source code MAXN value to other no changes) without affecting the operation of the program, the robustness is good. 4 Disadvantages: Press the " priority" is used to sort the rows of the way fast, may take some time so that when a larger number of processes.
Date : 2025-12-25 Size : 294kb User : 天蓝
CodeBus is one of the largest source code repositories on the Internet!
Contact us :
1999-2046 CodeBus All Rights Reserved.