Run-Time Detection of Potential Deadlocks for- DSLAB in GNU运行时间为潜在的死锁检测dslab GNU.pptVIP

下载本文档

17
0
约7.77千字
约 33页
2017-12-18 发布于江西
举报
版权申诉

Run-Time Detection of Potential Deadlocks for- DSLAB in GNU运行时间为潜在的死锁检测dslab GNU.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文档。上传文档

Run-Time Detection of Potential Deadlocks for- DSLAB in GNU运行时间为潜在的死锁检测dslab GNU

t1 t2 t3 t o p o t p o p m p m o o = 1; t = 0; p = 0; m = 0; init values Deadlock-free trace t t down operation on semaphore t up operation on semaphore t * AgSt06 Happens-Before Ordering for the Trace t1 t2 t3 t o p o t p o p m p m o * AgSt06 Feasible Permutation with Deadlock t1 t2 t3 t o p t p o p m o = 1; t = 0; p = 0; m = 0; init values * AgSt06 Detection of Potential for Lost Notifies Potential for lost notify An execution trace tr has potential for lost notify if it contains a notify or notifyall event e such that there is a feasible permutation of tr in which e wakes up fewer threads than it does in tr. * AgSt06 Happens-Before Ordering due to Lost Notifies For each notify or notifyAll event en and each wait event ew that is notified by en, en happens-before succ(ew), where succ(e) is the event immediately after e on the same thread. Since, the same lock l must be held when ew and en occur and only one thread can hold a given lock at a time, this is equivalent to saying that the release of l after en happens-before succ(ew). acquire wait release acquire acquire notify release * AgSt06 Trace without Lost Notify acquire wait release acquire acquire notify release * AgSt06 Happens-Before Ordering for the Trace acquire wait release acquire acquire notify release * AgSt06 Feasible Permutation with Lost Notify acquire wait release acquire acquire notify release * AgSt06 Detection of Potential Deadlocks due to Locks, Condition Variables, and Semaphores Trace without deadlocks wait rel(b) acq(b) acq(b) notify rel(b) t1 t2 t3 acq (a) rel (a) s s acq(b) acq(a) * AgSt06 Happens-before ordering for the trace wait rel(b) acq(b) acq(b) notify rel(b) t1 t2 t3 acq (a) rel (a) s s acq(b) acq(a) * AgSt06 Feasible permutation with deadlock wait t1 t2 t3 acq (a) s acq(b) acq(a) * AgSt06 Feasible permutation with lost notifies wait rel(b) acq(b) acq(b) notify rel(b) t1 t2 t3 acq (a) rel (a) s s acq(b) acq(a) * AgSt06 AgSt06 Run-Time Detection of Potential Deadlocks for Programs