返回主题:定时任务与时钟轮调度

知识卡片

普通读书笔记卡 · 5413

调度结合优先级与抢占

理解等级:高级

调度包含优先级分配和何时把资源派给任务。FIFO简单但长任务会挡后续;固定语义或周期优先级利于关键任务,却可能饿死低优先级;动态最早截止或最少松弛根据剩余时限调整;静态循环表把顺序离线确定,减少运行开销。截止期最优结论有单处理器、可抢占等前提,不能推广到任意多核工作负载。

这张卡片看不懂?

已有反馈 · 0 条

    还没有人提交反馈。

    在整书笔记中的位置

    原书出处 · 1 处

    • 性能 · 查看原书依据

      A scheduling policy conceptually has two parts: a priority assignment and dispatching. All scheduling policies assign priorities. In some cases, the assignment is as simple as first-in/first-out (or FIFO). In other cases, it can be tied to the deadline of the request or its semantic importance.

    参考来源

    - 位置:《Software Architecture in Practice, 4th Edition》第09章《性能》(来源项目:book-sources;源文件:extracted/Software Architecture in Practice, 4th Edition/_epub-src/ch09.html) - 结论依据:所引连续原文给出本卡机制或取舍;条件与示例结合本节已读上下文解释。 - 原始内容:A scheduling policy conceptually has two parts: a priority assignment and dispatching. All scheduling policies assign priorities. In some cases, the assignment is as simple as first-in/first-out (or FIFO). In other cases, it can be tied to the deadline of the request or its semantic importance.