搜索资源列表
ucosII-edf
- 簡單的3個task的EDF排程,可更替task的deadline-simple task of the three EDF scheduling, the task replacement deadline
two_kinds_of_realtime_scheduling_algorithm
- 《两种经典实时调度算法的研究与实现》——介绍速率单调(RM)调度和最早截止期限优先(EDF)调度算法-"two classic real-time scheduling algorithm for the Study and Implementation" -- the rate monotonic (RM) Dispatch and the first interception only priority period (EDF) scheduling algorithm
TinyOS_EDF_Embedded
- TinyOS中EDF调度策略的嵌入式实现-In TinyOS embedded EDF scheduling strategy to achieve
schedsim-0.8
- scheduling simulator for common algorithms like round-robin, rate monotonic, EDF, and others
EDF
- EDF scheduling and RMS scheduling
sched_casio.patch.tar
- EDF scheduling in linux-EDF scheduling in linux...
test_scheduler
- 实现了处理机调度--实时调度算法EDF和RMS这两种经典调度算法-Implements processor scheduling- Real-time scheduling algorithm EDF and RMS scheduling algorithm for the two classical
CAN
- CAN总线中EDF调度算法的改进CAN bus EDF Scheduling Algorithm-CAN bus EDF Scheduling Algorithm
os
- Fork: 实现了以进程解决生产者消费者问题. pclone: 实现了以线程解决生产者消费者问题. test_scheduler: 实现了处理机调度--实时调度算法EDF和RMS store_scheduler: 实现了存贮管理--动态不等长存储资源分配算法 HashFile: 实现了文件系统--Hash结构文件 device: 实现了设备管理--Linux设备驱动程序安装（注意头文件的位置随环境不同而改变）-Fork: to achieve a solution to pr
EDF-Linux
- 介绍基于EDF算法的嵌入式Linux实时调度策略-Introducing Embedded Linux real-time scheduling strategy based on the EDF algorithm
EDZL_SIMULATION
- EDF的部分原吗，包括可调度行分析等.可以作为参考-EDF' s part of the original right, including scheduling line analysis can be used as a reference
torsche-0_4_0
- 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 st
Truetime-Schedule
- 利用Truetime工具箱进行网络控制系统建模，对比了RM、EDF、MEF-TOD网络调度算法。-Use Truetime toolbox for network control system modeling, compared to the RM, EDF, MEF-TOD network scheduling algorithm.
EDF
- 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 or