Description: 本次程序的题目为：进程管理——支持多个进程并发运行的简单的进程管理模拟系统，对本实验的分析要求是：⑴系统中的同步机构采用信号量上的P、V操作的机制；⑵控制机构包括阻塞和唤醒操作；⑶时间片中断处理程序处理模拟的时间片中断；⑷进程调度程序负责为各进程分配处理机；⑸根据用户的需求来创建n个进程(n为即满足用户需求,又不超出系统可容的最大进程数),各进程互斥地访问使用临界资源 S1、S2；⑹使用动态优先数(如：随阻塞次数的增加而减小优先数，以提高其优先权)；⑺进程结束后应能够撤消；⑻进程间能实现“发送”和“接收”两个消息缓冲通信操作；⑼系统在运行过程中随机打印出各进程的状态变换过程、系统的调度过程及公共变量的变化情况，在一个进程运行完毕，进入完成状态后，可以将该进程撤消，也可以动态的创建另一个新的进程。-the procedures on the topic of : process management -- to support multiple concurrent processes running a simple process management simulation system for the analysis of the experimental requirements are : 1 system of institutions using synchronous signals on the amount of P, V operation of the mechanism; 2 control agencies, including obstruction and awaken operation ; 3-time interrupt handling procedures-time simulation of interruption; 4 process scheduler is responsible for the allocation process processors; together according to the user's needs to create process n (n that meet user needs, without exceeding the system can accommodate the largest number of processes), the process of mutual Stating visit to the use of critical resources S1, S2; building a Dynamic priority number (eg : Platform: |
Size: 19820 |
Author:赵利君 |
Hits:
Description: 本次程序的题目为：进程管理——支持多个进程并发运行的简单的进程管理模拟系统，对本实验的分析要求是：⑴系统中的同步机构采用信号量上的P、V操作的机制；⑵控制机构包括阻塞和唤醒操作；⑶时间片中断处理程序处理模拟的时间片中断；⑷进程调度程序负责为各进程分配处理机；⑸根据用户的需求来创建n个进程(n为即满足用户需求,又不超出系统可容的最大进程数),各进程互斥地访问使用临界资源 S1、S2；⑹使用动态优先数(如：随阻塞次数的增加而减小优先数，以提高其优先权)；⑺进程结束后应能够撤消；⑻进程间能实现“发送”和“接收”两个消息缓冲通信操作；⑼系统在运行过程中随机打印出各进程的状态变换过程、系统的调度过程及公共变量的变化情况，在一个进程运行完毕，进入完成状态后，可以将该进程撤消，也可以动态的创建另一个新的进程。-the procedures on the topic of : process management -- to support multiple concurrent processes running a simple process management simulation system for the analysis of the experimental requirements are : 1 system of institutions using synchronous signals on the amount of P, V operation of the mechanism; 2 control agencies, including obstruction and awaken operation ; 3-time interrupt handling procedures-time simulation of interruption; 4 process scheduler is responsible for the allocation process processors; together according to the user's needs to create process n (n that meet user needs, without exceeding the system can accommodate the largest number of processes), the process of mutual Stating visit to the use of critical resources S1, S2; building a Dynamic priority number (eg : Platform: |
Size: 27800 |
Author:赵利君 |
Hits:
Description: 本次程序的题目为：进程管理——支持多个进程并发运行的简单的进程管理模拟系统，对本实验的分析要求是：⑴系统中的同步机构采用信号量上的P、V操作的机制；⑵控制机构包括阻塞和唤醒操作；⑶时间片中断处理程序处理模拟的时间片中断；⑷进程调度程序负责为各进程分配处理机；⑸根据用户的需求来创建n个进程(n为即满足用户需求,又不超出系统可容的最大进程数),各进程互斥地访问使用临界资源 S1、S2；⑹使用动态优先数(如：随阻塞次数的增加而减小优先数，以提高其优先权)；⑺进程结束后应能够撤消；⑻进程间能实现“发送”和“接收”两个消息缓冲通信操作；⑼系统在运行过程中随机打印出各进程的状态变换过程、系统的调度过程及公共变量的变化情况，在一个进程运行完毕，进入完成状态后，可以将该进程撤消，也可以动态的创建另一个新的进程。-the procedures on the topic of : process management-- to support multiple concurrent processes running a simple process management simulation system for the analysis of the experimental requirements are : 1 system of institutions using synchronous signals on the amount of P, V operation of the mechanism; 2 control agencies, including obstruction and awaken operation ; 3-time interrupt handling procedures-time simulation of interruption; 4 process scheduler is responsible for the allocation process processors; together according to the user's needs to create process n (n that meet user needs, without exceeding the system can accommodate the largest number of processes), the process of mutual Stating visit to the use of critical resources S1, S2; building a Dynamic priority number (eg : Platform: |
Size: 19456 |
Author:赵利君 |
Hits:
Description: 本次程序的题目为：进程管理——支持多个进程并发运行的简单的进程管理模拟系统，对本实验的分析要求是：⑴系统中的同步机构采用信号量上的P、V操作的机制；⑵控制机构包括阻塞和唤醒操作；⑶时间片中断处理程序处理模拟的时间片中断；⑷进程调度程序负责为各进程分配处理机；⑸根据用户的需求来创建n个进程(n为即满足用户需求,又不超出系统可容的最大进程数),各进程互斥地访问使用临界资源 S1、S2；⑹使用动态优先数(如：随阻塞次数的增加而减小优先数，以提高其优先权)；⑺进程结束后应能够撤消；⑻进程间能实现“发送”和“接收”两个消息缓冲通信操作；⑼系统在运行过程中随机打印出各进程的状态变换过程、系统的调度过程及公共变量的变化情况，在一个进程运行完毕，进入完成状态后，可以将该进程撤消，也可以动态的创建另一个新的进程。-the procedures on the topic of : process management-- to support multiple concurrent processes running a simple process management simulation system for the analysis of the experimental requirements are : 1 system of institutions using synchronous signals on the amount of P, V operation of the mechanism; 2 control agencies, including obstruction and awaken operation ; 3-time interrupt handling procedures-time simulation of interruption; 4 process scheduler is responsible for the allocation process processors; together according to the user's needs to create process n (n that meet user needs, without exceeding the system can accommodate the largest number of processes), the process of mutual Stating visit to the use of critical resources S1, S2; building a Dynamic priority number (eg : Platform: |
Size: 27648 |
Author:赵利君 |
Hits:
Description: 来自于我的操作系统课程设计的系列实验.采用动态优先数的方法，编写一进程调度程序模拟程序。模拟程序只进行相应的调度模拟操作。-My operating system from the curriculum design of a series of experiments. The number of dynamic priority method, to prepare a process simulation program scheduler. Simulation program scheduling only the corresponding simulations. Platform: |
Size: 363520 |
Author:xw.wong |
Hits:
Description: 采用动态优先数的方法，编写一进程调度程序模拟程序。模拟程序只进行相应的调度模拟操作-Priority number of dynamic methods, the preparation of a process simulation program scheduler. Only the corresponding simulation program scheduling simulation operation Platform: |
Size: 109568 |
Author:fg |
Hits:
Description: 模拟电梯调度算法，对磁盘进行移臂操作,观察调度程序的动态运行过程。-Elevator scheduling algorithm simulation of the disk arm to move the operation to observe the dynamic scheduler is running. Platform: |
Size: 28672 |
Author:薛松 |
Hits:
Description: 动态分配资源，保证边缘用户性能，根据LTE技术指出动态资源分配机制与现有不同的特点，谈后从调度忽然功控进行研究-Dynamic allocation of resources to ensure that the edge of user performance, according to LTE technology, pointed out that the dynamic resource allocation mechanism with the existing different characteristics, to talk about all of a sudden power control from the scheduler after the study Platform: |
Size: 331776 |
Author:hy |
Hits:
Description: 编写并调试一个模拟的进程调度程序，采用“最高优先数优先”调度算法对五个进程进行调度。
“最高优先数优先”调度算法的基本思想是把CPU分配给就绪队列中优先数最高的进程。静态优先数是在创建进程时确定的，并在整个进程运行期间不再改变。
动态优先数是指进程的优先数在创建进程时可以给定一个初始值，并且可以按一定原则修改优先数。例如：在进程获得一次CPU后就将其优先数减少1，或者，进程等待的时间超过某一时限时增加其优先数的值，等等。
-Write and debug a simulation of the process scheduler, using the "highest priority number priority" scheduling process scheduling algorithm to five.
The "highest priority number first" scheduling algorithm the basic idea is to CPU allocated to the highest-priority ready queue in the process. Static priority number is determined when creating the process, and in the whole process will not change during the operation.
Dynamic priority number refers to the process of creating a process priority number can be given an initial value, and can modify the priority number according to certain principles. For example: access to a CPU in the process after one of its priority to reduce the number of, or the process to wait longer than a certain time limit, increase the number of its priority value, and so on. Platform: |
Size: 1024 |
Author:sylvia |
Hits:
Description: 编写并调试一个模拟的进程调度程序，采用“最高优先数优先”调度算法对五个进程进行调度。
“最高优先数优先”调度算法的基本思想是把CPU分配给就绪队列中优先数最高的进程。
静态优先数是在创建进程时确定的，并在整个进程运行期间不再改变。
动态优先数是指进程的优先数在创建进程时可以给定一个初始值，并且可以按一定原则修改优先数。例如
：在进程获得一次CPU后就将其优先数减少1。或者，进程等待的时间超过某一时限时增加其优先数的值，等等
-Write and debug a simulation of the process scheduler, using the "highest priority number priority" scheduling process scheduling algorithm to five.
The "highest priority number first" scheduling algorithm the basic idea is to CPU allocated to the highest-priority ready queue in the process.
Static priority number is determined when creating the process, and in the whole process will not change during the operation.
Dynamic priority number refers to the process of creating a process priority number can be given an initial value, and can modify the priority number according to certain principles. Example
: In the process, get a CPU after its reduction in the number one priority. Or, the process of waiting time exceeds a certain time limit, increase the number of its priority value, and so on Platform: |
Size: 23552 |
Author:张超 |
Hits:
Description: 磁盘是高速、大容量、旋转型、可直接存取的存储设备。它作为计算机系统的辅助存储器，担负着繁重的输入输出工作，在现代计算机系统中往往同时会有若干个要求访问磁盘的输入输出要求。系统可采用一种策略，尽可能按最佳次序执行访问磁盘的请求。由于磁盘访问时间主要受寻道时间T的影响，为此需要采用合适的寻道算法，以降低寻道时间。本实验要求学生模拟设计一个磁盘调度程序，观察调度程序的动态运行过程。通过实验让学生理解和掌握磁盘调度的职能。-Disk is the high-speed, large capacity, rotating, direct access storage device. As a secondary computer system memory, to carry out heavy work input and output in modern computer systems often also have a number of requests to access the disk input and output requirements. System can use a strategy, as far as possible the best order of implementation of the disk access requests. As the disk access time is mainly affected by the impact of seek time T, which requires use of appropriate seeking algorithms to reduce the seek time. This experiment requires students to design a disk scheduling simulation program, observe the dynamic process scheduler. Experiments for students to understand and grasp the disk scheduling functions. Platform: |
Size: 234496 |
Author:zsb |
Hits:
Description:
按动态优先级调度算法模拟操作系统的CPU调度程序-Dynamic priority scheduling algorithm by simulation of the operating system CPU scheduler Platform: |
Size: 178176 |
Author:头绪 |
Hits:
Description: 操作系统实验 模拟实现单处理机下的进程调度程序 包括先来先服务 短作业优先 时间片轮转 动态优先级 并有详细注释-Experimental simulation of the operating system under the single-processor scheduler process, including a first-come first-served priority round-robin short operating dynamic priority and detailed notes Platform: |
Size: 2048 |
Author:123 |
Hits:
Description: 上机实践内容：
编写并调试一个模拟的进程调度程序，采用“最高优先数优先”调度算法对五个进程进行调度。
“最高优先数优先”调度算法的基本思想是把CPU分配给就绪队列中优先数最高的进程。
静态优先数是在创建进程时确定的，并在整个进程运行期间不再改变。
动态优先数是指进程的优先数在创建进程时可以给定一个初始值，并且可以按一定原则修改优先数。例如：在进程获得一次CPU后就将其优先数减少1。或者，进程等待的时间超过某一时限时增加其优先数的值，等等。
-Computer Practicals: write and debug a simulation of the process scheduler, the highest priority number of priority scheduling algorithm on the five process scheduling. " The highest priority number of priority scheduling algorithm' s basic idea is to allocate the CPU ready queue priority number highest process. Static priority number is determined when the process is created, and does not change during the run of the entire process. Dynamic priority number, priority number refers to the process of the creation process can be given an initial value, and priority number can be modified according to certain principles. For example: the first CPU in the process after its priority to reduce the number of 1. Alternatively, process waiting time exceeds a certain time limit to increase the value of its priority number, and so on. Platform: |
Size: 1005568 |
Author:刘国佳 |
Hits:
Description: Python 语言编写的任务调度器，子任务作为动态度调用，实现多任务并发。-Task scheduler written in Python, called subtasks as a dynamic degree, concurrent multi-task. Platform: |
Size: 22528 |
Author:jing123 |
Hits:
Description: 编写并调试一个模拟的进程调度程序，采用“最高优先数优先”调度算法对N（N不小于5）个进程进行调度。
“最高优先数优先”调度算法的基本思想是把CPU分配给就绪队列中优先数最高的进程。
(1). 静态优先数是在创建进程时确定的，并在整个进程运行期间不再改变。
(2). 动态优先数是指进程的优先数在创建进程时可以给定一个初始值，并且可以按一定规则修改优先数。例如：在进程获得一次CPU后就将其优先数减少1，并且进程等待的时间超过某一时限（2个时间片时间）时增加其优先数等。
(3). （**） 进程的优先数及需要的运行时间可以事先人为地指定，（也可以由随机数产生）。
(4). （**）在进行模拟调度过程可以创建（增加）进程，其到达时间为进程输入的时间。
-To write and debug a simulated process scheduler, the " number of the highest priority priority" scheduling algorithm of N (N is not less than 5) process scheduling. " The highest priority number priority scheduling algorithm' s basic idea is that the CPU is allocated to the highest priority number of processes in the ready queue. (1) the static priority number to determine when the process is created, and no longer changes during the run of the entire process. (2) the dynamic priority number refers to the number of priority of the process can create a process to set an initial value, and you can modify certain rules priority number. For example: In the process of time the CPU after the decrease in its priority number 1, and process wait time exceeds a certain time limit (two-chip time) to increase its priority number. (3) (**) the number of the priority of the process and the operating time can be required prior to artificially designated (can also be generated by a ra Platform: |
Size: 22528 |
Author:zhangjiaxiao |
Hits:
Description: 里面包括了动态分区分配方式的模拟程序、模拟动态优先权进程调度程序、请求调页存储管理方式的模拟程序、编辑距离算法程序、最长子序列的算法！-Which includes a dynamic partition allocation simulation program to simulate the dynamic priority process scheduler, to request paging storage management simulation program, edit distance algorithm, the longest sub-sequence algorithm! Platform: |
Size: 6144 |
Author:赵风 |
Hits:
Description: 编写并调试一个模拟的进程调度程序，采用“最高优先数优先”调度算法对五个进程进行调度。
“最高优先数优先”调度算法的基本思想是把CPU分配给就绪队列中优先数最高的进程。
静态优先数是在创建进程时确定的，并在整个进程运行期间不再改变。
动态优先数是指进程的优先数在创建进程时可以给定一个初始值，并且可以按一定原则修改优先数。-Write and debug a simulation of the process scheduler, using the top priority scheduling algorithm for scheduling the five process.
The basic idea of the top priority scheduling algorithm is to allocate the CPU to the highest priority process in the ready queue.
The static priority number is determined when the process is created and is no longer changed throughout the entire process.
Dynamic priority number refers to the process of priority number in the creation process can be given an initial value, and can be modified according to certain principles of priority number. Platform: |
Size: 1024 |
Author:李明 |
Hits:
Search - dynamic scheduler