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

Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing最新文献

筛选
英文 中文
Brief announcement: asynchronous bounded expected delay networks 简短公告:异步有界期望延迟网络
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing Pub Date : 2010-07-25 DOI: 10.1145/1835698.1835787
R. Bakhshi, J. Endrullis, W. Fokkink, J. Pang
{"title":"Brief announcement: asynchronous bounded expected delay networks","authors":"R. Bakhshi, J. Endrullis, W. Fokkink, J. Pang","doi":"10.1145/1835698.1835787","DOIUrl":"https://doi.org/10.1145/1835698.1835787","url":null,"abstract":"We propose a natural generalisation of asynchronous bounded delay (ABD) network models. The commonly used ABD models assume a known bound on message delay. This assumption is often too strict for real-life applications. To this end we introduce a novel probabilistic network model, called asynchronous bounded expected delay (ABE), which requires a known bound on the expected message delay. While the conditions of ABD networks restrict the set of possible executions, in ABE networks all asynchronous executions are possible, but executions with extremely long delays are less probable. The ABE model captures asynchrony that occurs in sensor networks and ad-hoc networks.","PeriodicalId":447863,"journal":{"name":"Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128067179","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}
引用次数: 3
Brief announcement: complexity and solution of the send-receive correlation problem 简短公告:发送-接收相关问题的复杂性和解决方案
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing Pub Date : 2010-07-25 DOI: 10.1145/1835698.1835730
Benito van der Zander, Egon Wanke, W. Kiess, B. Scheuermann
{"title":"Brief announcement: complexity and solution of the send-receive correlation problem","authors":"Benito van der Zander, Egon Wanke, W. Kiess, B. Scheuermann","doi":"10.1145/1835698.1835730","DOIUrl":"https://doi.org/10.1145/1835698.1835730","url":null,"abstract":"During the analysis of packet log files from network experiments, the question arises which received packet belongs to which of the potentially many binary identical send events. We discuss this send-receive correlation problem for networks with local broadcast media. We can prove that assigning send and receive events is an NP-complete problem. However, there is a solution algorithm that is exponential only in the number of nodes; if the number of network nodes is fixed, its complexity is polynomial.","PeriodicalId":447863,"journal":{"name":"Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115284277","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}
引用次数: 0
Online set packing and competitive scheduling of multi-part tasks 在线设置包装和竞争调度的多部分任务
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing Pub Date : 2010-07-25 DOI: 10.1145/1835698.1835800
Y. Emek, M. Halldórsson, Y. Mansour, B. Patt-Shamir, J. Radhakrishnan, Dror Rawitz
{"title":"Online set packing and competitive scheduling of multi-part tasks","authors":"Y. Emek, M. Halldórsson, Y. Mansour, B. Patt-Shamir, J. Radhakrishnan, Dror Rawitz","doi":"10.1145/1835698.1835800","DOIUrl":"https://doi.org/10.1145/1835698.1835800","url":null,"abstract":"We consider a scenario where large data frames are broken into a few packets and transmitted over the network. Our focus is on a bottleneck router: the model assumes that in each time step, a set of packets (a burst) arrives, from which only one packet can be served, and all other packets are lost. A data frame is considered useful only if none of its constituent packets is lost, and otherwise it is worthless. We abstract the problem as a new type of online set packing, present a randomized distributed algorithm and a matching lower bound on the competitive ratio for any randomized online algorithm. Our bounds are expressed in terms of the maximal burst size and the maximal number of packets per frame. We also present refined bounds that depend on the uniformity of these parameters.","PeriodicalId":447863,"journal":{"name":"Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125100140","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
The inherent complexity of transactional memory and what to do about it 事务性内存固有的复杂性以及如何处理它
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing Pub Date : 2010-07-25 DOI: 10.1145/1835698.1835699
H. Attiya
{"title":"The inherent complexity of transactional memory and what to do about it","authors":"H. Attiya","doi":"10.1145/1835698.1835699","DOIUrl":"https://doi.org/10.1145/1835698.1835699","url":null,"abstract":"This talk overviews some of the lower bounds on the complexity of implementing software transactional memory, and explains their underlying assumptions. The talk will discuss how these lower bounds align with experimental results and design choices made in existing implementations to indicate that the transactional approach for concurrent programming must compromise either programming simplicity or scalability. The talk will describe several contemporary research avenues that address the challenge of concurrent programming. For example, optimizing coarse-grained techniques, and concurrent programming with mini-transactions - simple atomic operations on a small number of locations. This extended abstract outlines some of the ideas that will be presented in the talk","PeriodicalId":447863,"journal":{"name":"Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128573108","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}
引用次数: 7
Brief announcement: actions in the twilight - concurrent irrevocable transactions and inconsistency repair 简要公告:黄昏中的动作——并发不可撤销事务和不一致修复
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing Pub Date : 2010-07-25 DOI: 10.1145/1835698.1835714
Annette Bieniusa, Arie Middelkoop, Peter Thiemann
{"title":"Brief announcement: actions in the twilight - concurrent irrevocable transactions and inconsistency repair","authors":"Annette Bieniusa, Arie Middelkoop, Peter Thiemann","doi":"10.1145/1835698.1835714","DOIUrl":"https://doi.org/10.1145/1835698.1835714","url":null,"abstract":"Twilight STM enhances a transaction with twilight code that executes between the preparation to commit the transaction and its actual commit or abort. Twilight code runs irrevocably and concurrently with the rest of the program. It can detect and repair potential read inconsistencies in the state of its transaction and may thus turn a failing transaction into a successful one. Moreover, twilight code can safely use I/O operations while modifying the transactionally managed memory. The Twilight STM keeps a pending transaction committable while running the twilight code, but without blocking all other transactions, including pending transactions that execute their twilight code at the same time. Benchmark results show that Twilight performs competitively with state-of-the-art systems like TL2.","PeriodicalId":447863,"journal":{"name":"Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125831483","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}
引用次数: 16
Brief announcement: locally-accessible implementations for distributed shared memory multiprocessors 简短声明:分布式共享内存多处理器的本地可访问实现
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing Pub Date : 2010-07-25 DOI: 10.1145/1835698.1835788
W. Golab
{"title":"Brief announcement: locally-accessible implementations for distributed shared memory multiprocessors","authors":"W. Golab","doi":"10.1145/1835698.1835788","DOIUrl":"https://doi.org/10.1145/1835698.1835788","url":null,"abstract":"We consider asynchronous multiprocessors that support the distributed shared memory (DSM) model. Algorithms for such multiprocessors exploit the ability to co-locate shared objects with particular processes in order to reduce the cost of accessing shared memory. When a shared object fits inside a single memory word and operations on it are supported directly through machine instructions, it can be made local to any process simply by fixing its physical address. We show that even if the shared object is not supported in hardware directly, it can always be simulated using a software implementation that behaves as though it is local to some designated process. That is, operations applied by the designated process on the implemented object access only local base objects, which is non-trivial when processes synchronize by busy-waiting. We also discuss time complexity bounds for such locally-accessible implementations.","PeriodicalId":447863,"journal":{"name":"Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114897599","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}
引用次数: 0
A new technique for distributed symmetry breaking 分布对称破缺的新技术
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing Pub Date : 2010-07-25 DOI: 10.1145/1835698.1835760
Johannes Schneider, Roger Wattenhofer
{"title":"A new technique for distributed symmetry breaking","authors":"Johannes Schneider, Roger Wattenhofer","doi":"10.1145/1835698.1835760","DOIUrl":"https://doi.org/10.1145/1835698.1835760","url":null,"abstract":"We introduce Multi-Trials, a new technique for symmetry breaking for distributed algorithms and apply it to various problems in general graphs. For instance, we present three randomized algorithms for distributed (vertex or edge) coloring improving on previous algorithms and showing a time/color trade-off. To get a Δ+1 coloring takes time O(log Δ+ √ log n). To obtain an O(Δ+log1+1/log*nn) coloring takes time O(log* n). This is more than an exponential improvement in time for graphs of polylogarithmic degree. Our fastest algorithm works in constant time using O(Δlog(c) n+ log1+1/c n) colors, where c denotes an arbitrary constant and log(c ) n denotes the c times (recursively) applied logarithm ton. We also use the Multi-Trials technique to compute network decompositions and to compute maximal independent set (MIS), obtaining new results for several graph classes.","PeriodicalId":447863,"journal":{"name":"Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127004870","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}
引用次数: 113
The k-bakery: local-spin k-exclusion using non-atomic reads and writes k面包店:使用非原子读写的本地自旋k排除
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing Pub Date : 2010-07-25 DOI: 10.1145/1835698.1835707
Robert Danek
{"title":"The k-bakery: local-spin k-exclusion using non-atomic reads and writes","authors":"Robert Danek","doi":"10.1145/1835698.1835707","DOIUrl":"https://doi.org/10.1145/1835698.1835707","url":null,"abstract":"Mutual exclusion is used to coordinate access to shared resources by concurrent processes. k-Exclusion is a variant of mutual exclusion in which up to k processes can simultaneously access the shared resource. We present the first known shared-memory k-exclusion algorithms that use only atomic reads and writes, have bounded remote memory reference (RMR) complexity, and tolerate crash failures. Our algorithms have RMR complexity O(N) in both the cache-coherent and distributed shared-memory models, where N is the number of processes in the system. Additionally, we present a k-exclusion algorithm that satisfies the First-In-First-Enabled (FIFE) fairness property. FIFE requires that processes become \"enabled\" to enter the CS roughly in the order that they request access to the shared resource. Finally, we present a modification to the FIFE k-exclusion algorithm that works with non-atomic reads and writes. The high-level structure of all our algorithms is inspired by Lamport's famous Bakery algorithm.","PeriodicalId":447863,"journal":{"name":"Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129259431","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}
引用次数: 4
Brief announcement: swarming secrets 简短声明:大量秘密
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing Pub Date : 2010-07-25 DOI: 10.1145/1835698.1835750
S. Dolev, J. Garay, N. Gilboa, V. Kolesnikov
{"title":"Brief announcement: swarming secrets","authors":"S. Dolev, J. Garay, N. Gilboa, V. Kolesnikov","doi":"10.1145/1835698.1835750","DOIUrl":"https://doi.org/10.1145/1835698.1835750","url":null,"abstract":"We present information-theoretically secure schemes for sharing and modifying secrets among a dynamic swarm of computing devices. The schemes support an unlimited number of changes to the swarm including players joining and leaving the swarm, while swarms may be merged, cloned or split. The schemes securely and distributively maintain a global state for the swarm, and support an unlimited number of changes to the state according to received input. Our schemes are based on a novel construction of a strongly oblivious universal Turing Machine and on a distributed evaluation of this TM that reveals nothing to an adversary beyond a bound on the space complexity of the TM.","PeriodicalId":447863,"journal":{"name":"Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132933997","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}
引用次数: 7
Brief announcement: towards robust medium access in multi-hop networks 简短声明:在多跳网络中实现健壮的介质访问
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing Pub Date : 2010-07-25 DOI: 10.1145/1835698.1835726
A. Richa, Jin Zhang, C. Scheideler, S. Schmid
{"title":"Brief announcement: towards robust medium access in multi-hop networks","authors":"A. Richa, Jin Zhang, C. Scheideler, S. Schmid","doi":"10.1145/1835698.1835726","DOIUrl":"https://doi.org/10.1145/1835698.1835726","url":null,"abstract":"This paper introduces the distributed MAC protocol Jade. We consider a multi-hop wireless network with a single communication channel in which a powerful adversary is able to jam (groups of) nodes individually and during a (1 - ε)-fraction of the entire time, where ε > 0 is an arbitrarily small constant. Despite this harsh environment, Jade exploits the few non-jammed slots effectively and guarantees a high throughput.","PeriodicalId":447863,"journal":{"name":"Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113938740","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}
引用次数: 0
首页 上一页 下一页 尾页
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学术文献互助群
群 号：481959085
Book学术官方微信