文件名称:EDF
- 所属分类：
- JSP源码/Java
- 资源属性：
- [Java] [源码]
- 上传时间：
- 2015-02-17
- 文件大小：
- 42kb
- 下载次数：
- 0次
- 提 供 者：
- v**
- 相关连接：
- 无
- 下载说明：
- 别用迅雷下载，失败请重下，重下不扣分！
介绍说明－－下载内容均来自于网络，请自行研究使用
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.
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.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
EDF\EDF.class
...\EDF.java
...\PrintfFormat$ConversionSpecification.class
...\PrintfFormat.class
...\PrintfFormat.java
EDF