- 1、本文档共73页,可阅读全部内容。
- 2、有哪些信誉好的足球投注网站(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
- 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载。
- 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
Tasks and Task Management任务和任务管理[精品]
* Deadline Monotonic Priority Assignment Sporadic processes: period now provides a minimum (or average) bound on their arrival T = 20 ms is guaranteed not to arrive more than once in any 20 ms interval Example: a error handling routine, with timing derived from a fault model Assuming Deadline same as Period is no longer reasonable. DMPO: Fixed priority of a process is inversely proportional to its deadline /~iesag/ * Analysis Response time analysis Works perfectly for values of D less than T as long as the stopping criterion is changed to w_i D_i (instead of equality) Determine response time for a given priority ordering Deadline Monotonic Priority Ordering or DMPO is optimal That is, if for any process set that is schedulable by priority scheme, it is also schedulable by DMPO /~iesag/ * Process Interactions and Blocking /~iesag/ * Priority Inversion and Inheritance Priority inversion A higher priority process L4 waits for a lower priority process (because of resource locks) Result of fixed priority scheme Priority inheritance If a process p is suspended waiting for process q then the priority of q becomes that of p L1 will have priority of L4 And therefore run in preference to L3 and L2 /~iesag/ * /~iesag/ * Response Time Calculations with Blocking Very similar to the non-blocking case With priority inheritance Where usage is a 0/1 function: if resource k is used by at least one process with priority less than i and at least one process with priority greater than or equal to i. /~iesag/ * Dynamic Planning-Based Approaches Flexibility of dynamic approaches + predictability of approaches that check for feasibility On task arrival, before execution begins attempt made to create schedule that contains previously admitted tasks and the new arrival if attempt fails, alternative actions /~iesag/ * Dynamic Best Effort Approaches Task could be preempted any time during execution Don’t know whether timing constraint is met until the deadline arrives, or
您可能关注的文档
最近下载
- (完整版)电气设备安装标准规范.pdf
- GB∕T 13861-2022生产过程危险和有害因素分类、解读与示例说明清单【危险源识别工具】(雷泽佳-2024A0).doc
- 2021年中国光大银行校园招聘在线测试笔试题考试真题笔经.doc
- 新浪·按键精灵开发者1级认证参考解析.docx VIP
- 2023年福建省各地中考语文模拟卷【文学类文本阅读题解及答案解析】汇集.docx VIP
- 皮亚杰认知发展论.ppt VIP
- 2.1 几代中国人的美好夙愿 课件初中读本.ppt
- 流域化“厂网一体”运营模式的探索与实践.pdf
- 半导体制造技术离子注入工艺.pptx
- 全国普通话水平测试用普通话词语表(表一+表二).pdf
文档评论(0)