The Art of Multiprocessor Programming booksite多处理器编程的艺术booksite.elsevier.pptVIP

下载本文档

5
0
约 132页
2017-03-09 发布于上海
举报
版权申诉

The Art of Multiprocessor Programming booksite多处理器编程的艺术booksite.elsevier.ppt

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

The Art of Multiprocessor Programming booksite多处理器编程的艺术booksite.elsevier

* To compute my response. * * * * * * * * * To compute my response. * Our construction is correct, that is, it is a linearizable implementation of the sequential object, because the log is immutable and each \mApply{} call can be linearized at the point in which the consensus call adding it to the log was decided. Why is our construction lock-free? We first note that the ``true head of the log, the latest node agreed on as the new head, is always added to the head array within a finite number of steps from the moment of decision. This claim follows because the nodes predecessor must already appear in the head array, and any node repeatedly attempting to add a new node will repeatedly run the $\max$ function on the head array. It will detect this predecessor, run consensus on its \fDecideNext{}, then update all its fields including the sequence number, and finally add the decided node to its entry of the head array. Thus, the new ``true head node is always eventually recorded in the head array. Therefore, the only way a thread can continue to spin indefinitely, failing to add its own node to the log, is if other threads repeatedly succeed in appending their own nodes to the log, continuously changing the new head node. This kind of starvation can occur only if the other nodes are continually completing their associated invocations, implying that the construction is lock-free. * Our construction is correct, that is, it is a linearizable implementation of the sequential object, because the log is immutable and each \mApply{} call can be linearized at the point in which the consensus call adding it to the log was decided. Why is our construction lock-free? We first note that the ``true head of the log, the latest node agreed on as the new head, is always added to the head array within a finite number of steps from the moment of decision. This claim follows because the nodes predecessor must already appear in the head array, and any node repeatedly attempting to ad