go top

Earliest deadline first scheduling

  • 最早截止时间优先调度

网络释义英英释义

  优先调度

Liu和Layland提出的时限最早的任务优先调度Earliest deadline first scheduling),任务优先级是任务时限与任务执行时刻的差,该算法对同步周期任务组是最佳的动态调度算法。

基于16个网页-相关网页

短语

Earliest-deadline-first scheduling algorithm 最小截止期优先调度算法

Mixed- Earliest Deadline First Scheduling 混合最近期限优先排程

Earliest deadline first scheduling

  • abstract: Earliest deadline first (EDF) or least time to go is a dynamic scheduling algorithm used in real-time operating systems to place processes in a priority queue. Whenever a scheduling event occurs (task finishes, new task released, etc.

以上来源于: WordNet

双语例句

  • The classical earliest deadline first algorithm for resource scheduling was introduced and the priority reversal problem was analyzed.

    介绍了经典期限最近优先调度算法分析了优先倒置难题

    youdao

更多双语例句
$firstVoiceSent
- 来自原声例句
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定