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

Proceedings 21st International Conference on Distributed Computing Systems最新文献

筛选
英文 中文
An exercise in proving self-stabilization through Lyapunov functions 用李雅普诺夫函数证明自稳定的练习
Proceedings 21st International Conference on Distributed Computing Systems Pub Date : 1900-01-01 DOI: 10.1109/ICDSC.2001.919010
Oliver E. Theel
{"title":"An exercise in proving self-stabilization through Lyapunov functions","authors":"Oliver E. Theel","doi":"10.1109/ICDSC.2001.919010","DOIUrl":"https://doi.org/10.1109/ICDSC.2001.919010","url":null,"abstract":"Self-stabilizing distributed algorithms exhibit interesting analogies with the stabilizing feedback systems that are used in various engineering domains. In this paper, we show, with E.W. Dijkstra's (1974) token-ring algorithm for mutual exclusion serving as an example, that methodologies from control theory, e.g. Lyapunov's \"second method\", can be used to more easily and systematically prove the self-stabilization property of distributed algorithms.","PeriodicalId":276188,"journal":{"name":"Proceedings 21st International Conference on Distributed Computing Systems","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127124794","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}
引用次数: 6
A traveling salesman mobility model and its location tracking in PCS networks pc网络中旅行商移动模型及其位置跟踪
Proceedings 21st International Conference on Distributed Computing Systems Pub Date : 1900-01-01 DOI: 10.1109/ICDSC.2001.918982
Ming-Hour Yang, Lien-Wu Chen, J. Sheu, Y. Tseng
{"title":"A traveling salesman mobility model and its location tracking in PCS networks","authors":"Ming-Hour Yang, Lien-Wu Chen, J. Sheu, Y. Tseng","doi":"10.1109/ICDSC.2001.918982","DOIUrl":"https://doi.org/10.1109/ICDSC.2001.918982","url":null,"abstract":"This paper considers the location tracking problem in PCS networks. How a solution to this problem performs in fact highly, depends on the mobility patterns of users. In this paper we propose a new traveling salesman mobility (TSM) model, in the hope of catching the mobility patterns of a large group of users. The TSM model is characterized by features of \"stop-or-move\", \"infrequent transition\" \"memory of roaming direction\", and \"oblivious in different moves\". Then a location tracking strategy based on this TSM model is developed. The scheme only needs to keep very little information for each user. Analyses and simulations are provided, which show that the strategy is very prospective.","PeriodicalId":276188,"journal":{"name":"Proceedings 21st International Conference on Distributed Computing Systems","volume":"27 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131062677","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}
引用次数: 14
On slicing a distributed computation 关于切片分布式计算
Proceedings 21st International Conference on Distributed Computing Systems Pub Date : 1900-01-01 DOI: 10.1109/ICDSC.2001.918962
V. Garg, N. Mittal
{"title":"On slicing a distributed computation","authors":"V. Garg, N. Mittal","doi":"10.1109/ICDSC.2001.918962","DOIUrl":"https://doi.org/10.1109/ICDSC.2001.918962","url":null,"abstract":"We introduce the notion of a slice of a distributed computation. A slice of a distributed computation with respect to a global predicate is a computation which captures those and only those consistent cuts of the original computation which satisfy the global predicate. We show that a slice exists for a global predicate iff the predicate is a regular predicate. We then give an efficient algorithm for computing the slice and show applications of slicing to testing and debugging of distributed programs.","PeriodicalId":276188,"journal":{"name":"Proceedings 21st International Conference on Distributed Computing Systems","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128838798","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}
引用次数: 77
首页 上一页
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学术官方微信
小红书