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

下载本文档

43
0
约10.53万字
约 198页
2017-03-09 发布于上海
举报
版权申诉

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

1、本文档共198页，可阅读全部内容。
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 Elsevier多处理器编程的艺术

* * * * * * * * * * * * * Take any linearizable stack, for example, the lock-free queue. * Pick random locations in the array. * No need to access stack since it stays the same anyhow. Just exchange the values. * No need to access stack since it stays the same anyhow. Just exchange the values. * * Any method call must be prepared to encounter a tail field that is trailing behind the actual tail. This situation is easy to detect. How? (Answer: tail.next not null). How to deal with it? Fix it! Call compareAndSet to set the queue’s tial field to point to the actual last Node in the queuel * What do we do if the CAS calls fail? It matters a lot in which CAS call this happened. In Step One, a failed CAS implies a synchronization conflict with another enq() call. Here, the most sensible approach is to abandon the current effort (panic!) and start over. In Step Two, we can ignore a failed CAS, simply because the failure means that some other thread has executed that step on our behalf. * Next, the thread reads the first Node’s value, and stores it in a local variable. The slide suggests that the value is nulled out, but in fact there is no need to do so. * The thread then makes the first Node the new sentinel, and discards the old sentinel. This is the clever trick I mentioned earlier that ensures that we do not need to lock the Node itself. We do not physically remove the Node, we just demote it to sentinel. * Let’s take a brief detour. What do we do with nodes after we remove them from the queue? This is not an issue with the lock-based implementation, but it requires some thought here. In Java, we can just let the garbage collector recycle unused objects. But what if we are operating in an environment where there is no garbage collector, or where we think we can recycle memory more efficiently? * Let us look at the dequeue method from a different perspective. When we promote the prior first Node to sentinel, what do we do with the old sentinel? Seems like a good can