Description: 由于在单道批处理系统中，作业一投入运行，它就占有计算机的一切资源直到作业完成为止，因此调度作业时不必考虑它所需要的资源是否得到满足，它所占用的CPU时限等因素。 每个作业由一个作业控制块JCB表示，JCB包括如下信息：作业名、提交时刻、所需运行时间、所需资源、作业状态、链指针等。 在程序开始时对用户提交的作业按作业调度算法排列，用链表形式存储，这里分别采用先来先服务、短作业、响应比高者优先调度算法对作业进行调度。这里为了操作者的方便，每个作业无论所需运行时间多少，都是每敲一次键盘就执行完一个作业。每个作业完成后打印作业的开始运行时刻，完成时刻，周转时间和带权周转时间，一组作业完成后打印这组作业的平均周转时间，带权周转时间。所以要在运行时对运行时间进行记录，这里设置几个全局变量：T时间量； ttime总周转时间； trtime总的带权周转时间。-Road due to the single-batch system, and put into operation an operation, it has all the resources of the computer until the operation is completed, the dispatch operation when it's not necessary to consider whether the resources needed to be met, it occupied by the CPU time and other factors. Each operation by operating a control block JCB, JCB include the following information : operations, and submitted moment, the run time, the resources required, operational state, chain pointer. At the beginning of the procedure to users of operations by scheduling algorithm with using forms Chain store, were used here first-come first-serve, short operations, response is high priority scheduling algorithm scheduling of the operation. Here in order to facilitate the operation of each operation ir Platform: |
Size: 3648 |
Author:江大 |
Hits:
Description: c程序模拟操作系统的先来先服务算法(FCFS).
在VC 6.0下运行通过/
-c simulation of the operating system first-come first-serve algorithm (FCFS). 6.0 in VC run through / Platform: |
Size: 1369 |
Author:刀尖 |
Hits:
Description: 单道系统作业调度:作业调度算法：分别采用先来先服务(fcfs)、最短作业优先(sjf)、响应比高者优先(hrn)的调度算法。
多道系统作业调度:作业调度算法：采用先来先服务(fcfs),即按作业提交的先后次序进行调度。总是首先调度在系统中等待时间最长的作业。-Shan Road System Operation : Job Scheduling Algorithm : By using the first-come first-serve (fcfs) the shortest operating priority (sjf), the response is high priority (applications) scheduling algorithm. Multiple System Operation : Job Scheduling Algorithm : The first-come first-serve (fcfs) according to the work order dispatching. Scheduling is always first in the system waiting for the longest time work. Platform: |
Size: 42449 |
Author:风飘零 |
Hits:
Description: 是关于CPU进程调度的模拟程序，可以实现三种算法的进程调度：先来先服务，短进程优先，最高优先级。是操作系统的大作业。-is on the CPU scheduling process simulation program that can be achieved in three of process scheduling algorithm : first-come first-serve, short process priority, the highest priority. The operating system is operating. Platform: |
Size: 129067 |
Author:赵佳 |
Hits:
Description: 昨夜调度程序
1.按输入创建工作队列
2打印输入作业
3.先来先服务
4.按到达时间排序
5.按先来先服务进行相关计算-last night for a scheduler. According to the importation of work to create Print Queue 2 3 importation operations. First-come first-serve 4. On arrival time Scheduling 5. according to first-come first-related computing services Platform: |
Size: 3672 |
Author:jean |
Hits:
Description: 本程序实现FCFS先来先服务，SPF短进程优先，FPF_Reaved抢占式高优先级，TimePiece时间片轮转这四种进程调度算法。
程序运行时根据提示选择相应进程调度算法，然后调用函数GetRandProc(LPVOID lpParam)（程序专门为该函数开辟新的线程）产生随机进程并将其插入到就绪队列中然后再用相应的进程调度算法调度进程运行。
-the program FCFS first-come first-serve, SPF short process priority, Preemptive FPF_Reaved high-priority, TimePiece time to rotate the four-process scheduling algorithm. Running time prompted the selection process scheduling algorithm, then the function call GetRandProc (LPVOID lpParam) (specialized procedures for the letter several open up new threads) random process and will be inserted into its place queue Then the corresponding process scheduling algorithm scheduling The process runs. Platform: |
Size: 21730 |
Author:mayfar |
Hits:
Description: 对于CPU线程调度的模拟，CPU threads control simulation，包括first come first serve算法和run rubbing等，同时输出线程开始，切换，结束等信息。-CPU thread scheduling for the simulation, CPU threads control simulation. including the first come first serve and run rubbing algorithm. Meanwhile output threads, switching to end such information. Platform: |
Size: 25898 |
Author:Jerry C. |
Hits:
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: 7343 |
Author:飞扬 |
Hits:
Description: 作业调度采用运行时间最短者优先算法，运行时间相同者采用先来先服务算法。-Job Scheduling using the shortest running time priority algorithm, the running time to adopt the same first-come first-serve algorithm. Platform: |
Size: 8529 |
Author:王丹 |
Hits:
Description: 操作系统概论，应用原理与编程技巧及其应用。本人见解肤浅，近请原谅。...机分配给进程以及协调各个进程之间的相互关系。它由进程调度程序和.. .进程调度是低级调度,作业调度是高级调度。 14进程调度算法有:先来先服务 轮转调度分级轮转法和优先数法。其中分级轮转法较为理想。-OS Studies, Theory and Application Programming Techniques and Applications. I superficial insights, please forgive the past. ... Machines allocated to the process and the coordination between the various processes mutual relations. It is the process of scheduling procedures and ... Process scheduling is vulgar scheduling, scheduling senior scheduling. Process Scheduling Algorithm 14 : first-come first-serve Web postings of France scheduling classification and priority numbers. Classification Act which rotate better. Platform: |
Size: 219770 |
Author:语言 |
Hits:
Description: 实现了先来先服务算法，可以作为大家学习的参考-Realize a first-come first-serve algorithm, can be used as the reference U.S. study Platform: |
Size: 174080 |
Author:天地 |
Hits:
Description: 一、目的要求
用高级语言编写和调试一个进程调度程序，以加深对进程的概念及进程调度算法的理解。
二、例题： 设计一个有 N个进程共行的进程调度程序。
进程调度算法：采用最高优先数优先的调度算法（即把处理机分配给优先数最高的进程）和先来先服务算法。
每个进程有一个进程控制块（ PCB）表示。进程控制块可以包含如下信息：进程名、优先数、到达时间、需要运行时间、已用CPU时间、进程状态等等。
-First, the purpose of high-level language requires a process of writing and debugging scheduling procedures in order to deepen their understanding of the process of the concept and understanding of the process of scheduling algorithm. Second, Example: Design of a total of N months the process of the process of scheduling procedures. The process of scheduling algorithm: The number of priority of the highest priority scheduling algorithm (that is, the number of processors allocated to the highest priority to the process) and first-come first-serve algorithm. Each process is a process control block (PCB) said. Process control block can contain the following information: the process name, priority number, arrival time, need to run the time, has spent CPU time, the process of state and so on. Platform: |
Size: 74752 |
Author:Anson |
Hits:
Search - first come first serve