Location:
Search - 优先级法
Search list
Description: 画家算法， 又称深度排序法。
1）将屏幕设成背景色，（2）把要画的物体（多边形）按其离开视点的从远到近排序。由此构成深度优先级表。然后从远到近画物体（多边形），近的就因为优先级高而覆盖远的多边形。由此可消隐。
-painter algorithm, the painter algorithm, known as the depth of sorting. 1) Screen into the background color, (2) to paint objects (Polygon) according left far from the viewpoint of nearly ranking. This constitutes depth priority list. Then from far to near objects paintings (Polygon), in the past because of the high priority and the coverage far polygon. This can be hidden.
Platform: |
Size: 135751 |
Author: zidan |
Hits:
Description: 文件中实现了操作系统进程调度的时间片轮转和优先级法，非常好用，十分适合于学习。-documents to fulfill the operating system process scheduling time slice and rotate priority, very convenient, very suitable for the study.
Platform: |
Size: 340156 |
Author: 王铁蛋 |
Hits:
Description: 进程是操作系统最重要的概念之一，进程调度是操作系统内核的重要功能，本实验要求用C语言编写一个进程调度模拟程序，使用优先级或时间片轮转法实现进程调度。本实验可加深对进程调度算法的理解。
Platform: |
Size: 1072 |
Author: 经济落 |
Hits:
Description: 对于给定的一组进程，采用优先级加时间片轮转法进行调度。设有一个就绪队列，就绪进程按优先数（优先数范围0－100）由小到大排列（优先数越小，级别越高）。当某一进程运行完一个时间片后，其优先级应下调（如优先数加3），试对如下给定的一组进程给出其调度顺序。每当结束一进程时要给出当前系统的状态（即显示就绪队列）。这里，进程可用进程控制块（PCB）表示为如右表所示。
进程名 A B C D E F G H J K L M
到达时间 0 1 2 3 6 8 12 12 12 18 25 25
服务时间 6 4 10 5 1 2 5 10 4 3 15 8
Platform: |
Size: 10249 |
Author: Blade |
Hits:
Description: 单处理系统进程调度
基于动态优先级的时间片轮转法
Platform: |
Size: 1004 |
Author: 李正中 |
Hits:
Description: VC++编写的操作系统课程设计——进程模拟调度——时间片轮转、优先级法
Platform: |
Size: 2027 |
Author: 250054613@qq.com |
Hits:
Description: 本程序是操作系统的处理机调度问题的c原代码包括三种调度算法:时间片轮转法，短作业优先算法，动态优先级算法-this process is the operating system processor scheduling problems c original code includes three Scheduling Algorithm : Time Web tablets, short operating priority algorithms, dynamic priority algorithm
Platform: |
Size: 10240 |
Author: 陈明 |
Hits:
Description: 文件中实现了操作系统进程调度的时间片轮转和优先级法，非常好用，十分适合于学习。-documents to fulfill the operating system process scheduling time slice and rotate priority, very convenient, very suitable for the study.
Platform: |
Size: 339968 |
Author: 王铁蛋 |
Hits:
Description: 进程是操作系统最重要的概念之一，进程调度是操作系统内核的重要功能，本实验要求用C语言编写一个进程调度模拟程序，使用优先级或时间片轮转法实现进程调度。本实验可加深对进程调度算法的理解。-Process is the concept of operating one of the most important, the process of scheduling is the important function of the operating system kernel, the experiment requires a C language simulation of the process of scheduling procedures, the use of priority or time slice realize the process of scheduling rotation law. Deepen their understanding of this experiment could be understanding the process of scheduling algorithm.
Platform: |
Size: 1024 |
Author: 经济落 |
Hits:
Description: 对于给定的一组进程，采用优先级加时间片轮转法进行调度。设有一个就绪队列，就绪进程按优先数（优先数范围0－100）由小到大排列（优先数越小，级别越高）。当某一进程运行完一个时间片后，其优先级应下调（如优先数加3），试对如下给定的一组进程给出其调度顺序。每当结束一进程时要给出当前系统的状态（即显示就绪队列）。这里，进程可用进程控制块（PCB）表示为如右表所示。
进程名 A B C D E F G H J K L M
到达时间 0 1 2 3 6 8 12 12 12 18 25 25
服务时间 6 4 10 5 1 2 5 10 4 3 15 8
Platform: |
Size: 684032 |
Author: Blade |
Hits:
Description: 操作系统分页存储管理，包括先来先服务算法，轮转法，优先级法-Paging the operating system storage management, including the first-come first-serve algorithm, rotation law, the priority method
Platform: |
Size: 8192 |
Author: 黄云 |
Hits:
Description: 单源最短路径问题，分支限界法的优先队列解法，最小堆来存储活结点表，表示活结点优先队列，优先级是结点所对应的当前路长-Single-source shortest path problem, branch and bound method of the priority queue method, the smallest heap to store slipknot points table, said slipknot point priority queue, priority is the node corresponding to the current path length
Platform: |
Size: 3072 |
Author: waterfly |
Hits:
Description: 里面有5个关于操作系统进程调度的算法源码，有优先级法，时间片轮转法和短进程优先法-There are five on the process of scheduling the operating system source code of the algorithm, a priority of law, time slice and short rotation process priority method
Platform: |
Size: 20480 |
Author: 邱鹏 |
Hits:
Description: 操作系统一个重要实验，用高优先级法和轮转法实现进程调度-An important experimental system, with high priority and to achieve the process of scheduling rotation law
Platform: |
Size: 2048 |
Author: 麦琪 |
Hits:
Description: 本程序是用分支定界法求最短路径的程序，用C++编写。采取的基本思想是：使用最小优先队列分支界限法来构建程序，细节是对于每个节点，包含三个变量：当前走过的路径长度、当前的花费和该节点对应的实际城市的编号。关于确定节点优先级，我们规定首先以“当前走过的路径长度”来确定优先级，当路径长度相等时，以“当前的花费”来确定优先级。同时，我们还定义两个数组dist[i]和pric[i]保存当前求得的从源城市到每个城市的最短距离和花费，用于剪枝时的评判标准。-This procedure is to use branch and bound procedure for seeking the shortest path, using C++ to implement. The basic idea is: Using the minimum priority queue Branch and Bound method to build a program, the details are: for each node, containing three varibles: the current path length traversed, the current cost and the node number corresponding to the actual city. On the determination of priorities, we first use the current path length traversed to determine the priority if the path length is equal, then current cost is used to determine priority. At the same time, we also define two arrays dist [i] and the pric [i] to save the current shortest distance and cost from the source city to every other city . This will be used as the evaluation criterion when pruning.
Platform: |
Size: 61440 |
Author: 李贺 |
Hits:
Description: 进程调度模拟设计——时间片轮转、优先级法-Process scheduling simulation design- time slice rotation, priority method
Platform: |
Size: 89088 |
Author: 聂晶 |
Hits:
Description: 模拟进程调度算法，包括先来先服务法，多级反馈法，时间片轮转法，静态优先级法和动态优先级法。-Simulation process scheduling algorithms, including a first-come first-served method, multi-level feedback method, round-robin method, static priority method and the dynamic priority method.
Platform: |
Size: 4096 |
Author: wangbin |
Hits:
Description: 函数功能：优先级法调度将进程插入到就绪队列算法
函数原型：void insert1(PCB *q)
函数参数：PCB *q 待插入的队列进程控制块
优先级越高，插入越靠
-Function parameters: PCB* q to insert in the queue process control blocks
Higher priorities, insert the depend
Platform: |
Size: 11264 |
Author: yingying |
Hits:
Description: 在嵌入式操作系统的综合设计中实现进程的调度——时间片选法和优先级法。-In the embedded operating system integrated design process, scheduling- time slice method of selection and prioritization method.
Platform: |
Size: 269312 |
Author: 田雨 |
Hits:
Description: 针对多机器人编队控稍中的队形形成问题进行研究。利用控制算法中的人工势场法解决多机器人队形形成问题，结构简单、易于计算，方便对多机器人实时控制。首先，针对多机器人的队形位置用目标点搜索算法，寻找到正确的队形位置点，防止多机器人在空间内绕路，减少编队时间；然后，通过人工势场算法规划各机器人的路径，在机器人行进过程中，利用优先级蔽障方法避免与其他机器人碰撞；最后，对多机器人的队形形成进行仿真，实验证明队形形成的有效性，算法简单易于实现。(The formation of formation in formation control of multi robot is studied. The formation of multi robot formation is solved by the artificial potential field method in the control algorithm, which is simple in structure, easy to calculate and convenient for real-time control of multi robot. First of all, aiming at the formation position of multi robots, we use the target point search algorithm to find the correct formation position, prevent multi robots from detouring in space, and reduce the formation time; then, we use the artificial potential field algorithm to plan the path of each robot, and use the priority barrier method to avoid collision with other robots in the process of robot moving; finally, we use the multi robot team The simulation results show that the algorithm is simple and easy to implement.)
Platform: |
Size: 3037184 |
Author: 优化123 |
Hits: