Search - scheduling

Search - scheduling - List

[Process-Thread] 优先级调度算法 DL : 1: 设计一个有 N个进程并发运行的进程调度程序，进程调度算法：最高优先数优先的调度算法。本实验模拟在单处理机环境下处理机的调度，了解处理机调度的过程。-design is a complicated process N-running process scheduler, process scheduling algorithm : the highest priority to a few priority scheduling algorithm. The experimental simulation of the single-processor environment processor scheduling, understanding processor scheduling process.
Date : 2026-01-11 Size : 2kb User : 程倩
[Process-Thread] 另一个优先级调度算法 DL : 0: 设计一个有 N个进程并发运行的进程调度程序，进程调度算法：最高优先数优先的调度算法。本实验模拟在单处理机环境下处理机的调度，帮助了解处理机调度的过程。-design is a complicated process N-running process scheduler, process scheduling algorithm : the highest priority to a few priority scheduling algorithm. The experimental simulation of the single-processor environment processor scheduling, help understand the processor scheduling process.
Date : 2026-01-11 Size : 3kb User : 程倩
[Process-Thread] 处理机调度1.RAR DL : 0: 操作系统的处理机调度算法：提供了FIFS、SFJ、HRN、时间片轮转算法的实现算法-operating system processor scheduling algorithms : a FIFS, SFJ, 010-001, time-rotate algorithm Algorithm
Date : 2026-01-11 Size : 1kb User : 何瑜
[Process-Thread] 进程调度算法.RAR DL : 0: 操作系统实验的进程调度算法实现：提供了四种重要的算法（FIFS、SFJ、HRN）-operating systems experimental process scheduling algorithm : to provide four important algorithm (FIFS, SFJ, 010-001)
Date : 2026-01-11 Size : 1kb User : 何瑜
[Process-Thread] scan与cscan算法模拟磁盘调度实验 DL : 0: 此为操作系统实验报告： scan,cscan算法模拟磁盘调度内含：程序流程图设计思路主要源码等等。简介：磁盘是一种高速、大容量、旋转型、可直接存取的存储设备。它作为计算机系统的辅助存储器，担负着繁重的输入输出任务、在多道程序设计系统中，往往同时会有若干个要求访问磁盘的输入输出请求等待处理。系统可采用一种策略，尽可能按最佳次序执行要求访问磁盘的诸输入输出请求。-operating system for this experiment : scan, cscan scheduling algorithm simulation disk containing : flowchart design major source so on. Description : disk is a high-speed, high-capacity, rotating type, direct access storage devices. As computer systems support memory, shoulders the heavy task of input and output, multiple procedures in the system design, while there are often a number of requests to visit disk input and output requests pending.
Date : 2026-01-11 Size : 6kb User : 何浩
[Process-Thread] N-Step Progress DL : 0: Ｎ级进程调度，界面和进程都不错，是很值得下载的-N-scheduling process, the interface and the process is pretty good, and is worth the download
Date : 2026-01-11 Size : 27kb User : 林一森
[Process-Thread] 进程调度模拟源程序 DL : 0: 进程调度问题，调度算法有优先数法和时间片轮法，速度调节可以自己设定-process of scheduling problems, priority scheduling algorithm method and the time-wheel, speed regulation can create
Date : 2026-01-11 Size : 27kb User : 林一森
[Process-Thread] 进程调度算法实验报告 DL : 0: 关于进程的调度算法实验设计：（1）设计一个有N个进程共行的进程调度程序。每个进程由一个进程控制块 PCB表示。进程控制块包括以下信息：进程名，进程优先数，进程需要运行的时间，占用CPU的时间以及进程的状态等。（2）本调度程序用优先数调度算法。（3）编写程序并调试运行。 -on the process of scheduling algorithm Experimental Design : (1) design a process of a total of N line in the process scheduler. Every process from a process control block PCB said. Process control block include the following information : process, and several priority process, the process needs to run the time, CPU time and the process of status. (2) The scheduler with a few priority scheduling algorithm. (3) Prepare and commissioning procedures.
Date : 2026-01-11 Size : 6kb User : 赵新新
[Process-Thread] caozuo02050210 DL : 0: 操作系统课程设计----进程调度 LRU算法内附设计报告-courses on operating system design process-scheduling algorithm containing LRU design report
Date : 2026-01-11 Size : 603kb User : 于勇
[Process-Thread] threadpool-0_2_4-src DL : 0: boost线程池库。 boost库中未包含线程池，但sourceforge上有了实现，该线程池简单易用，支持丰富的调度策略（fifo, lifo和priority）。-boost the thread pool library. boost library does not contain a thread pool, but there is sourceforge realize that the easy-to-use thread pool to support the rich scheduling strategy (fifo, lifo, and priority).
Date : 2026-01-11 Size : 68kb User : txf
[Process-Thread] gege DL : 0: 进程调度算法：采用最高优先数优先的调度算法（即把处理机分配给优先数最高的进程）和先来先服务算法。每个进程有一个进程控制块（ PCB）表示。进程控制块可以包含如下信息：进程名、优先数、到达时间、需要运行时间、已用CPU时间、进程状态等等。　　进程优先数及需要的运行时间可以事先人为地指定（也可以由随机数产生）。进程的到达时间为进程输入的时间。进程的运行时间以时间片为单位进行计算。　 -The process of scheduling algorithms: the use of the highest priority number of priority scheduling algorithm (ie the number of processors allocated to the highest priority process) and first-come first-serve algorithm. Each process has a process control block (PCB) said. Process control block can contain the following information: process name, priority number, arrival time, the need for run-time, has spent CPU time, the process of state and so on. Process priority number and needs of the running time can be artificially designated in advance (you can also by the random number generator). Process input arrival time for the process time. The process of running time to time slice is calculated as a unit.
Date : 2026-01-11 Size : 1kb User : 110
[Process-Thread] ProcSchedule DL : 0: 多级反馈队列调度的模拟实现，通过调度过程，模拟进程调度。-Multilevel Feedback Queue Scheduling Simulation realize, through the activation process, simulating the process of scheduling.
Date : 2026-01-11 Size : 555kb User : 钟远辉
[Process-Thread] scheduling DL : 0: 设计一程式可输入 1、几个行程 2、每个行程各别的CPU暴冲时间(毫秒) 3、到达时间 4、优先顺序并求出 1、FCFS 2、SJF - 不可抢先 3、SJF - 可抢先 4、Priority 5、RR 平均等待时间-Design a program may enter 1, 2 several trips, each trip of the other CPU storms red time (ms) 3, the arrival time 4, and obtained the order of priority 1, FCFS 2, SJF- can not be the first to 3, SJF-- can be the first to 4, Priority 5, RR average wait time
Date : 2026-01-11 Size : 2kb User : attackk
[Process-Thread] OS DL : 0: 基于高优先级优先的调度算法，模拟时间片进行进程调度-Based on high-priority priority scheduling algorithm, simulation time slice for the process of scheduling
Date : 2026-01-11 Size : 2kb User : olive
[Process-Thread] jinchengdiaodu DL : 0: 编写并调试一个模拟的进程调度程序，采用“最高优先数优先”调度算法对五个进程进行调度。　　“最高优先数优先”调度算法的基本思想是把CPU分配给就绪队列中优先数最高的进程。　　静态优先数是在创建进程时确定的，并在整个进程运行期间不再改变。　　动态优先数是指进程的优先数在创建进程时可以给定一个初始值，并且可以按一定原则修改优先数。例如：在进程获得一次CPU后就将其优先数减少1。或者，进程等待的时间超过某一时限时增加其优先数的值，等等 -Write and debug a simulation of the process scheduler, using the "highest priority number priority" scheduling process scheduling algorithm to five. The "highest priority number first" scheduling algorithm the basic idea is to CPU allocated to the highest-priority ready queue in the process. Static priority number is determined when creating the process, and in the whole process will not change during the operation. Dynamic priority number refers to the process of creating a process priority number can be given an initial value, and can modify the priority number according to certain principles. Example : In the process, get a CPU after its reduction in the number one priority. Or, the process of waiting time exceeds a certain time limit, increase the number of its priority value, and so on
Date : 2026-01-11 Size : 23kb User : 张超
[Process-Thread] Process-Scheduling-Algorithm DL : 0: 模拟实现四种进程调度算法：先到先服务、抢占式调度、时间片轮转、多级反馈队列调度-Simulation of the process of realization of the four scheduling algorithms: first come first service, preemptive scheduling, time slice rotation, multi-level feedback queue scheduling
Date : 2026-01-11 Size : 179kb User : Lambert
[Process-Thread] Process-scheduling-algorithm- DL : 0: 先来先服务调度算法（FCFS）：每次调度都是从后备作业队列中，选择一个或多个最先进入该队列的作业，将它们调入内存，为它们分配资源、创建进程，然后放入就绪队列。在进程调度中采用FCFS算法时，这每次调度是从就绪队列中，选择一个最先进入该队列的进程，为之分配处理机，使之投入运行。该进程一直运行到完成或发生某事件阻赛后，才放弃处理机。最短作业优先（SJF）：每次从后备队列中选择一个或若干个估计运行时间最短的作业，将它们调入内存运行。 -FCFS scheduling algorithm (FCFS): each is from the reserve job queue scheduling, select one or more of the first job into the queue and put them into memory, as they allocate resources, create a process, and then put into the ready queue. In the process, the use of FCFS scheduling algorithm, this time from the ready queue scheduling, select one of the first process into the queue for it and assign processors to make operational. The process has been run to completion or stop an event occurs after the game, only to give up processor. Shortest job first (SJF): Select a time from the backlog is estimated to run one or several shortest job transferred to the memory to run them.
Date : 2026-01-11 Size : 7kb User : 王泽宇
[Process-Thread] Process-scheduling DL : 0: 此程序完成操作系统中进程调度的问题。在C++环境下实现。-This process is completed the operating system process scheduling problems. In C++ environment to achieve.
Date : 2026-01-11 Size : 2kb User : lansejingling
[Process-Thread] MFCPROCESS-SCHEDULING DL : 0: MFC进程调度,有源码和编译文件，有利于学习-MFC process scheduling
Date : 2026-01-11 Size : 1.17mb User : 有森
[Process-Thread] process-scheduling- DL : 0: 进程调度各种算法实现，时间片、最短作业、最大优先算法-A variety of process scheduling algorithm, time slice, the shortest job first algorithm the largest
Date : 2026-01-11 Size : 234kb User : 卫卫

« 12 3 4 5 6 7 8 9 10 ... 18 »