Welcome![Sign In][Sign Up]
Location:
Search - EDF scheduling

Search list

[Other resourceucosII-edf

Description: 簡單的3個task的EDF排程,可更替task的deadline-simple task of the three EDF scheduling, the task replacement deadline
Platform: | Size: 117184 | Author: Evan | Hits:

[WEB Codetwo_kinds_of_realtime_scheduling_algorithm

Description: 《两种经典实时调度算法的研究与实现》——介绍速率单调(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
Platform: | Size: 316013 | Author: kevin | Hits:

[uCOSucosII-edf

Description: 簡單的3個task的EDF排程,可更替task的deadline-simple task of the three EDF scheduling, the task replacement deadline
Platform: | Size: 116736 | Author: Evan | Hits:

[Documentstwo_kinds_of_realtime_scheduling_algorithm

Description: 《两种经典实时调度算法的研究与实现》——介绍速率单调(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
Platform: | Size: 315392 | Author: kevin | Hits:

[Mathimatics-Numerical algorithms7

Description: 1. 最早截止时间优先EDF(Earliest DeadlineFirst)算法是非常著名的实时调度算法之一。在每一个新的就绪状态,调度器都是从那些已就绪但还没有完全处理完毕的任务中选择最早截止时间的任务,并将执行该任务所需的资源分配给它。在有新任务到来时,调度器必须立即计算EDF,排出新的定序,即正在运行的任务被剥夺,并且按照新任务的截止时间决定是否调度该新任务。如果新任务的最后期限早于被中断的当前任务,就立即处理新任务。按照EDF算法,被中断任务的处理将在稍后继续进行。 -1. The first priority deadline for EDF (Earliest DeadlineFirst) algorithm is a very famous one in real-time scheduling algorithm. In every state of readiness for a new, scheduler from those already in place but has not fully dealt with the mandate to select the earliest deadline for the task, and the implementation of the tasks required for the allocation of resources to it. In the arrival of new tasks, the scheduler must immediately calculate EDF, from the new sequencing, that is the task of running was curtailed, and new tasks in accordance with the deadline for deciding whether to dispatch the new tasks. If the new mission as early as the deadline for the immediate task was interrupted immediately to deal with new tasks. In accordance with the EDF algorithm, the task was interrupted to deal with will be at a later date to continue.
Platform: | Size: 2048 | Author: wjx | Hits:

[Embeded LinuxTinyOS_EDF_Embedded

Description: TinyOS中EDF调度策略的嵌入式实现-In TinyOS embedded EDF scheduling strategy to achieve
Platform: | Size: 4163584 | Author: xinluliu | Hits:

[Windows Developschedsim-0.8

Description: scheduling simulator for common algorithms like round-robin, rate monotonic, EDF, and others
Platform: | Size: 23552 | Author: aida | Hits:

[Embeded-SCM DevelopEDF

Description: EDF scheduling and RMS scheduling
Platform: | Size: 256000 | Author: vanitha | Hits:

[Linux-Unixsched_casio.patch.tar

Description: EDF scheduling in linux-EDF scheduling in linux...
Platform: | Size: 117760 | Author: padma | Hits:

[SCMtest_scheduler

Description: 实现了处理机调度--实时调度算法EDF和RMS这两种经典调度算法-Implements processor scheduling- Real-time scheduling algorithm EDF and RMS scheduling algorithm for the two classical
Platform: | Size: 6144 | Author: ypolestar | Hits:

[SCMCAN

Description: CAN总线中EDF调度算法的改进CAN bus EDF Scheduling Algorithm-CAN bus EDF Scheduling Algorithm
Platform: | Size: 436224 | Author: | Hits:

[OS Developos

Description: Fork: 实现了以进程解决生产者消费者问题. pclone: 实现了以线程解决生产者消费者问题. test_scheduler: 实现了处理机调度--实时调度算法EDF和RMS store_scheduler: 实现了存贮管理--动态不等长存储资源分配算法 HashFile: 实现了文件系统--Hash结构文件 device: 实现了设备管理--Linux设备驱动程序安装(注意头文件的位置随环境不同而改变)-Fork: to achieve a solution to process the producer consumer problem. Pclone: ​ ​ to achieve the producer to the consumer thread to solve the problem. Test_scheduler: to achieve a processor scheduling- Real-time scheduling algorithm EDF and RMS store_scheduler: to achieve a storage management- ranging from long storage dynamic resource allocation algorithm HashFile: implements file system- Hash structure file device: to achieve a device management- Linux device drivers installed (note the location of header files change with different environments)
Platform: | Size: 31744 | Author: 詹磊 | Hits:

[Software EngineeringEDF-Linux

Description: 介绍基于EDF算法的嵌入式Linux实时调度策略-Introducing Embedded Linux real-time scheduling strategy based on the EDF algorithm
Platform: | Size: 808960 | Author: cxb | Hits:

[AlgorithmEDZL_SIMULATION

Description: EDF的部分原吗,包括可调度行分析等.可以作为参考-EDF' s part of the original right, including scheduling line analysis can be used as a reference
Platform: | Size: 21504 | Author: 吴鹏 | Hits:

[Othertorsche-0_4_0

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:

[matlabTruetime-Schedule

Description: 利用Truetime工具箱进行网络控制系统建模,对比了RM、EDF、MEF-TOD网络调度算法。-Use Truetime toolbox for network control system modeling, compared to the RM, EDF, MEF-TOD network scheduling algorithm.
Platform: | Size: 17408 | Author: 陈飞 | Hits:

[JSP/JavaEDF

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:

[OtherRM to EDF

Description: Following the step ,you can modify RM to EDF scheduling step by step. It is working on ucos ii platform.It is very easy and clear step to follow.Must download
Platform: | Size: 333 | Author: lpborgg@gmail.com | Hits:

CodeBus www.codebus.net