搜索资源列表
Disk
- 操作系统中磁盘调度算法，java实现，包括电梯算法，EA算法，fcfs算法等-Operating system, disk scheduling algorithms, java implementation, including the elevator algorithm, EA algorithm, fcfs, algorithms
cipandiaodu
- 磁盘调度算法的课程设计，包扩FCFS,SSTF,SCAN，CSCAN，使用C++完成-Disk scheduling, curriculum design, including expansion of the FCFS, SSTF, SCAN, CSCAN, use the C + + to complete
FCFS
- 处理机调度算法里的先到先服务算法实现（C语言模拟实现）-First come first server
fifo
- FIFO is an acronym for First In, First Out, an abstraction related to ways of organizing and manipulation of data relative to time and prioritization. This expression describes the principle of a queue processing technique or servicing conflicting de
FCFS
- 实现了操作系统中先来先服务的算法，内容较简洁-The operating system first come, first serve algorithm, more concise content
OSTest3
- 1． 本实验是模拟操作系统的磁盘寻道方式，运用磁盘访问顺序的不同来设计磁盘的调度算法。实现的磁盘调度算法有FCFS，SSTF，SCAN，CSCAN和 NStepSCAN算法。 -A. This experiment is a simulation of the operating system disk seek ways to use different disk access order to design a disk scheduling algorithm. Implementat
FCFSandSJf
- 模拟了操作系统中的两种调度算法-FCFS和SJF。- Simulate the two scheduling algorithms in operating system-FCFS queue and SJF.
cos
- 由C编写的实现os进程FCFS和SJF两种算法调度-Written in C to achieve os process FCFS and SJF two algorithms scheduling
FCFS
- 操作系统-先进先出进程调度算法，输入的开始时间默认从0开始，且顺序增加。-Operating system- first in, first out of the process of scheduling algorithm, the start time of the input default to 0 and the increase of the order.
fcfs
- 用易于实现，简单可行的代码 实现进程的先进先出 VC-process first in first out
operating-system
- 计银行家算法,void FCFS(int Han,int DiscL[]) //先来先服务算法(FCFS) void SSTF(int Han,int DiscL[]) //最短寻道时间优先算法(SSTF) int SCAN(int Han,int DiscL[],int x,int y) //扫描算法(SCAN) void CSCAN(int Han,int DiscL[]) //循环扫描算法(CSCAN) void N_Step_SCAN(int Han1,int DiscL
FZYDDzipi
- 先来先服务（FCFS）算法、短作业优先（SJF）算法、高响应比（HRN）算法和高优先权算法来实现作业调度算法的模拟。（1）算法采用下式计算响应比： 等待时间waittime 需要要运行时间requesttime（2）高优先权算法采用下述公式计算优先权： 优先权priority*等待时间waittime 需要运行时间requesttime*紧迫程度quick -First come, first serve (FCFS) algorithm, short job priority (SJF)
PFCFFSzipr
- 编制一段程序源码，对所输入的若干作业，按FCFS算法模模拟调度，观察、记录并分析调度的输出结果情况 -The preparation of a program source code, enter the number of jobs, according to the FCFS algorithm mode simulation scheduler to observe, record and analyze the output of the scheduling situation
FZYDD11i
- 先来先服务算法（FCFS），短作业算法（SJF），高响应比算法（HRN）和高优先权优先算法是作业调度度总经常采用的，通过上述算法的模拟加深对作业控制块JCB的理解和作业调度过程的实现技巧。 -Algorithm (FCFS) first-come, first-served the short operating algorithm (SJF), high response first algorithm than the algorithm (HRN) and high-priority
FCFSGUI
- FCFS CPU Scheduling Java Program with GUI
OS-process-
- 该段代码为操作系统进程调度的算法分析，内含三种算法FCFS、SJF、时间片轮转，在程序结束之前会对三种算法进行简单的分析。-The sections of the code for the operating system process scheduling algorithm analysis, containing three algorithms FCFS, SJF, time slice rotation, a simple analysis is interested in the
os
- 一个操作系统的进程调度的实验。三种调度算法分别为 FCFS、优先级、时间片轮转。 其中优先级算法设置了三个级别的优先级。分别为0、1、2 。0为最高 2为最低。-An operating system process scheduling experiment. The three scheduling algorithm respectively FCFS, priority, time slice rotation. The priority algorithm set three leve
22.01
- 编写并调试一个模拟的进程调度程序，采用“轮转法”调度算法对五个进程进行调度。 轮转法可以是简单轮转法、可变时间片轮转法，或多队列轮转法。 简单轮转法的基本思想是：所有就绪进程按 FCFS排成一个队列，总是把处理机分配给队首的进程，各进程占用CPU的时间片相同。如果运行进程用完它的时间片后还为完成，就把它送回到就绪队列的末尾，把处理机重新分配给队首的进程，直至所有的进程运行完毕。-Write and debug a simulation of the process schedul
FCFS
- 作业调度 采用先来服务调度算法 进程调度采用时间片轮换-First to serve job scheduling scheduling algorithm