搜索资源列表
os5
- 进程调度算法的实现,实现先来先服务FCFS、短作业优先SJF以及时间片轮转调度算法。 -Implementation of process scheduling algorithm, first come, first service FCFS, short homework SJF priority and time slice rotation scheduling algorithm.
process-manage
- C语言作业,三类进程管理方法, 按优先数调度算法实现处理器调度, 可变分区管理方式下采用首次适应算法分配内存, 用位示图管理磁盘存储空间-C language operations, three types of process management methods, according to the number of priority scheduling algorithm processor scheduling, using the first-fit algorithm to all
RoundRobin
- java 实现 操作系统中得进程调度 短作业优先和时间片-java achieve operating system process scheduling too short job priority and time slice
pv
- 编写程序完成单处理机系统中的进程调度,要求采用①先进先出;②优先数;③最短作业优先调度算法的进程调度。实验具体包括:首先确定进程控制块的内容,进程控制块的组成方式;然后完成进程创建原语和进程调度原语;最后编写主函数对所做工作进行测试。-Write a program to complete the process scheduling of single processor system, require the use of first in first out (2) priority
Ch8_GA_JSP
- 用MATLAB软件实现遗传算法解决作业车间调度问题-Genetic algorithms using MATLAB software to solve the job shop scheduling problem
system
- 用java编写的进程调度算法,算法包含四种调度:先到先服务,短作业优先,时间片轮转,优先级优先-the suanfa is made by java.
aberrance
- 遗传算法解决作业车间调度问题,这一M文件为遗传算子的变异操作-Genetic algorithms to solve the job shop scheduling problem, the M-file for the genetic mutation operator
across
- 遗传算法解决作业车间调度问题,这一M文件为遗传算子的交叉操作-Genetic algorithms to solve the job shop scheduling problem, the M-file for the genetic operators crossover operation
cal
- 遗传算法解决作业车间调度问题,,这一M文件计算目标函数值。-Genetic algorithms to solve the job shop scheduling problem,, the M-file to calculate the value of the objective function....
caltime
- 遗传算法解决作业车间调度问题,,这一M文件计算工序的加工顺序与加工时间-Genetic algorithms to solve the job shop scheduling problem,, the M-file to calculate the value of the objective function.
JSP
- 运用遗传算法解决作业车间调度问题,此M文件为调度问题的主程序代码。-The use of genetic algorithms to solve the job shop scheduling problem, this M-file for the main program code scheduling problems.
FCFS-and-SJF
- 先来先服务FCFS和短作业优先SJF进程调度算法 有注释,简单明确-FCFS FCFS SJF process and short operating priority scheduling algorithm Notes, simple and clear
cpu
- 操作系统中的调度算法的实现,可计算出等待时间和运行时间,包括短作业优先(非抢占),轮训,和先来先服务-RR FCFS SJF
FlowOperation.cpp
- 给定n个作业,每个作业有两道工序,分别在两台机器上处理。一台机器一次只能处理一道工序,并且一道工序一旦开始就必须进行下去直到完成。一个作业只有在机器1上的处理完成以后才能由机器2处理。假设已知作业i在机器j上需要的处理时间为t[i,j]。流水作业调度问题就是要求确定一个作业的处理顺序使得尽快完成这n个作业。-Given n jobs, each job prescribe procedures were handled on both machines. A machine can only h
processdoing
- 操作系统中进程调度算法的模拟 可以实现先来先服务 短作业有限 和时间片轮转算法-Operating system scheduling algorithm in the simulation process can be achieved first-come first-serve limited and short operating time slice Round Robin
taskScheduling
- 模拟常用的操作系统进程调度算法,包括先来先服务,短作业优先,高响应比优先- Analog commonly used operating system process scheduling algorithms, including a first-come first-serve, short operating priority, high priority response ratio
Dynamic-multi-objective
- 柔性作业车间多目标动态调度
ACA
- 高级体系结构作业,指令的动态调度,流水级并行-Dynamic instruction scheduling
progress
- 通过网页展示几种进程调度算法的流程1.先来先服务调度算法(FCFS):就是按照各个作业进入系统的自然次序来调度作业。这种调度算法的优点是实现简单,公平。其缺点是没有考虑到系统中各种资源的综合使用情况,往往使短作业的用户不满意,因为短作业等待处理的时间可能比实际运行时间长得多。 2.短作业优先调度算法(SPF): 就是优先调度并处理短作业,所谓短是指作业的运行时间短。而在作业未投入运行时,并不能知道它实际的运行时间的长短,因此需要用户在提交作业时同时提交作业运行时间的估计值。 3.最高响
design
- 该算法是将sigmoid函数的变形函数应用到自适应遗传算法中,并将作业车间调度问题中的完工时间大小作为算法的评价指标,实现了交叉率和变异率随着完工时间的非线性自适应调整,较好地克服了标准遗传算法在解决作业车间调度问题时的“早熟”和稳定性差的缺点,以及传统的线性自适应遗传算法收敛速度慢的缺点。-The algorithm is the deformation function sigmoid function is applied to the adaptive genetic algorithm