CC模型上具有恒定平摊RMR复杂度的随机可中止互斥

Proceedings of the ACM Symposium on Principles of Distributed Computing Pub Date : 2017-07-25 DOI:10.1145/3087801.3087837

George Giakkoupis, Philipp Woelfel

{"title":"CC模型上具有恒定平摊RMR复杂度的随机可中止互斥","authors":"George Giakkoupis, Philipp Woelfel","doi":"10.1145/3087801.3087837","DOIUrl":null,"url":null,"abstract":"We present an abortable mutual exclusion algorithm for the cache-coherent (CC) model with atomic registers and CAS objects. The algorithm has constant expected amortized RMR complexity in the oblivious adversary model and is deterministically deadlock-free. This is the first abortable mutual exclusion algorithm that achieves o(\\log n/\\log\\log n) RMR complexity.","PeriodicalId":324970,"journal":{"name":"Proceedings of the ACM Symposium on Principles of Distributed Computing","volume":"32 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":"{\"title\":\"Randomized Abortable Mutual Exclusion with Constant Amortized RMR Complexity on the CC Model\",\"authors\":\"George Giakkoupis, Philipp Woelfel\",\"doi\":\"10.1145/3087801.3087837\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We present an abortable mutual exclusion algorithm for the cache-coherent (CC) model with atomic registers and CAS objects. The algorithm has constant expected amortized RMR complexity in the oblivious adversary model and is deterministically deadlock-free. This is the first abortable mutual exclusion algorithm that achieves o(\\\\log n/\\\\log\\\\log n) RMR complexity.\",\"PeriodicalId\":324970,\"journal\":{\"name\":\"Proceedings of the ACM Symposium on Principles of Distributed Computing\",\"volume\":\"32 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-07-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"11\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the ACM Symposium on Principles of Distributed Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3087801.3087837\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the ACM Symposium on Principles of Distributed Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3087801.3087837","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 11

摘要

针对具有原子寄存器和CAS对象的缓存-相干(CC)模型，提出了一种可中止互斥算法。该算法在遗忘对手模型中具有恒定的期望平摊RMR复杂度，并且确定无死锁。这是第一个实现0 (\log n/\log\log n) RMR复杂度的可终止互斥算法。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Randomized Abortable Mutual Exclusion with Constant Amortized RMR Complexity on the CC Model

We present an abortable mutual exclusion algorithm for the cache-coherent (CC) model with atomic registers and CAS objects. The algorithm has constant expected amortized RMR complexity in the oblivious adversary model and is deterministically deadlock-free. This is the first abortable mutual exclusion algorithm that achieves o(\log n/\log\log n) RMR complexity.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Proceedings of the ACM Symposium on Principles of Distributed Computing

自引率

0.00%

发文量