Description: 磁盘调度算法 1。实现三种算法： 1。先来先服务 2。最短寻道优先（可自己假设当前磁头的位置） 3。电梯算法 2。磁道服务顺序从指定的文本文件（TXT文件）中取出 3。输出： 第一行：磁道的服务顺序 第二行：显示移动总道数-a disk scheduling algorithms. Three algorithms to achieve : 1. First-come first-serve two. Seeking shortest priority (to be their head the assumption that the current location) 3. Elevator Algorithm 2. Track services from the designated order of the text document (TXT) out of three. Output : the first line : track the order of the second line services : Road show that the total number of mobile Platform: |
Size: 7168 |
Author:飞扬 |
Hits:
Description: 为了更好学习和掌握CPU调度的各种算法，现实践练习编程，源程序里运用大量所学的C语言程序，在较好的理解CPU调度各种算法下，编写的此程序实现的功能是“最短作业优先调度”，经多次反复修改，现已能在TC环境下运行通过。-order to better study and master CPU scheduling algorithms, programming is practical exercises, the source Lane used a lot of learning by C language program, a better understanding of the CPU scheduling algorithms, the preparation of this program function is to "minimum operating priority scheduling," by repeatedly amended , TC is now able to run through the environment. Platform: |
Size: 1024 |
Author:蒋涛 |
Hits:
Description: 自己看磁盘调度算法要的自己载磁盘调度算法-look disk-scheduling algorithms to set its own disk scheduling algorithm Platform: |
Size: 1024 |
Author:chenyi |
Hits:
Description: 编程序实现下述磁盘调度算法,并求出每种算法的平均寻道长度，要求设计主界面以灵活选择某算法，且以下算法都要实现：
1、先来先服务算法（FCFS）
2、最短寻道时间优先算法（SSTF）
3、扫描算法（SCAN）
4、循环扫描算法（CSCAN）
-programmed to achieve the following disk-scheduling algorithms, and each algorithm calculated the average Seeking length, main interface designed in a flexible choice of a particular algorithm and the algorithm must achieve the following : 1. first-come first-service algorithm (FCFS queue) 2, the shortest tracking time priority algorithm (SSTF), 3 scanning algorithm (SCAN) 4, cycle scanning algorithm (rltrasonic) Platform: |
Size: 152576 |
Author:张宁 |
Hits:
Description: 1、 ：编写并调试一个模拟的进程调度程序，采用“最高优先数优先”调度算法对进程进行调度。 “最高优先数优先调度算法的基本思想是把CPU分配给就绪队列中优先数最高的进程。尝试静态优先数与动态优先数两种方法：
a) 静态优先数是指优先数在整个进程运行期间不再改变。优先数可以在数据输入时指定，也可以根据到达顺序、运行时间确定。
b) 动态优先数是指进程的优先数在创建进程时可以给定一个初始值，并且可以按一定原则修改优先数。例如进程获得一次CPU后就将其优先数减少1。或者进程等待的时间超过某一时限时增加其优先数的值。
2、 编写并调试一个模拟的进程调度程序，模拟实现多级反馈队列调度算法。
3、 编写并调试一个模拟的进程调度程序，模拟实现最低松弛度优先算法。
4、 程序与报告要求：
a) 对上述要求1、2、3，至少要完成一项，鼓励尝试多种算法。
b) 输出结果要尽量详细清晰，能够反映调度后队列变化，PCB内部变化。
c) 可以选择在Windows或Linux环境下编写、运行程序
d) 鼓励使用不同的开发工具在不同平台环境上进行开发比较。
e) 在实验报告中，一方面可以对实验结果进行分析，一方面可以对各种算法进行比较，分析它们的优劣，说明各种算法适用于哪些情况下的调度。
-1 : Prepare a simulation and debugging process scheduling procedures, "Priority number of the highest priority" to the process of scheduling algorithms for scheduling. "Highest priority priority scheduling algorithm for the basic idea is to place the CPU allocated to the priority queue highest process. Taste Examination several static and dynamic priority priority number two methods : a) static priority number is priority number in operation during the entire process will not change. priority number in the designated input data, can be reached under the order, running time determine. b) dynamic priority number refers to several priorities for the process of the creation process can be given an initial value, and according to the principle of amending certain priority number. Platform: |
Size: 1217536 |
Author:huiting_liu |
Hits:
Description: 一、目的要求
用高级语言编写和调试一个或多个作业调度的模拟程序，以加深对作业调度算法的理解。
二、例题：为单道批处理系统设计一个作业调度程序。
由于在单道批处理系统中，作业一投入运行，它就占有计算机的一切资源直到作业完成为止，因此调度作业时不必考虑它所需要的资源是否得到满足，它所占用的 CPU时限等因素。
作业调度算法：采用先来先服务（FCFS）调度算法，即按作业提交的先后次序进行调度。总是首先调度在系统中等待时间最长的作业。
-First, the purpose of high-level language requires writing and debugging of one or more job scheduling simulation procedures in order to deepen their understanding of job scheduling algorithms. B, Example: In order to single-channel system, the design of a batch job scheduling procedures. Road as a result of a single batch system, the operation of a put into operation, it would occupy all the resources until the computer s operation has been completed, so no need to consider when scheduling operation of the resources it needs are met, it is occupied by factors such as CPU time limit. Scheduling Algorithm: The First Come First Served (FCFS) scheduling algorithm, that is, according to the order of operations submitted for scheduling. Scheduling is always first in the system waiting for the longest operations. Platform: |
Size: 73728 |
Author:Anson |
Hits:
Description: 进程的三种调度算法，先来先服务，短作业优先，时间片轮转。-The process of the three scheduling algorithms, first-come, first serve, short operating priority, time slice rotation. Platform: |
Size: 1024 |
Author:孙雄 |
Hits:
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:
Description: 进程调度算法：采用最高优先数优先的调度算法（即把处理机分配给优先数最高的进程）和先来先服务算法。
每个进程有一个进程控制块（ PCB）表示。进程控制块可以包含如下信息：进程名、优先数、到达时间、需要运行时间、已用CPU时间、进程状态等等。
进程优先数及需要的运行时间可以事先人为地指定（也可以由随机数产生）。进程的到达时间为进程输入的时间。进程的运行时间以时间片为单位进行计算。
-The process of scheduling algorithms: the use of the highest priority number of priority scheduling algorithm (ie the number of processors allocated to the highest priority process) and first-come first-serve algorithm. Each process has a process control block (PCB) said. Process control block can contain the following information: process name, priority number, arrival time, the need for run-time, has spent CPU time, the process of state and so on. Process priority number and needs of the running time can be artificially designated in advance (you can also by the random number generator). Process input arrival time for the process time. The process of running time to time slice is calculated as a unit. Platform: |
Size: 1024 |
Author:110 |
Hits:
Description: 嵌入式实时系统中关键技术的研究(博士论文)实时操作系统在多媒体通信、在线事务处理、生产过程控制、交通控制等各个领域得到广泛的应用，因而越来越引起人们的重视。而进程调度策略是影响系统实时性能的重要因素。因此我在此对实时进程调度进行研究。-real-process Scheduling. This article is based on reading source code of Linux, reference many books and articles.The idea of this article is useful for the Real-time process Scheduling Algorithms ~~~~ Platform: |
Size: 1099776 |
Author: |
Hits:
Description: 磁盘调度算法:包括先来先服务算法，最短寻道时间算法，电梯寻道算法。-Disk scheduling algorithms: including a first-come first-served algorithm, the shortest seek time algorithm, elevator seek algorithm. Platform: |
Size: 1024 |
Author:lzh |
Hits:
Description: 一些有关hsdpa中分组调度的经典算法文献，对于初学者很有帮助-Some of the classic hsdpa packet scheduling algorithms in the literature, very helpful for beginners Platform: |
Size: 2416640 |
Author:邢昊 |
Hits:
Description: a program that implements the following disk-scheduling algorithms:
FCFS, SSTF, SCAN, C-SCAN, Look and C-Look Platform: |
Size: 7168 |
Author:MOHAMAD REZA |
Hits:
Search - scheduling Algorithms