分布式计算复杂性:你是沃尔沃迷还是纳斯卡迷?

P. Fraigniaud
{"title":"分布式计算复杂性:你是沃尔沃迷还是纳斯卡迷?","authors":"P. Fraigniaud","doi":"10.1145/1835698.1835700","DOIUrl":null,"url":null,"abstract":"Roughly speaking, and if one ignores important research topics driven by modern applications of distributed computing (like, e.g., P2P systems and multi-core technology), the PODC community can be viewed as the union of two non-necessarily disjoint sub-communities. One is mostly focussing on the combined impact of asynchronism and faults on distributed computation, while the other is mostly focussing on the impact of network structural properties on distributed computation. Both communities address various forms of distributed computational complexities, through the analysis of different concepts. This includes, e.g., failure detectors and wait-free hierarchy for the former community, and compact labeling schemes and computing with advice for the latter community. This talk will describe examples taken from these latter frameworks aiming at demonstrating that many important notions of Distributed Computing seem to fit well with standard computational complexity, although they are not expressed using the traditional computational complexity format, i.e., complexity classes. The thesis that will be defended in the talk is that the traditional computational complexity format might well apply to Distributed Computing, and that our community may in fact take benefit from expressing its main challenges in this standard framework for making them accessible to a wider audience.","PeriodicalId":447863,"journal":{"name":"Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing","volume":"23 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"Distributed computational complexities: are you volvo-addicted or nascar-obsessed?\",\"authors\":\"P. Fraigniaud\",\"doi\":\"10.1145/1835698.1835700\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Roughly speaking, and if one ignores important research topics driven by modern applications of distributed computing (like, e.g., P2P systems and multi-core technology), the PODC community can be viewed as the union of two non-necessarily disjoint sub-communities. One is mostly focussing on the combined impact of asynchronism and faults on distributed computation, while the other is mostly focussing on the impact of network structural properties on distributed computation. Both communities address various forms of distributed computational complexities, through the analysis of different concepts. This includes, e.g., failure detectors and wait-free hierarchy for the former community, and compact labeling schemes and computing with advice for the latter community. This talk will describe examples taken from these latter frameworks aiming at demonstrating that many important notions of Distributed Computing seem to fit well with standard computational complexity, although they are not expressed using the traditional computational complexity format, i.e., complexity classes. The thesis that will be defended in the talk is that the traditional computational complexity format might well apply to Distributed Computing, and that our community may in fact take benefit from expressing its main challenges in this standard framework for making them accessible to a wider audience.\",\"PeriodicalId\":447863,\"journal\":{\"name\":\"Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing\",\"volume\":\"23 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-07-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/1835698.1835700\",\"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 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1835698.1835700","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

摘要

粗略地说,如果忽略分布式计算的现代应用(如P2P系统和多核技术)所驱动的重要研究课题,PODC社区可以被视为两个不一定脱节的子社区的结合。一种主要研究异步性和故障对分布式计算的综合影响,另一种主要研究网络结构特性对分布式计算的影响。两个社区都通过对不同概念的分析来解决各种形式的分布式计算复杂性。这包括,例如,前一个社区的故障检测器和无等待层次结构,以及后一个社区的紧凑标记方案和计算与建议。本演讲将描述取自后一种框架的例子,旨在证明分布式计算的许多重要概念似乎很适合标准计算复杂性,尽管它们没有使用传统的计算复杂性格式(即复杂性类)来表达。在演讲中要捍卫的论点是,传统的计算复杂性格式可能很好地适用于分布式计算,我们的社区实际上可能会受益于在这个标准框架中表达它的主要挑战,使它们能够被更广泛的受众所接受。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Distributed computational complexities: are you volvo-addicted or nascar-obsessed?
Roughly speaking, and if one ignores important research topics driven by modern applications of distributed computing (like, e.g., P2P systems and multi-core technology), the PODC community can be viewed as the union of two non-necessarily disjoint sub-communities. One is mostly focussing on the combined impact of asynchronism and faults on distributed computation, while the other is mostly focussing on the impact of network structural properties on distributed computation. Both communities address various forms of distributed computational complexities, through the analysis of different concepts. This includes, e.g., failure detectors and wait-free hierarchy for the former community, and compact labeling schemes and computing with advice for the latter community. This talk will describe examples taken from these latter frameworks aiming at demonstrating that many important notions of Distributed Computing seem to fit well with standard computational complexity, although they are not expressed using the traditional computational complexity format, i.e., complexity classes. The thesis that will be defended in the talk is that the traditional computational complexity format might well apply to Distributed Computing, and that our community may in fact take benefit from expressing its main challenges in this standard framework for making them accessible to a wider audience.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信