现代操作系统全套配套课件4eTanenbaumPPT及教学资料Chapter02-Processes and Threads.pptVIP

下载本文档

2
0
约1.66万字
约 74页
2019-10-03 发布于广东
举报
版权申诉

现代操作系统全套配套课件4eTanenbaumPPT及教学资料Chapter02-Processes and Threads.ppt

1、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。。
2、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
4、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
5、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
6、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
7、VIP文档为合作方或网友上传，每下载1次，网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档

The Producer-Consumer Problem with Message Passing (2) Figure 2-36. The producer-consumer problem with N messages. Tanenbaum Bo,Modern Operating Systems:4th ed., (c) 2013 Prentice-Hall, Inc. All rights reserved. Barriers Figure 2-37. Use of a barrier. (a) Processes approaching a barrier. (b) All processes but one blocked at the barrier. (c) When the last process arrives at the barrier, all of them are let through. Tanenbaum Bo,Modern Operating Systems:4th ed., (c) 2013 Prentice-Hall, Inc. All rights reserved. Avoiding Locks: Read-Copy-Update (1) Figure 2-38. Read-Copy-Update: inserting a node in the tree and then removing a branch—all without locks Tanenbaum Bo,Modern Operating Systems:4th ed., (c) 2013 Prentice-Hall, Inc. All rights reserved. Avoiding Locks: Read-Copy-Update (2) Figure 2-38. Read-Copy-Update: inserting a node in the tree and then removing a branch—all without locks Tanenbaum Bo,Modern Operating Systems:4th ed., (c) 2013 Prentice-Hall, Inc. All rights reserved. Introduction to SchedulingProcess Behavior Figure 2-39. Bursts of CPU usage alternate with periods of waiting for I/O. (a) A CPU-bound process. (b) An I/O-bound process. Tanenbaum Bo,Modern Operating Systems:4th ed., (c) 2013 Prentice-Hall, Inc. All rights reserved. Categories of Scheduling Algorithms Batch. Interactive. Real time. Tanenbaum Bo,Modern Operating Systems:4th ed., (c) 2013 Prentice-Hall, Inc. All rights reserved. Scheduling Algorithm Goals Figure 2-40. Some goals of the scheduling algorithm under different circumstances. Tanenbaum Bo,Modern Operating Systems:4th ed., (c) 2013 Prentice-Hall, Inc. All rights reserved. Scheduling in Batch Systems First-Come First-Served Shortest Job First Shortest Remaining Time Next Tanenbaum Bo,Modern Operating Systems:4th ed., (c) 2013 Prentice-Hall, Inc. All rights reserved. Shortest Job First Figure 2-41. An example of shortest job first scheduling. (a) Running four jobs in the original order. (b) Running them in sh