Welcome![Sign In][Sign Up]
Location:
Search - diaodu

Search list

[Mathimatics-Numerical algorithmsdiaodu.rar

Description: 磁盘调度设计,磁盘调度算法的实现,包括  先来先服务调度算法  最短寻道优先调度算法  扫描算法  循环扫描算法  N—Step—SCAN算法
Platform: | Size: 1844 | Author: | Hits:

[Process-Thread进程diaodu

Description: 用vc编写的进程调度的源程序,我们的课程设计,可以直接运行。无错误-vc prepared using the process of scheduling the source, our curriculum design, direct running. Error-free
Platform: | Size: 2076 | Author: 小五哥哥 | Hits:

[Windows Developos-diaodu

Description: Hmily ,please give me you slove!-Hmily, please give me slove you!
Platform: | Size: 2105 | Author: 周佳卫 | Hits:

[OS Developchulijidiaodu

Description: chuliji diaodu de chengxu ,yiban de ren dounenggou kan dong
Platform: | Size: 1556 | Author: shangjingtao | Hits:

[Otherdiaodu

Description: 这是一个进程调度问题~~~~还是有很多的问题哦
Platform: | Size: 2138 | Author: 潘妍妍 | Hits:

[Process-Threaddiaodu

Description: 最短作业优先(抢占和非抢占 c语言程序基于DOS环境,是单线程工作。故要在DOS真正模仿在实际应用中的最短作业优先调度(抢占式),是难实现的。 本程序在DOS环境下实现了进程运行与程序操作的模拟同步进行。主要是应用虚拟运行算法,计算某个时候该谁占用CPU和谁已经终止了。利用虚拟运行,可以实现一种虚拟的同步操作。
Platform: | Size: 34134 | Author: 赖官铨 | Hits:

[JSP/Javadiaodu

Description: 进程调度实验 选择一个调度算法,设计实现处理机调度的程序。
Platform: | Size: 2057 | Author: 胡迪 | Hits:

[OS Developdiaodu

Description: ○1 设计进程进程控制块PCB表结构,分别适用于优先数调度算法和循环轮转调度算法。 PCB结构通常包括以下信息:进程名,进程优先数(或轮转时间片),进程所占用的CPU时间,进程的状态,当前队列指针等。根据调度算法的不同,PCB结构的内容可以作适当的增删。 ○2 建立进程就绪队列。对两种不同算法编制入链子程序。 ○3 编制两种进程调度算法:1)优先度调度;2)循环轮转调度。
Platform: | Size: 17323 | Author: 狄影 | Hits:

[Windows Developdiaodu

Description: 操作系统中关于选择一个调度算法,实现处理机的调度。
Platform: | Size: 1808 | Author: | Hits:

[Mathimatics-Numerical algorithmsdiaodu

Description: 磁盘调度设计,磁盘调度算法的实现,包括  先来先服务调度算法  最短寻道优先调度算法  扫描算法  循环扫描算法  N—Step—SCAN算法-Disk Scheduling design, disk scheduling algorithm, including
Platform: | Size: 2048 | Author: 姚军 | Hits:

[Process-Thread进程diaodu

Description: 用vc编写的进程调度的源程序,我们的课程设计,可以直接运行。无错误-vc prepared using the process of scheduling the source, our curriculum design, direct running. Error-free
Platform: | Size: 2048 | Author: 小五哥哥 | Hits:

[Windows Developos-diaodu

Description: Hmily ,please give me you slove!-Hmily, please give me slove you!
Platform: | Size: 2048 | Author: 周佳卫 | Hits:

[Otherdiaodu

Description: 这是一个进程调度问题~~~~还是有很多的问题哦-This is a process of scheduling problem ~ ~ ~ ~ still has many problems Oh
Platform: | Size: 2048 | Author: 潘妍妍 | Hits:

[Process-Threaddiaodu

Description: 最短作业优先(抢占和非抢占 c语言程序基于DOS环境,是单线程工作。故要在DOS真正模仿在实际应用中的最短作业优先调度(抢占式),是难实现的。 本程序在DOS环境下实现了进程运行与程序操作的模拟同步进行。主要是应用虚拟运行算法,计算某个时候该谁占用CPU和谁已经终止了。利用虚拟运行,可以实现一种虚拟的同步操作。 -The shortest operation priority (to seize and non-preemptive c language program based on the DOS environment is single-threaded work. Therefore, to mimic the real DOS in practical applications of the shortest operating priority scheduling (preemptive), it is difficult to achieve. This procedure in the DOS environment realize the process under the operation and procedures for the operation of simulated simultaneously. mainly the application of virtual operating algorithm, the calculation of a CPU when the occupier who is and who has been terminated. using virtual run, you can realize a virtual synchronization.
Platform: | Size: 33792 | Author: 赖官铨 | Hits:

[JSP/Javadiaodu

Description: 进程调度实验 选择一个调度算法,设计实现处理机调度的程序。-Experimental scheduling process to choose a scheduling algorithm designed to achieve processor scheduling procedures.
Platform: | Size: 2048 | Author: 胡迪 | Hits:

[OS Developdiaodu

Description: ○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.
Platform: | Size: 118784 | Author: 狄影 | Hits:

[Windows Developdiaodu

Description: 操作系统中关于选择一个调度算法,实现处理机的调度。-Operating system on the selection of a scheduling algorithm to achieve the scheduling processor.
Platform: | Size: 2048 | Author: | Hits:

[Mathimatics-Numerical algorithmsdiaodu

Description: 两台处理机A 和B处理n个作业。设第i个作业交给机器 A 处理时需要时间ai,若由机器B 来处理,则需要时间bi。由于各作 业的特点和机器的性能关系,很可能对于某些i,有ai >=bi,而对于 某些j,j!=i,有aj<bj。既不能将一个作业分开由两台机器处理,也没 有一台机器能同时处理2 个作业。设计一个动态规划算法,使得这两 台机器处理完成这n 个作业的时间最短(从任何一台机器开工到最后 一台机器停工的总时间)。研究一个实例:(a1,a2,a3,a4,a5,a6)= (2,5,7,10,5,2);(b1,b2,b3,b4,b5,b6)=(3,8,4,11,3,4)-Two processors A and B deal with n-operation. I set up the first operating the machine A treatment takes time ai, if by machine B to deal with, it takes time bi. Since the operating characteristics and performance of the machine relationship, is likely to for some i, there is ai> = bi, and for some j, j! = I, there is aj <bj. Neither can an operation separate from the two machines to deal with, nor a machine capable of simultaneously handling two operations. Design a dynamic programming algorithm, making the two machines to deal with the completion of this n the shortest operating time (from any one machine starts to the last machine downtime total time). Study an example of: (a1, a2, a3, a4, a5, a6) = (2,5,7,10,5,2) (b1, b2, b3, b4, b5, b6) = (3,8 , 4,11,3,4)
Platform: | Size: 14336 | Author: 王颖 | Hits:

[OS Developdiaodu

Description: 主要使用了时间片轮转算法和高响应比算法模拟进程的调度过程-The main use of Round Robin time slice and high response ratio algorithm simulation process for the activation process
Platform: | Size: 1896448 | Author: wuweiwei | Hits:

[OS programdiaodu

Description: 在采用多道程序设计的系统中,往往有若干个进程同时处于就绪状态。当就绪状态进程个数大于处理器数时,就必须依照某种策略来决定哪些进程优先占用处理器。本实验模拟在单处理器情况下处理器调度,帮助学生加深了解处理器调度的工作。-The introduction of multi-channel programming system, often at the same time there are a number of processes in a state of readiness. When the ready state of the process when the number is greater than the number of processors, a strategy must be in accordance with the process of priority to determine which processor occupancy. Experimental simulation of the processor in a single processor scheduling cases to help students gain a better understanding of the work of processor scheduling.
Platform: | Size: 1024 | Author: 陈明亮 | Hits:
« 12 3 »

CodeBus www.codebus.net