Search - scheduling n m

Search - scheduling n m - List

[Windows Develop] yemianzhihuan DL : 0: 设计程序模拟先进先出FIFO，最佳置换OPI和最近最久未使用LRU页面置换算法的工作过程。假设内存中分配给每个进程的最小物理块数为m，在进程运行过程中要访问的页面个数为n，页面访问序列为P1, … ,Pn，分别利用不同的页面置换算法调度进程的页面访问序列，给出页面访问序列的置换过程，计算每种算法缺页次数和缺页率。-Design program to simulate FIFO FIFO, the best and most recent displacement most-recently-used OPI LRU page replacement algorithm of the work process. Assuming the memory allocated to each process a minimum number of physical blocks is m, the process is running in the page number to access is n, the page access sequence P1, ..., Pn, respectively, the use of different page replacement algorithm for scheduling process page access sequence, given the sequence of the replacement process to access the page to calculate the number of page faults for each algorithm and the missing page rate.
Date : Size : 1.63mb User : gst
[Data structs] 2 DL : 0: 飞机调度这用链表处理的飞机调度问题，飞机场有n架飞机m条跑道，飞机起飞一次用时k。给出飞机来时的时间安排跑道。-Aircraft scheduling
Date : Size : 16kb User : 张开
[Algorithm] CDS DL : 0: CDS(Campbell-Dudek-Simth)：是Johnson算法的扩展，被认为是好的具有鲁棒性的启发式算法。用于求解n-job，m-machine的流水作业调度问题；即n项作业都需要顺序进行m个工序，m个工序中，每道工序仅有一台机器，如何安排n项作业的加工先后关系。-CDS (Campbell-Dudek-Simth): an extension of the Johnson algorithm is considered robust heuristic algorithm is good. Used to solve the n-job, m-machine flowshop scheduling problem the n tasks require the order of m processes m a process, each process is just a machine, how to arrange the the n job processing has relationship .
Date : Size : 1kb User : 郁小芳
[AI-NN-PR] encode-and-decode-of-shop-job DL : 0: 用于车间调度的编码和解码。 encode函数用于生成M*N的编码数组。M为机器数，N为工件数。 Jm数组的行，表示对应工件在不同机器上的加工顺序。数组内容为机器号。 T数组为加工时间数组。第M行第N列，表示第N号工件在第M号机器上的加工时间。程序采用先判断对应机器上是否有空间满足插空标准，处理后，再判断是否产生新的空间。 decode解码函数最终需要求得，在M个机器中，所用的最长时间，也就是最大完成时间，作为解码的结果。-For shop scheduling encoding and decoding. The encode function used to generate the array of M* N coding. M is the number of machines, N is the number of workpieces. Jm row of the array, which means that the corresponding workpiece machining sequences on different machines. The contents of the array is the number of the machine. T array is an array of processing time. The first N columns of the M-th row, which means that the processing time of the workpiece in the machine M N. The program uses to determine whether there is space to meet the inserted empty standard corresponding to the machine, processing, and then to determine whether a new space. decode decoding function will eventually need to be obtained, M machine, the best time, which is the maximum completion time, as a result of the decoding.
Date : Size : 2kb User : 郑世杰
[Data structs] Job DL : 0: 要求给出一种作业调度方案，使所给的n个作业在尽可能短的时间内由m台机器加工处理完成。约定，每个作业均可在任何一台机器上加工处理，但未完工前不允许中断处理。作业不能拆分成更小的子作业。-Required to give a scheduling program, so as to the n operations in the shortest possible time by the m-machine processing. Convention, each job can be processed on any machine, but not completed before the interrupt handler is not allowed. Jobs can not be split into smaller sub-jobs.
Date : Size : 1kb User : 刘远忠
[Technology Management] P2Pmodel DL : 0: 应用排队理论证明了P2P流媒体系统在稳态时可模型化为多个M/M/n排队系统串联的排队链,在此基础上以节点的播放缓存状态为研究对象,建立了P2P流媒体系统的稳态传输模型。考察了不同chunk调度策略下节点的传输特性,以此验证模型的准确性,并进一步考察了P2P流媒体节点数量、节点缓存大小对传输特性的影响。更多还原-Application of queuing theory to prove the P2P streaming system can be modeled in the steady state multiple M/M/n queuing system tandem queuing chain, on the basis of the state of the node cache to play as the research object, the establishment of a P2P streaming steady-state transmission model of the system. Examines the transmission characteristics under different chunk scheduling policy node, used to verify the accuracy of the model and further investigate the number of affected nodes cache size on the transmission characteristics of P2P streaming nodes. More Restore
Date : Size : 1.02mb User : 唐琴
[ERP-EIP-OA-Portal] JSPGA DL : 1: 车间流水作业调度问题，遗传算法，m个任务n道工序-Assembly-line shop scheduling problem, genetic algorithms, m n processes tasks
Date : Size : 425kb User : 吴其生
[OS program] multi_schedule DL : 0: 用C++实现的多机调度算法。问题描述：要求给出一种作业调度方案，使所给的n个作业在尽可能短的时间内由m台机器加工处理完成。约定，每个作业均可在任何一台机器上加工处理，但未完工前不允许中断处理。作业不能拆分成更小的子作业。-C++ achieve multi-machine scheduling algorithm used. Problem Description: required to give a scheduling program, so as to the n operations in the shortest possible time by the m-machine processing. Convention, each job can be processed on any machine, but not completed before the interrupt handler is not allowed. Jobs can not be split into smaller sub-jobs.
Date : Size : 1kb User : 威仔F
[Windows Develop] jsj11234_6 DL : 0: 设计程序模拟先来先服务FCFS，最短寻道时间优先SSTF，SCAN和循环SCAN算法的工作过程。假设有n个磁道号所组成的磁道访问序列，给定开始磁道号m和磁头移动的方向（正向或者反向），分别利用不同的磁盘调度算法访问磁道序列，给出每一次访问的磁头移动距离，计算每种算法的平均寻道长度。-Design program to simulate the first come first served FCFS, shortest seek time first SSTF, the working process of SCAN and cyclic SCAN algorithm. Assuming a n track number composed of the access sequence, given start track number m and head movement direction (forward or backward), respectively, using the disk scheduling algorithms of different access track sequence, head movement distance are given every visit, calculating the average search length of each kind of algorithm.
Date : Size : 38kb User : ddddddd4
[Other] chejiandiaodu DL : 0: 流水线型车间作业调度问题可以描述如下：n个任务在流水线上进行m个阶段的加工，每一阶段至少有一台机器且至少有一个阶段存在多台机器，并且同一阶段上各机器的处理性能相同，在每一阶段各任务均要完成一道工序，各任务的每道工序可以在相应阶段上的任意一台机器上加工，已知任务各道工序的处理时间，要求确定所有任务的排序以及每一阶段上机器的分配情况，使得调度指标(一般求Makespan)最小。下面的源码是求解流水线型车间作业调度问题的遗传算法通用MATLAB源码，属于GreenSim团队原创作品，博客上发布的是不完全的源码，本人将其补充完成已成功运行，转载请注明GreenSim团队原创作品。-Pipelined job-shop scheduling problem can be described as follows: n tasks on the assembly line m processing stages, each stage has at least one machine and at least one stage there are multiple machines, and the same processing performance of each machine on the same stage , at every stage to complete each task are a process, each process of each task can be processed on any machine on the corresponding stage of the processing time of each process known tasks, all tasks required to determine the sort and every Distribution of the machine on a stage, making scheduling index (typically seek Makespan) Min. The following code is a Genetic Algorithm for Job Shop Scheduling Problem pipelined general MATLAB source code, original works belong GreenSim team, the blog post is incomplete source code, I will supplement has been successfully completed its operation, please indicate the original team GreenSim works.
Date : Size : 3kb User : yyl
[OS program] processscheduling DL : 0: 有n个进程处于就绪状态，有m个进程处于阻塞状态。采用轮转法进程调度算法进行调度(调度过程中，假设处于执行状态的进程不会阻塞)，且每过t个时间片系统释放资源，唤醒处于阻塞队列队首的进程-There are n processes in the ready state, there are m process is blocked. Process scheduling algorithm using round robin scheduling (scheduling process, it is assumed in the execution state does not block), and each piece of the system over time t release resources, the process of blocking queue first team in wake
Date : Size : 252kb User : 张三
[OS Develop] FIFO DL : 0: 设计程序模拟FIFO页面置换算法的工作过程。假设内存中分配给每个进程的最小物理块数为m，在进程运行过程中要访问的页面个数为n，页面访问序列为P1, … ,Pn，分别利用不同的页面置换算法调度进程的页面访问序列，给出页面访问序列的置换过程，并计算每种算法缺页次数和缺页率。-The design process of the analog FIFO page replacement algorithm work process. Suppose the minimum number of physical blocks allocated to each process in memory is m, the page number in the process during operation to access to n, page views sequence P1, ..., Pn, each with different page replacement algorithm scheduling process page access sequence permutation process given page access sequences, and each algorithm calculated the number of missing pages and page rate.
Date : Size : 27kb User : 江啸澜
[Other] 02MATLAB DL : 0: 流水线车间生产调度的遗传算法MATLAB源代码 n个任务在流水线上进行m个阶段的加工，每一阶段至少有一台机器且至少有一个阶段存在多台机器，并且同一阶段上各机器的处理性能相同，在每一阶段各任务均要完成一道工序，各任务的每道工序可以在相应阶段上的任意一台机器上加工，已知任务各道工序的处理时间，要求确定所有任务的排序以及每一阶段上机器的分配情况，使得调度指标(一般求Makespan)最小-Line workshop production scheduling genetic algorithm MATLAB source code n task m phase of the process on the assembly line, each phase and at least one machine exist multiple machines at least one stage, and all the same, the processing performance of the machine on the same phase in each stage of the task to complete the procedure, the task of every working procedure can be found in the corresponding stage of any one machine processing, known task processing time of each working procedure request sort of all the tasks and each stage of the distribution of the machine, making scheduling index minimum Makespan (o)
Date : Size : 19kb User : 樊奕
[AI-NN-PR] GA_Flow-Shop DL : 1: 流水线型车间作业调度问题可以描述如下：n个任务在流水线上进行m个阶段的加工，每一阶段至少有一台机器且至少有一个阶段存在多台机器，并且同一阶段上各机器的处理性能相同，在每一阶段各任务均要完成一道工序，各任务的每道工序可以在相应阶段上的任意一台机器上加工-Pipelined job shop scheduling problem can be described as follows: n tasks for the m-th stage processing on the assembly line, there is at each stage of the at least one machine with at least the presence of many machines a stage, and the same processing performance of each machine on the same stage , at each stage any machine each task required to complete a process, each process of each task can be processed in the respective stages
Date : Size : 3kb User : chaoshuai
[GUI Develop] 数据结构程序设计机器调度问题 DL : 0: 多机调度问题的解决方案，算法进行合理调度，使得在m台机器上处理n个作业所需要的处理时间最短。(The solution of multi machine scheduling problem)
Date : Size : 152kb User : 程程1223
[matlab] crossover DL : 1: 负载均衡调度问题：假设有N个任务，需要负载均衡器分配给M个服务器节点去处理。每个任务的任务长度、每台服务器节点（下面简称“节点”）的处理速度已知，请给出一种任务分配方式，使得所有任务的总处理时间最短。crossover(Load balancing scheduling problem: suppose there are n tasks, which need to be allocated to m server nodes by load balancer. The task length of each task and the processing speed of each server node (hereinafter referred to as "node") are known. Please provide a task allocation method to minimize the total processing time of all tasks.crossover)
Date : Size : 2kb User : 言木

« 1 2»