Search - scheduling algorithm

Search - scheduling algorithm - List

[OS Develop] FIFO DL : 0: 关于操作系统:先进先出调度算法（FIFO）处理缺页中断-On the operating system: FIFO scheduling algorithms (FIFO) handling page fault
Date : 2025-12-26 Size : 22kb User : 王伟(就是刚才的 hgy
[OS Develop] 进程调度实验 DL : 0: 进程调度算法的实现-Process Scheduling Algorithm Implementation
Date : 2025-12-26 Size : 1kb User : 张伟
[OS Develop] Cipan1 DL : 0: 磁盘调度算法源程序-disk scheduling algorithm source code
Date : 2025-12-26 Size : 2kb User : 网旭
[OS Develop] 作业调度三种算法FCFS，SJF，HRN DL : 0: 作业调度三种算法FCFS，SJF，HRN -Job Scheduling Algorithm FCFS, SJF, 010-001
Date : 2025-12-26 Size : 3kb User : 杭天
[OS Develop] 操作系统进程调度实验--附有实验报告 DL : 0: 这是一个关于操作系统进程调度的实验，采用的是优先权调度算法-This is a process of the operating system's scheduling experiment, the scheduling algorithm is priority
Date : 2025-12-26 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 : 2025-12-26 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 : 2025-12-26 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 : 2025-12-26 Size : 99kb User : 王山
[OS Develop] dsadasdasdas DL : 0: 自己看磁盘调度算法要的自己载磁盘调度算法-look disk-scheduling algorithms to set its own disk scheduling algorithm
Date : 2025-12-26 Size : 1kb User : chenyi
[OS Develop] ZCKJFPHS DL : 0: 主存空间的分配与回收．采用可变分区存储管理，使用首次适应算法、循环首次适应算法、最佳适应算法三种算法完成设计。-main memory space for the distribution and recovery. Using variable storage area management, the use of the first-fit algorithm, the first cycle of adaptation algorithms, best adaptation algorithm to complete the design of three types of algorithms.
Date : 2025-12-26 Size : 274kb User : 罗小明
[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 : 2025-12-26 Size : 1.16mb User : huiting_liu
[OS Develop] sstf DL : 0: 磁盘调度的三种方法的其中一种用C语言实现-Disk scheduling one of three methods using C language
Date : 2025-12-26 Size : 1kb User : 范小雨
[OS Develop] Schedule DL : 0: 进程调度算法！是源代码，不错的了！给大家下载使用！-Process scheduling algorithm! Is the source code, good! U.S. to download!
Date : 2025-12-26 Size : 26kb User : 崔凯
[OS Develop] diaodu DL : 0: ○1 设计进程进程控制块PCB表结构，分别适用于优先数调度算法和循环轮转调度算法。 PCB结构通常包括以下信息：进程名，进程优先数（或轮转时间片），进程所占用的CPU时间，进程的状态，当前队列指针等。根据调度算法的不同，PCB结构的内容可以作适当的增删。 ○2 建立进程就绪队列。对两种不同算法编制入链子程序。 ○3 编制两种进程调度算法：1）优先度调度；2）循环轮转调度。 -○ design process 1 process control block PCB table structure, namely the number applies to the priority scheduling algorithm and the cycle of rotation scheduling algorithm. PCB structure typically includes the following information: process name, process priority number (or the rotation time slice), the process of occupying CPU time, the process of the state, such as the current queue pointer. According to the different scheduling algorithm, PCB content of the structure can be used for appropriate additions and deletions. ○ 2 to establish the process ready queue. Algorithm on two different procedures for the preparation into the chain. ○ 3 the process of the preparation of two scheduling algorithms: 1) priority scheduling 2) Round-Robin scheduling cycle.
Date : 2025-12-26 Size : 116kb User : 狄影
[OS Develop] cz DL : 0: 用VB编的作业调度算法使用了FCFS和SJF算法-VB series with the job scheduling algorithm uses the FCFS and SJF algorithm
Date : 2025-12-26 Size : 61kb User : ww
[OS Develop] Process-scheduling-algorithm DL : 0: 进程调度算法，很适合初学者学习操作系统使用，写的很清楚易懂的算法。-Process scheduling algorithm, it is suitable for beginners to learn the operating system , written in very clear and understandable algorithm .
Date : 2025-12-26 Size : 2kb User : jerryhu
[OS Develop] Disk-scheduling-algorithm-simulation DL : 0: 磁盘调度算法的模拟实现及对比-Disk scheduling algorithm simulation and comparison of various algorithms of OPT, FIFO, the LRU simulation
Date : 2025-12-26 Size : 49kb User : Qugo
[OS Develop] design-process-scheduling-algorithm DL : 0: 进程调度算法的设计设计要求： ①设计进程控制块PCB表结构，分别适用于优先数调度算法和循环轮转调度算法。 ②建立进程就绪队列。对两种不同算法编制入链子程序。 ③编制两种进程调度算法：1）优先数调度；2）循环轮转调度设计技术参数参考: ①本程序用两种算法对五个进程进行调度，每个进程可有三个状态，并假设初始状态为就绪状态。 ②为了便于处理，程序中的某进程运行时间以时间片为单位计算。各进程的优先数或轮转时间数以及进程需运行的时间片数的初始值均由用户给定。 ③在优先数算法中，优先数的值为50与运行时间的差值，即P_TIME-process->needtime。进程每执行一次，优先数减3，CPU时间片数加1，进程还需要的时间片数减1。在轮转算法中，采用固定时间片（即：每执行一次进程，该进程的执行时间片数为已执行了2个单位），这时，CPU时间片数加2，进程还需要的时间片数减2，并排列到就绪队列的尾上。 ④对于遇到优先数一致的情况，采用FIFO策略解决。 ⑤每组最多2人，小组内要有明确分工，课程设计报告中设计部分可以相同，个人实现部分不同其中包含3个例子，最后一个有详细的文档-The design of the process scheduling algorithm Design requirements: ① design process control block PCB table structure, priority scheduling algorithm and round-robin scheduling algorithm. (2) establish a process ready queue. Prepared two different algorithms into the chain program. (3) the preparation of two types of process scheduling algorithm: 1) priority scheduling 2) round-robin scheduling Design technical parameters reference: ① This procedure using two algorithms for five processes, scheduling, each process has three states, and assuming that the initial state to the ready state. (2) In order to facilitate the processing units of a process to run longer in the program in time slices. Process priority number or the number of rotation time and the process will need to run the initial value of the number of time slices given by the user. The ③ priority number algorithm, priority number is 50 and the difference of the running time, that P_TIME-process-> n
Date : 2025-12-26 Size : 142kb User : cagfaiss
[OS Develop] Four-CPU-scheduling-algorithm DL : 0: 用c++实现的CPU四种调度算法，简单易懂-With c++ implementation of the four types of CPU scheduling algorithm, simple to understand
Date : 2025-12-26 Size : 5kb User : 高赫
[OS Develop] Priority-scheduling-algorithm DL : 0: 设计一个按优先数调度算法实现处理器调度的程序。假定系统有5个进程，每个进程用一个PCB来代表。PCB的格式为：进程名、指针、要求运行时间、优先数、状态。-Design of a number of priority scheduling algorithm processor scheduling procedures. The system has five processes, each represented by a PCB. PCB format: process name, pointer, run-time requirements, priority number, status.
Date : 2025-12-26 Size : 178kb User : 飘

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