搜索资源列表
process
- 该程序实现单处理系统的进程调度模拟,进程最多个数5个,采用时间片轮转法-The program implementation process of scheduling a single processing system simulation, process the maximum number of five, with round-robin method
cpu-scheduling
- operating system:cpu scheduling algorithms(fcfs,priority,round robin,sjf) in c++.
os5
- “进程调度算法的实现”。 其实验目的是: 1实现先来先服务FCFS、短作业优先SJF以及时间片轮转调度算法。 2 了解上述3种算法的机理。 -Process scheduling algorithm to achieve. " The purpose of the experiment is as follows: 1 first-come first-served FCFS, priority to short jobs SJF and round-robin sche
round_robin
- 操作系统时间片轮转调度算法输入数个进程及时间片时间输出调度队列-Operating system round-robin scheduling algorithm input time output of the process and time slice scheduling queue
ProcessManage
- 1 操作系统课程设计 2 模拟CPU进程调度 3 实现时间片轮转调度算法 4 实现最短作业优先算法-1 operating systems course design 2 simulation CPU process scheduling 3 round-robin scheduling algorithm 4 shortest job first algorithm
OSControl
- 用C#写的操作系统进程的调度,有FIFO调度,时间片轮转调度等算法,需要DevExpress2011V2插件支持-C# to write the operating system process scheduling, FIFO scheduling, round-robin scheduling algorithm needs DevExpress2011V2 plug-in support
RRaST
- 操作系统的轮转算法和最短路径优先算法模拟-in OS ,be a model of RR(round robin) and the SPF(shortest process first) algorithm
Round-robin-supporting-file-reading
- 利用时间轮转算法,实现了对不同进程的调度,支持文件的读取,无须键盘输入。-The use of time rotary algorithms, the scheduling of the different processes, support files, read, without keyboard input.
OS_RR-and-SJF
- 操作系统 进程调度模拟设计——时间片轮转、强占式短进程优先算法-Operating system process scheduling simulation design- round-robin preemptive short process first algorithm
ProcessControl
- 实验1 进程调度 一、实验目的 通过实验加强对进程调度算法的理解和掌握。 二、实验内容 编写程序实现基于优先级的时间片轮转调度算法。 -Experiment a process schedulingFirst, the purpose of the experimentExperiments to enhance understanding and mastering of the process scheduling algorithm.Second, exper
ProcessSchedul
- 操作系统进程调度模拟器,包含了先到先服务、轮转调度、效率最大优先、剩余时间最短优先、最短执行时间优先、反馈策略-Operating system process scheduling simulator, including a first come first served, round robin scheduling, efficiency, maximum priority to the shortest remaining time priority, the shortest exe
diaodu
- 用时间片轮转算法和优先度算法实现进程的调度。 用vc++编程。-Round Robin with a time slice and priority process scheduling algorithm. The programming with vc++.
pcb
- 设计一个有N个进程并发的进程调度程序,采用时间片轮转算法。 Ø 每一个进程用一个进程控制块PCB表示。PCB包含信息有:进程名name,进程号id,进程状态state,进程所需运行时间need_time,进程运行时间run_time。 Ø 进程所需的运行时间人为指定。进程运行时间以时间片为单位进行计算。(程序中以按任意键表示运行一次CPU时间片) Ø 每个进程的状态有就绪W,运行R,和完成F(撤销进程)。 Ø
ProcessScheduler_hanweitao00
- 操作系统进程管理模拟,主要是1.先到先服务2.短作业优先3.时间片轮转-Operating system process management simulation, a first-come, first-served basis to service short job priority 3 round-robin
time
- 处理机调度是操作系统中非常重要的部分。为深入理解进程管理部分的功能,设计时间片轮转法进行CPU调度算法,模拟实现处理机的调度。通过本次课程设计理解进程调度的概念,深入理解进程控制的功能、进程的创建与删除以及进程各个状态之间的转换过程,实现时间片轮转算法调度进程。-PROCESSING scheduling is a very important part of the operating system. For an in-depth understanding of the function
Operating-System-Learing-Data
- 这里面有操作系统精髓与设计原理的第六版英文pdf,以及多级轮转调度算法仿真,文件系统__资源管理器。-There is the essence of the operating system and the design principle of the sixth edition of the English pdf, as well as multi-level round-robin scheduling algorithm simulation, __ Explorer file sys
process-scheduling
- 操作系统进程调度,包括最高优先数优先算法、简单时间片轮转调度算法、多级反馈队列调度算法-Operating system process scheduling, including the highest priority first algorithm, a simple time-slice round-robin scheduling algorithm, multi-level feedback queue scheduling algorithm
design-process-scheduling-algorithm
- 进程调度算法的设计 设计要求: ①设计进程控制块PCB表结构,分别适用于优先数调度算法和循环轮转调度算法。 ②建立进程就绪队列。对两种不同算法编制入链子程序。 ③编制两种进程调度算法:1)优先数调度;2)循环轮转调度 设计技术参数参考: ①本程序用两种算法对五个进程进行调度,每个进程可有三个状态,并假设初始状态为就绪状态。 ②为了便于处理,程序中的某进程运行时间以时间片为单位计算。各进程的优先数或轮转时间数以及进程需运行的时间
process-scheduling-experiment
- 操作系统进程调度实验://代码没有问题,是由cpp改成txt的,肯定能够运行。 //功能:根据磁盘调度的三种算法FCFS、短作业优先SJF和时间片轮转计算出处理机在分配内存时的工作原理,同时加深对这三种算法的记忆。 -Operating system process scheduling experiment ://code no problem, is changed by the cpp txt certainly be able to run.// Function: acc
kk
- 本程序设计为时间片轮转算法,运用C++实现模拟时间片为1的页面调度算法。-This program is designed to round-robin algorithm, using C++ time slice is one of analog paging algorithms.