Search - scheduling

Search - scheduling - List

[OS Develop] FIFO DL : 0: 关于操作系统:先进先出调度算法（FIFO）处理缺页中断-On the operating system: FIFO scheduling algorithms (FIFO) handling page fault
Date : 2026-01-11 Size : 22kb User : 王伟(就是刚才的 hgy
[OS Develop] 进程调度程序模拟程序 DL : 0: 采用静态优先数的方法，编写一进程调度程序模拟程序，进程状态为就绪、运行、阻塞三种。模拟程序只对你所设置的“虚拟PCB”进行相应的调度模拟操作，即每发生“调度”时，显示出当前“PCB名字”、优先数、运行时间等，而不需要对系统中真正的PCB等数据进行修改。-priority number using the static method, the preparation process of scheduling a process simulation program, the process in place for the state, running, blocking three.PCBPCBPCB
Date : 2026-01-11 Size : 68kb User : 吴晓辉
[OS Develop] 磁盘调度算法 DL : 0: 磁盘调度算法 1。实现三种算法： 1。先来先服务 2。最短寻道优先（可自己假设当前磁头的位置） 3。电梯算法 2。磁道服务顺序从指定的文本文件（TXT文件）中取出 3。输出：第一行：磁道的服务顺序第二行：显示移动总道数-a disk scheduling algorithms. Three algorithms to achieve : 1. First-come first-serve two. Seeking shortest priority (to be their head the assumption that the current location) 3. Elevator Algorithm 2. Track services from the designated order of the text document (TXT) out of three. Output : the first line : track the order of the second line services : Road show that the total number of mobile
Date : 2026-01-11 Size : 7kb User : 飞扬
[OS Develop] 进程调度实验 DL : 0: 进程调度算法的实现-Process Scheduling Algorithm Implementation
Date : 2026-01-11 Size : 1kb User : 张伟
[OS Develop] CPU调度C语言实现 DL : 0: CPU调度C语言实现实现1FCFS(先到先服务) 2SJF(最段作业优先调度) 3RR(轮转法) 4PSA(优先权调度)n) 5EXIT 　　　　　　　　 6时间的延迟；　　　　　　　　　7：屏幕的换色.-CPU scheduling C Language Implementation 1FCFS (first come-first services) 2SJF (most of the operational priority scheduling) 3RR (Web) 4PSA (Priority Scheduling) n) 5EXIT six hours of delay; 7 : screen for color.
Date : 2026-01-11 Size : 1kb User : 蒋涛
[OS Develop] 作业调度实验 DL : 0: 大学操作系统课程的其中一个实验--作业调度的模拟-university courses on operating system of an experimental-- Job Scheduling Simulation
Date : 2026-01-11 Size : 534kb User : 山狗
[OS Develop] Cipan1 DL : 0: 磁盘调度算法源程序-disk scheduling algorithm source code
Date : 2026-01-11 Size : 2kb User : 网旭
[OS Develop] 作业调度三种算法FCFS，SJF，HRN DL : 0: 作业调度三种算法FCFS，SJF，HRN -Job Scheduling Algorithm FCFS, SJF, 010-001
Date : 2026-01-11 Size : 3kb User : 杭天
[OS Develop] 操作系统进程调度实验--附有实验报告 DL : 0: 这是一个关于操作系统进程调度的实验，采用的是优先权调度算法-This is a process of the operating system's scheduling experiment, the scheduling algorithm is priority
Date : 2026-01-11 Size : 150kb User : 编程浪子
[OS Develop] OS进程调度模拟 DL : 0: 1、按优先权调度算法，实现处理器调度。 2、主存储器空间的分配和回收在可变分区管理方式下，采用最先适应算法实现主存空间的分配和回收。-1, priority scheduling algorithm to achieve processor scheduling. 2, the main memory space allocation and recovery of the variable area management, using the first algorithm to adapt to main memory space allocation and recovery.
Date : 2026-01-11 Size : 4kb User : 陈为
[OS Develop] 进程调度与作业调度的模拟 DL : 0: 对进程调度与作业调度的模拟,进程调度算法：采用的是最高优先数优先的高度算法（即把处理机分配给优先数最高的进程和先来先服务算法。分区分配和回收算法：采用首次适应算法和最佳适应算法实现动态分区。其中，空闲分区通过空闲分区链来管理，在进行内存分配时，系统优先使用空闲区低端的空间。-process of scheduling and job scheduling simulation and process scheduling algorithm : the highest priority is the high number of priority algorithm (that is, processors allocated to the highest priority to the process and the first-come first-serve count France. through distribution and recovery algorithm : the first and best adaptation algorithm to adapt to dynamic partitioning algorithm. Among them, through idle through to idle through chain management, carrying out memory allocation, the system priority in the use of low-end leisure area of space.
Date : 2026-01-11 Size : 75kb User : 陈任全
[OS Develop] chulijidiaodu_111 DL : 0: 处理机调度，编写一个进程调度程序，允许多个进程共行的进程调度程序。　　进程调度算法：采用最高优先数优先的调度算法（即把处理机分配给优先数最高的进程）和先来先服务算法。　　每个进程有一个进程控制块（PCB）表示。进程控制块可以包含如下信息：进程名、优先数、到达时间、需要运行时间、已用CPU时间、进程状态等等。　　进程的优先数及需要的运行时间可以事先人为地指定（也可以由随机数产生）。进程的到达时间为输入进程的时间。　　进程的运行时间以时间片为单位进行计算。　　每个进程的状态可以是就绪 W（Wait）、运行R（Run）、或完成F（Finish）三种状态之一。　　就绪进程获得 CPU后都只能运行一个时间片。用已占用CPU时间加1来表示。　　如果运行一个时间片后，进程的已占用 CPU时间已达到所需要的运行时间，则撤消该进程，如果运行一个时间片后进程的已占用CPU时间还未达所需要的运行时间，也就是进程还需要继续运行，此时应将进程的优先数减1（即降低一级），然后把它插入就绪队列等待CPU。　　每进行一次调度程序都打印一次运行进程、就绪队列、以及各个进程的 PCB，以便进行检查。　　重复以上过程，直到所要进程都完成为止 -processor scheduling, the preparation of a process scheduling procedures, allowing a total of more than process the process scheduler. Process scheduling algorithm : Highest priority for priority scheduling algorithm (namely processors allocated to the highest priority in the process) and a first-come first-service algorithm . Each process is a process control block (PCB) said. Process control block may contain the following information : process, and a number of priority, arriving in time, the running time, CPU has spent time, the process of the state and so on. Several priorities for the process of the operation and needs time to be designated prior to artificially (and also by the random number generator). The arrival process for the importation process of time. The process of running t
Date : 2026-01-11 Size : 99kb User : 王山
[OS Develop] dsadasdasdas DL : 0: 自己看磁盘调度算法要的自己载磁盘调度算法-look disk-scheduling algorithms to set its own disk scheduling algorithm
Date : 2026-01-11 Size : 1kb User : chenyi
[OS Develop] CPUScheduler DL : 0: 经典的CPU进程调度软件,可以了解CPU调度的原理.-classic CPU process scheduling software, CPU scheduling can understand the principle.
Date : 2026-01-11 Size : 8kb User : 陈聪
[OS Develop] czx11t DL : 0: 操作系统中的调度先来先服务及短作业优先，是用java编写的。-operating system of first-come first-scheduling services and short operating priority is the use of java prepared.
Date : 2026-01-11 Size : 5kb User : zmy
[OS Develop] process_attemper DL : 0: 1、：编写并调试一个模拟的进程调度程序，采用“最高优先数优先”调度算法对进程进行调度。 “最高优先数优先调度算法的基本思想是把CPU分配给就绪队列中优先数最高的进程。尝试静态优先数与动态优先数两种方法： a) 静态优先数是指优先数在整个进程运行期间不再改变。优先数可以在数据输入时指定，也可以根据到达顺序、运行时间确定。 b) 动态优先数是指进程的优先数在创建进程时可以给定一个初始值，并且可以按一定原则修改优先数。例如进程获得一次CPU后就将其优先数减少1。或者进程等待的时间超过某一时限时增加其优先数的值。 2、编写并调试一个模拟的进程调度程序，模拟实现多级反馈队列调度算法。 3、编写并调试一个模拟的进程调度程序，模拟实现最低松弛度优先算法。 4、程序与报告要求： a) 对上述要求1、2、3，至少要完成一项，鼓励尝试多种算法。 b) 输出结果要尽量详细清晰，能够反映调度后队列变化，PCB内部变化。 c) 可以选择在Windows或Linux环境下编写、运行程序 d) 鼓励使用不同的开发工具在不同平台环境上进行开发比较。 e) 在实验报告中，一方面可以对实验结果进行分析，一方面可以对各种算法进行比较，分析它们的优劣，说明各种算法适用于哪些情况下的调度。 -1 : Prepare a simulation and debugging process scheduling procedures, "Priority number of the highest priority" to the process of scheduling algorithms for scheduling. "Highest priority priority scheduling algorithm for the basic idea is to place the CPU allocated to the priority queue highest process. Taste Examination several static and dynamic priority priority number two methods : a) static priority number is priority number in operation during the entire process will not change. priority number in the designated input data, can be reached under the order, running time determine. b) dynamic priority number refers to several priorities for the process of the creation process can be given an initial value, and according to the principle of amending certain priority number.
Date : 2026-01-11 Size : 1.16mb User : huiting_liu
[OS Develop] sstf DL : 0: 磁盘调度的三种方法的其中一种用C语言实现-Disk scheduling one of three methods using C language
Date : 2026-01-11 Size : 1kb User : 范小雨
[OS Develop] suojifankuidiaodu DL : 0: 操作系统中实现进程调度中的多级反馈队列调度算法-Operating system to achieve the process of scheduling multi-level feedback queue scheduling algorithm
Date : 2026-01-11 Size : 597kb User : 真我
[OS Develop] scheduling DL : 0: application of scheduling algorithms
Date : 2026-01-11 Size : 2kb User : muhendis
[OS Develop] SCHEDULING DL : 0: Job Scheduling using different algo
Date : 2026-01-11 Size : 1kb User : rahul

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