搜索资源列表
JinChengDiaoDu
- 模拟实现进程调度的内存管理功能,由用户输入相关的参数,可以根据多选择的算法进行模拟-Analog realization of the process scheduling memory management functions, from the user input related parameters, you can choose the algorithm based on multi-simulation
jinchengdiaodu
- 模拟进程调度算法,用先来先服务算法进行调度。-Simulate the process of scheduling, first-come first-served scheduling algorithm.
jinchengdiaodu
- 进程标识符*/ int prio /*进程优先数*/ int round /*进程时间轮转时间片*/ int cputime /*进程占用CPU时间*/ int needtime /*进程到完成还要的时间*/ int count /*计数器*/ char state /*进程的状态*/ struct node *next /*链指针*/ -Process identifier*/int pr
jinchengdiaodu
- 编写并调试一个模拟的进程调度程序,采用“最高优先数优先”调度算法对五个进程进行调度。 “最高优先数优先”调度算法的基本思想是把CPU分配给就绪队列中优先数最高的进程。 静态优先数是在创建进程时确定的,并在整个进程运行期间不再改变。 动态优先数是指进程的优先数在创建进程时可以给定一个初始值,并且可以按一定原则修改优先数。例如 :在进程获得一次CPU后就将其优先数减少1。或者,进程等待的时间超过某一时限时增
jinchengdiaodu
- 进程调度算法,利用设置优先级算法来实现。-Process scheduling algorithm, used to set priority algorithm to achieve.
jinchengdiaodu
- 一个模拟基本进程调度的程序。可以很好的理解进程调度的过程-A simulation of the basic process scheduling program. Can be a good understanding of the process of scheduling the process of
jinchengdiaodu
- 操作系统模拟进程调度 经典算法 视图界面!-Classic algorithms simulate the process of scheduling the operating system interface for the view!
jinchengdiaodu
- 利用delphi来模拟操作系统的进程的调度过程-Use delphi to simulate the process of the operating system for the activation process
jinchengdiaodu
- 用预见算法解骑士游历问题 C++实现 数据结构-Algorithm for the Knight travels with a predictable problem C++, data structure
jinchengdiaodu
- 非抢占高响应比优先调度算法实现进程调度,包括进程名称,进程运行总时间,进程进入就绪队列时间,进程已运行时间。-High ratio of non-preemptive priority scheduling algorithm to respond to the process of scheduling, including the process name, the total running time of the process
jinchengdiaodu
- 模拟进程在静态优先级算法下的调度过程 算法选择:静态优先级。-Simulation process under static priority scheduling algorithm algorithm selection process: static priority.
jinchengdiaodu
- 用各种算法实现进程调度的模拟,有先来先服务算法、静态抢占算法、动态抢占优先级算法以及时间片轮转法,用MFC实现,界面优美功能完善。-Process scheduling algorithm with a variety of simulation, there is first come first serve algorithm, static capture algorithm, dynamic priority algorithm
jinchengdiaodu
- 进程调度模拟算法,最高优先数和先来先服务算法,有几个不同的-Process scheduling simulation algorithm, the highest priority number and first come first serve algorithm, there are several different
jinchengdiaodu
- 进程调度算法 操作系统进程调度1种算法,比较适合初学者-one calculator
jinchengdiaodu
- 1、用C语言或C++语言来实现对N个进程采用优先算法以及轮转算法的进程调度。 2、每个用来标示进程的进程控制块PCB用结果来描述,包括以下字段 (1)进程标识ID,其中0为闲逛进程,用户进程的标识数为1、2、3、、、、、、、。 (2)进程优先级Priority,闲逛进程(idle)的优先级为0,用户有进程的优先级大于0,且随机产生,标识数越大,优先级越高。 (3)进程占用的CPU时间CPUtime,进程每运一次
jinchengdiaodu
- 进程调度,实现先来先服调度,时间片轮转调度-Process scheduling
jinchengdiaodu
- 实现进程调度基本功能,是大学本科阶段必备资料。是操作系统的常见编程内容。-c
jinchengdiaodu
- 一个 操作系统的 进程调度的 课程设计。 主要包括时间片轮转,优先级,先来先服务,一以及多级反馈四种调度方法。是用c语言写的。-activation time of operating system ,used C.
jinchengdiaodu
- 编写并调试一个模拟的进程调度程序,采用“轮转法”调度算法对五个进程进行调度-Write and debug a simulation of the process scheduler, the " Round-Robin" scheduling algorithm for scheduling the five process
jinchengdiaodu
- 该系统包括有简单的进程控制、同步与通讯机构,其进程调度算法可任意选择。每个进程用一个PCB表示,其内容根据具体情况设置。各进程之间有一定的同步关系(可选)。系统在运行过程中应能显示或打印各进程的状态及有关参数的变化情况,以便观察诸进程的运行过程及系统的管理过程。-The system includes a simple process control, synchronization and communication agencies