- 1、本文档共62页,可阅读全部内容。
- 2、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
- 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载。
- 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
* Example of Non-Preemptive SJF Process Arrival Time Burst Time P1 0.0 7 P2 2.0 4 P3 4.0 1 P4 5.0 4 SJF (non-preemptive) Average waiting time = (0 + 6 + 3 + 7)/4 = 4 Operating System Concepts P1 P3 P2 7 3 16 0 P4 8 12 Example of Preemptive SJF Process Arrival Time Burst Time P1 0.0 7 P2 2.0 4 P3 4.0 1 P4 5.0 4 SJF (preemptive) Average waiting time = (9 + 1 + 0 +2)/4 = 3 Operating System Concepts P1 P3 P2 4 2 11 0 P4 5 7 P2 P1 16 How do we know the Next CPU Burst? Without a good answer to this question, SJF cannot be used for CPU scheduling. We try to predict the next CPU burst! Can be done by using the length of previous CPU bursts, using exponential averaging. Operating System Concepts Operating System Concepts Examples of Exponential Averaging ? =0 ?n+1 = ?n Recent history does not count. ? =1 ?n+1 = tn Only the actual last CPU burst counts. Operating System Concepts Prediction of the Length of the Next CPU Burst Operating System Concepts Examples of Exponential Averaging (Cont.) If we expand the formula, we get: ?n+1 = ? tn+(1 - ?) ? tn-1 + … +(1 - ? )j ? tn-j + … +(1 - ? )n+1 ?0 Since both ? and (1 - ?) are less than or equal to 1, each successive term has less weight than its predecessor. Operating System Concepts SJF Problems It is difficult to estimate the next burst time value accurately. SJF is in favor of short jobs. As a result, some long jobs may not have a chance to run at all. This is starvation. Operating System Concepts Priority Scheduling Each process has a priority. Priority may be determined internally or externally: internal priority: determined by time limits,memory requirement, # of files, and so on. external priority: not controlled by the OS (e.g., importance of the process) The scheduler always picks the process (in ready queue) with the highest priority to run. FCFS and SJF are special cases of priority scheduling. (Why?) Operating System Concepts Priority Scheduling (Cont.) Prior
您可能关注的文档
最近下载
- 市场营销原理(第13版) 科特勒 课件 中文版.ppt
- 陕西省全省性社会团体章程示范文本(陕西省2022版).pdf VIP
- 2025学年高一下学期期中考试物理试卷 Word版含答案 .pdf VIP
- 2023高考语文新课标I卷现代文阅读II《给儿子》小说精读及试题详解.docx
- 2025年许昌电气职业学院单招职业适应性测试题库往年题考.docx VIP
- 寿盒(骨灰盒)供应及售后服务方案.pdf VIP
- 适老化全场景技术规范 第2部分:既有居住建筑适老化改造技术标准 .pdf VIP
- 生态系统多样性及保护.pptx VIP
- (高清版)ZT 0331-2020 地热资源评价方法及估算规程.pdf VIP
- T∕CBMCA 057.1-2024 适老化全场景技术规范 第1部分:居住建筑适老化基本要求.pdf
文档评论(0)