发布求助
文献互助 智能选刊 最新文献

2009 29th IEEE International Conference on Distributed Computing Systems最新文献

筛选
英文 中文
Fault-Tolerant Consensus in Unknown and Anonymous Networks 未知和匿名网络中的容错共识
2009 29th IEEE International Conference on Distributed Computing Systems Pub Date : 2009-03-20 DOI: 10.1109/ICDCS.2009.36
C. Delporte-Gallet, H. Fauconnier, A. Tielmann
{"title":"Fault-Tolerant Consensus in Unknown and Anonymous Networks","authors":"C. Delporte-Gallet, H. Fauconnier, A. Tielmann","doi":"10.1109/ICDCS.2009.36","DOIUrl":"https://doi.org/10.1109/ICDCS.2009.36","url":null,"abstract":"This paper investigates under which conditions information can be reliably shared and consensus can be solved in unknown and anonymous message-passing networks that suffer from crash-failures.  We provide algorithms to emulate registers and solve consensus under different synchrony assumptions. For this, we introduce a novel pseudo leader-election approach which allows a leader-based consensus implementation without breaking symmetry.","PeriodicalId":387968,"journal":{"name":"2009 29th IEEE International Conference on Distributed Computing Systems","volume":"196 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134516088","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 27
Communication Efficiency in Self-Stabilizing Silent Protocols 自稳定静默协议中的通信效率
2009 29th IEEE International Conference on Distributed Computing Systems Pub Date : 2008-11-23 DOI: 10.1109/ICDCS.2009.24
Stéphane Devismes, T. Masuzawa, S. Tixeuil
{"title":"Communication Efficiency in Self-Stabilizing Silent Protocols","authors":"Stéphane Devismes, T. Masuzawa, S. Tixeuil","doi":"10.1109/ICDCS.2009.24","DOIUrl":"https://doi.org/10.1109/ICDCS.2009.24","url":null,"abstract":"In this paper, our focus is to lower the communication complexity of self-stabilizing protocols below the need of checking every neighbor forever. Our contribution is threefold: (i) We provide new complexity measures for communication efficiency of self-stabilizing protocols, especially in the stabilized phase or when there are no faults, (ii) On the negative side, we show that for non-trivial problems such as coloring, maximal matching, and maximal independent set, it is impossible to get (deterministic or probabilistic) self-stabilizing solutions where every participant communicates with less than every neighbor in the stabilized phase, and (iii) On the positive side, we present protocols for maximal matching and maximal independent set such that a fraction of the participants communicates with exactly one neighbor in the stabilized phase.","PeriodicalId":387968,"journal":{"name":"2009 29th IEEE International Conference on Distributed Computing Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117328743","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 17
Model Checking Transactional Memory with Spin 用Spin模型检查事务性内存
2009 29th IEEE International Conference on Distributed Computing Systems Pub Date : 2008-08-18 DOI: 10.1145/1400751.1400816
J. O'Leary, Bratin Saha, M. Tuttle
{"title":"Model Checking Transactional Memory with Spin","authors":"J. O'Leary, Bratin Saha, M. Tuttle","doi":"10.1145/1400751.1400816","DOIUrl":"https://doi.org/10.1145/1400751.1400816","url":null,"abstract":"We used the Spin model checker to show that Intel's implementation of software transactional memory is correct.  Transactional memory makes it possible  to write properly-synchronized multi-threaded programs without the explicit use of locks. We describe our model of Intel's implementation, our experience with Spin,  what we have shown, and what obstacles remain to showing more.","PeriodicalId":387968,"journal":{"name":"2009 29th IEEE International Conference on Distributed Computing Systems","volume":"164 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115972245","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 20
首页 上一页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信