Description: 此为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. Platform: |
Size: 2286 |
Author:huangchao |
Hits:
Description: 此为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. Platform: |
Size: 2048 |
Author:huangchao |
Hits:
Description: 一、目的要求
用高级语言编写和调试一个进程调度程序，以加深对进程的概念及进程调度算法的理解。
二、例题： 设计一个有 N个进程共行的进程调度程序。
进程调度算法：采用最高优先数优先的调度算法（即把处理机分配给优先数最高的进程）和先来先服务算法。
每个进程有一个进程控制块（ PCB）表示。进程控制块可以包含如下信息：进程名、优先数、到达时间、需要运行时间、已用CPU时间、进程状态等等。
-First, the purpose of high-level language requires a process of writing and debugging scheduling procedures in order to deepen their understanding of the process of the concept and understanding of the process of scheduling algorithm. Second, Example: Design of a total of N months the process of the process of scheduling procedures. The process of scheduling algorithm: The number of priority of the highest priority scheduling algorithm (that is, the number of processors allocated to the highest priority to the process) and first-come first-serve algorithm. Each process is a process control block (PCB) said. Process control block can contain the following information: the process name, priority number, arrival time, need to run the time, has spent CPU time, the process of state and so on. Platform: |
Size: 74752 |
Author:Anson |
Hits:
Description: C语言编写的进程调度算法程序,在Turboc2.0下编译通过,界面友好-C language procedures for the process of scheduling algorithm in the compiler under Turboc2.0 approved, user-friendly Platform: |
Size: 2048 |
Author:liuwei |
Hits:
Description: C# 进程调度
算法演示
模拟操作系统进程调度-C# demonstration of the process of scheduling the operating system process scheduling simulation Platform: |
Size: 38912 |
Author:snk |
Hits:
Description: 设计一个有 N个进程并行的优先级调度程序:每个进程有一个进程控制块（ PCB）表示。进程控制块可以包含如下信息：进程名、优先数、到达时间、需要运行时间、已用CPU时间、进程状态等等。
进程的优先数及需要的运行时间可以事先人为地指定（也可以由随机数产生）。进程的到达时间为进程输入的时间。
进程的运行时间以时间片为单位进行计算。
每个进程的状态可以是就绪 W（Wait）、运行R（Run）、或完成F（Finish）三种状态之一。
就绪进程获得 CPU后都只能运行一个时间片。用已占用CPU时间加1来表示。
如果运行一个时间片后，进程的已占用 CPU时间已达到所需要的运行时间，则撤消该进程，如果运行一个时间片后进程的已占用CPU时间还未达所需要的运行时间，也就是进程还需要继续运行，此时应将进程的优先数减1（即降低一级），然后把它插入就绪队列等待CPU。
每进行一次调度程序都打印一次运行进程、就绪队列、以及各个进程的 PCB，以便进行检查。
重复以上过程，直到所要进程都完成为止。-Design of a parallel to the process N one priority scheduling process: Each process has a process control block (PCB) said. Process control block may contain the following information: process name, priority number, arrival time, need to run time, has spent CPU time, the process of the state and so on.
The process priority number and needs of the running time can be artificially designated in advance (you can also by a random number generator). Process, the arrival time for the process input time.
The process of running time to time slices are calculated as a unit.
The state of each process can be ready W (Wait), run the R (Run), or the completion of F (Finish), one of three states.
Ready access to CPU after the process can only run one time slice. CPU time has been occupied with the plus one indication of this.
If you are running a time slice, after the process has been CPU-time has reached the required running time, then undo the process, if a time slice to run after the pr Platform: |
Size: 1024 |
Author:程天晨 |
Hits:
Description: 操作系统的进程调度算法模拟，FCFS、SJF、高响应比优先，基于MFC对话框，可动态显示就绪队列和当前执行进程-Operating system process scheduling algorithm simulation, FCFS, SJF, high priority response ratio, based on MFC dialog box, you can dynamically display the ready queue and the current implementation process Platform: |
Size: 1994752 |
Author:Meihua |
Hits:
Description: 操作系统：
进程调度模拟程序设计
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. Platform: |
Size: 301056 |
Author:天蓝 |
Hits:
Description: 有n个进程处于就绪状态，有m个进程处于阻塞状态。采用轮转法进程调度算法进行调度(调度过程中，假设处于执行状态的进程不会阻塞)，且每过t个时间片系统释放资源，唤醒处于阻塞队列队首的进程-There are n processes in the ready state, there are m process is blocked. Process scheduling algorithm using round robin scheduling (scheduling process, it is assumed in the execution state does not block), and each piece of the system over time t release resources, the process of blocking queue first team in wake Platform: |
Size: 258048 |
Author:张三 |
Hits:
Search - ProcessScheduling