Search - scheduling n m

Search - scheduling n m - List

[Windows Develop] 多机调度问题 DL : 0: 多机调度问题要求给出一种作业调度方案，使所给的n个作业在尽可能短的时间内由m台机器加工处理完成。这个问题是NP安全问题，到目前为止还没有有效的解法。对于这一类问题，用贪心选择策略有时可以设计出较好的近似算法。-machine scheduling problems required to give a scheduling program, so as to the n operations in the shortest possible time by the m-machine processing completed. The problem is NP security issues, so far no effective solution. For this type of issue, greedy strategy can sometimes choose to design a better approximation algorithm.
Date : 2008-10-13 Size : 1.48kb User : 姚翊
[Windows Develop] 多机调度问题 DL : 0: 多机调度问题要求给出一种作业调度方案，使所给的n个作业在尽可能短的时间内由m台机器加工处理完成。这个问题是NP安全问题，到目前为止还没有有效的解法。对于这一类问题，用贪心选择策略有时可以设计出较好的近似算法。-machine scheduling problems required to give a scheduling program, so as to the n operations in the shortest possible time by the m-machine processing completed. The problem is NP security issues, so far no effective solution. For this type of issue, greedy strategy can sometimes choose to design a better approximation algorithm.
Date : 2025-12-18 Size : 1kb User : 姚翊
[Windows Develop] shiyan1 DL : 0: M/M/1单服务台或M/M/S(n)排队系统仿真（用事件调度法实现离散事件系统仿真） -M/M/1 single desk or M/M/S (n) Queuing System Simulation (Event Scheduling Method using Discrete Event System Simulation)
Date : 2025-12-18 Size : 80kb User : 布布
[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 : 2025-12-18 Size : 1.63mb User : gst
[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 : 2025-12-18 Size : 38kb User : ddddddd4