Corey An Operating System for Many Cores cs科里操作系统多核 CS.uh.pptVIP

Corey An Operating System for Many Cores cs科里操作系统多核 CS.uh.ppt

  1. 1、本文档共63页,可阅读全部内容。
  2. 2、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
  3. 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  4. 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
  5. 5、该文档为VIP文档,如果想要下载,成为VIP会员后,下载免费。
  6. 6、成为VIP后,下载本文档将扣除1次下载权益。下载后,不支持退款、换文档。如有疑问请联系我们
  7. 7、成为VIP后,您将拥有八大权益,权益包括:VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
  8. 8、VIP文档为合作方或网友上传,每下载1次, 网站将根据用户上传文档的质量评分、类型等,对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
CONCLUSIONS In order for applications to scale up on multicore architectures, they must control sharing Since this new requirement greatly complicates the design of applications, it is best suited to application frameworks such as MapReduce Address ranges (III) Kernel-provided abstraction specifying a virtual-to-physical mapping for a range of virtual addresses If multiple cores include the same address range in their address space they will share the same mapping to the same physical pages Each core can freely manipulate and delete mapping in private address ranges w/o any consequences for other core performance Kernel cores In most OS, system calls are executed on the core of the invoking process Bad idea if the system call needs to access large shared data structures Kernel cores let applications dedicate cores to run specific kernel functions Avoids inter-core contention over the data these functions access Symmetric multiprocessing (I) Each core can execute both user and kernel code No execution bottleneck User or kernel code User or kernel code ... Symmetric multiprocessing (II) Works very well unless too many kernel function instances access large shared data structures Contention User or kernel code User or kernel code Shared data The solution Run kernel functions that access large shared data structures No inter-core contention User or kernel code User or kernel code Shared data Kernel code Shares (I) Many kernel operations involve looking up identifiers in tables to obtain a pointer to a given kernel data structure (file descriptor entry, …) Lookup tables for kernel objects that let applications specify which object identifiers are visible to other cores Each application core has a root share that is private to that core Needs no locks since its private Shares (II) If two cores want to “share a share,” they create one and add the share ID to either Their private root shares or A share reachable from these root shares Allows applicat

您可能关注的文档

文档评论(0)

zyzsaa + 关注
实名认证
文档贡献者

该用户很懒,什么也没介绍

1亿VIP精品文档

相关文档