Description: 优先比算法常用于批处理系统中作为作业调度算法，也作为多种操作系统的进程调度算法，更可用于实时系统中，以实现对实时作业的实时响应。-Priority than the algorithms commonly used in a batch system as a job scheduling algorithm, but also as a variety of operating system process scheduling algorithm, but also can be used for real-time systems, in order to achieve real-time operation real-time response. Platform: |
Size: 1024 |
Author:斜阳 |
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: 最小松弛度优先算法，属于实时调度算法，又叫最小欲度（空闲时间）优先算法，在这里，给出了其C++的代码实现。-Minimum slack priority algorithm, belonging to real-time scheduling algorithm, also known as For the smallest degrees (idle time) priority algorithms, in here, given its C++ code to achieve. Platform: |
Size: 5120 |
Author:薛松 |
Hits:
Description: 介绍实时系统的调度算法及控制实例，对实时系统学习者有很好的参考价值-Introduce real-time systems and control instances of scheduling algorithms for real-time systems have a good reference value for learners Platform: |
Size: 1036288 |
Author:刘智瑞 |
Hits:
Description: 遗传算法车间调度,车间作业调度问题遗传算法
--------------------------------------------------------------------------
输入参数列表
M 遗传进化迭代次数
N 种群规模(取偶数)
Pm 变异概率
T m×n的矩阵，存储m个工件n个工序的加工时间
P 1×n的向量，n个工序中，每一个工序所具有的机床数目
输出参数列表
Zp 最优的Makespan值
Y1p 最优方案中，各工件各工序的开始时刻，可根据它绘出甘特图
Y2p 最优方案中，各工件各工序的结束时刻，可根据它绘出甘特图
Y3p 最优方案中，各工件各工序使用的机器编号
Xp 最优决策变量的值，决策变量是一个实数编码的m×n矩阵
LC1 收敛曲线1，各代最优个体适应值的记录
LC2 收敛曲线2，各代群体平均适应值的记录
最后，程序还将绘出三副图片：两条收敛曲线图和甘特图（各工件的调度时序图）-Genetic algorithm scheduling, job shop scheduling problems with genetic algorithms -------------------------------------------------------------------------- genetic evolution of the input parameter list, the number of iterations M N population size (taken even) Pm mutation probability T m × n matrix, stored m one piece n a process of processing time 1 × n vector, n a process in which each machine processes the number of Zp with the best value Y1p Optimal Makespan programs, the start time of each process the workpiece can be drawn based on its optimal solution Gantt Y2p, each time the workpiece end of the process, according to its draw Gantt Y3p optimal solution, each piece of the processes using machine code Xp optimal decision variable, decision variable is a real m × n matrix encoded LC1 convergence curve 1, the generation of the best individual record of LC2 fitness convergence curve 2, the average fitness value on behalf of groups record Finally, the program will draw three pict Platform: |
Size: 2048 |
Author:王龙隐 |
Hits:
Description: Hard Real-Time Computing Systems。这本书是实时计算的基本著作，特别侧重于调度算法。该书的主要目的是介绍实时计算的基本概念，说明了该领域的最重大的成果，并提供了基本的方法，可预测的设计计算系统，用于支持关键控制应用。-This book is a basic treatise on real-time computing, with particular emphasis on pre- dictable scheduling algorithms. The main objectives of the book are to introduce the basic concepts of real-time computing, illustrate the most significant results in the field, and provide the basic methodologies for designing predictable computing sys- tems useful in supporting critical control applications. Platform: |
Size: 3453952 |
Author:leoht |
Hits:
Description: torsche是matlab下的一个工具箱，可以用来仿真实时调度算法，如EDF RM等，结合Matlab和Visual studio混编后可以使用，其自带的一些工具包里也有很多应用用例可以用来参考-torsche under a toolbox matlab , simulation can be used for real-time scheduling algorithms, such as EDF RM , etc. , combined with Matlab and Visual studio can use the hash , which comes with some tools package , there are many use cases can be used to refer to the application Platform: |
Size: 4939776 |
Author:王冰 |
Hits:
Description: An important class of scheduling algorithms is the class of dynamic priority algorithms. The most important dynamic priority algorithm is Earliest Deadline First (EDF).
Earliest-deadline-first (EDF) is good for scheduling real-time tasks in order to meet timing constraint. Earliest-deadline-first (EDF) is real-time disk-scheduling algorithms that service realtime tasks according to their deadlines.
EDF was originally designed for processor scheduling. When applied to disks, the algorithm simply selects the request with the earliest deadline for service. An advantage of this algorithm is that it is simple and easy to implement. Performance results demonstrate the effectiveness of the algorithm.
- An important class of scheduling algorithms is the class of dynamic priority algorithms. The most important dynamic priority algorithm is Earliest Deadline First (EDF).
Earliest-deadline-first (EDF) is good for scheduling real-time tasks in order to meet timing constraint. Earliest-deadline-first (EDF) is real-time disk-scheduling algorithms that service realtime tasks according to their deadlines.
EDF was originally designed for processor scheduling. When applied to disks, the algorithm simply selects the request with the earliest deadline for service. An advantage of this algorithm is that it is simple and easy to implement. Performance results demonstrate the effectiveness of the algorithm.
Platform: |
Size: 43008 |
Author:vss |
Hits:
Description: High temperature will affect the stability and performance of multi-core processors. A temperatureaware
scheduling algorithm for soft real-time multi-core systems is proposed in this paper, namely
LTCEDF (Low Thermal Contribution Early Deadline First). According to the core temperature and thread
thermal contribution, LTCEDF performs thread migration and exchange to avoid thermal saturation and
to keep temperature equilibrium among all the cores. The core temperature calculation method and the
thread thermal contribution prediction method are presented. LTCEDF is simulated on ATMI simulator
platform. Simulation results show that LTCEDF can not only minimize the thermal penalty, but also meet
real-time guarantee. Moreover, it can create a more uniform power density map than other thermalaware
algorithms, and significantly reduce thread migration frequency Platform: |
Size: 1183744 |
Author:yangs |
Hits:
Search - real time scheduling algorithms