Proceedings 19th IEEE International Conference on Distributed Computing Systems最新文献

Phase synchronization on asynchronous uniform rings with odd size 奇径异步均匀环的相位同步

Proceedings 19th IEEE International Conference on Distributed Computing Systems Pub Date : 1999-06-05 DOI: 10.1109/SLFSTB.1999.777487

Tzong-Jye Liu, Shing-Tsaan Huang

引用次数: 8

Self-stabilizing load distribution for replicated servers on a per-access basis 基于每次访问的复制服务器的自稳定负载分布

Proceedings 19th IEEE International Conference on Distributed Computing Systems Pub Date : 1999-06-05 DOI: 10.1109/SLFSTB.1999.777493

F. Freiling, H. Pagnia

{"title":"Self-stabilizing load distribution for replicated servers on a per-access basis","authors":"F. Freiling, H. Pagnia","doi":"10.1109/SLFSTB.1999.777493","DOIUrl":"https://doi.org/10.1109/SLFSTB.1999.777493","url":null,"abstract":"Usually, load distribution schemes for replicated servers are based on a many-to-one mapping between client and server meaning that, while a server may serve many clients, a client has a single specific server which it queries at any point in time. In some cases, however it is desirable that the number of accesses of a client may be distributed over multiple servers, thus yielding a many-to-many mapping between clients and servers. We present a simple method to efficiently realize such a many-to-many mapping between clients and servers. For the sake of transparency we add a component called \"distribution module\" to the communication interface of client and server. This module is responsible for distributing server accesses over multiple target machines in a well defined way. We present algorithms for the client and server component and show that they are self-stabilizing, meaning that they converge to a stable state once the access pattern becomes regular. Due to this property, the components can tolerate any internal transient fault in a non-masking way. Additionally, our approach is highly modular since servers may run an off-the-shelf load distribution algorithm and replica consistency is not affected.","PeriodicalId":395768,"journal":{"name":"Proceedings 19th IEEE International Conference on Distributed Computing Systems","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128505762","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

Self-stabilizing census with cut-through constraint 具有穿透约束的自稳定普查

Proceedings 19th IEEE International Conference on Distributed Computing Systems Pub Date : 1999-06-05 DOI: 10.1109/SLFSTB.1999.777489

J. Beauquier, A. Datta, S. Tixeuil

引用次数: 8

Parallel composition of stabilizing algorithms 稳定算法的并行组合

Proceedings 19th IEEE International Conference on Distributed Computing Systems Pub Date : 1999-06-05 DOI: 10.1109/SLFSTB.1999.777483

S. Dolev, T. Herman

{"title":"Parallel composition of stabilizing algorithms","authors":"S. Dolev, T. Herman","doi":"10.1109/SLFSTB.1999.777483","DOIUrl":"https://doi.org/10.1109/SLFSTB.1999.777483","url":null,"abstract":"Worst case convergence time is primary measure of the complexity of a self-stabilizing algorithm. This aspect of complexity is not only theoretically interesting, but can be a practical limitation to stabilization's applicability in system design. Recently, a number of papers concentrated on conditional improvements in convergence time. Plausible conditions include rapid convergence for the most likely faulty initial states and accelerated convergence with respect to critical components of the global state, such as output variables. A general technique for speedup, used in many areas of computer science, is to exploit parallelism in the design of algorithms. The paper considers the explicit use of parallelism for self stabilization. A paradigm for composition based on parallel execution of several algorithms and an observer is proposed. Applications of parallel composition are shown in previously published research and for a new algorithm that is time adaptively stabilizing. Layered composition is, at present, a standard technique for designing stabilizing systems. The results of the paper go beyond the possibility of constructing stabilizing systems; attention is given to the issue of output convergence time in the compositional structure of the algorithm.","PeriodicalId":395768,"journal":{"name":"Proceedings 19th IEEE International Conference on Distributed Computing Systems","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128170400","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}

引用次数: 23

Finite-state self-stabilizing protocols in message-passing systems 消息传递系统中的有限状态自稳定协议

Proceedings 19th IEEE International Conference on Distributed Computing Systems Pub Date : 1999-06-05 DOI: 10.1109/SLFSTB.1999.777488

Rodney R. Howell, Mikhail Nesterenko, M. Mizuno

引用次数: 26

A case-study in component-based mechanical verification of fault-tolerant programs 基于构件的容错程序力学验证案例研究

Proceedings 19th IEEE International Conference on Distributed Computing Systems Pub Date : 1999-06-05 DOI: 10.1109/SLFSTB.1999.777484

S. Kulkarni, J. Rushby, N. Shankar

引用次数: 34

State-optimal snap-stabilizing PIF in tree networks 树状网络的状态最优snap- stabilization PIF

Proceedings 19th IEEE International Conference on Distributed Computing Systems Pub Date : 1999-06-05 DOI: 10.1109/SLFSTB.1999.777490

A. Bui, A. Datta, F. Petit, V. Villain

{"title":"State-optimal snap-stabilizing PIF in tree networks","authors":"A. Bui, A. Datta, F. Petit, V. Villain","doi":"10.1109/SLFSTB.1999.777490","DOIUrl":"https://doi.org/10.1109/SLFSTB.1999.777490","url":null,"abstract":"Introduces the notion of snap stabilization. A snap-stabilizing algorithm protocol guarantees that, starting from an arbitrary system configuration, the protocol always behaves according to its specification. So, a snap-stabilizing protocol is a self-stabilizing protocol which stabilizes in zero steps. We propose a snap-stabilizing PIF (propagation of information with feedback) scheme on a rooted tree network. We call this scheme \"Propagation of Information with Feedback and Cleaning\" (/spl Pscr//spl Fscr//spl Cscr/). We present two algorithms. One is a basic /spl Pscr//spl Fscr//spl Cscr/ scheme which is inherently snap-stabilizing. However, it can be delayed by O(h/sup 2/) steps (where h is the height of the tree) due to some undesirable local states. The second algorithm improves the worst delay of the basic /spl Pscr//spl Fscr//spl Cscr/ algorithm from O(h/sup 2/) to one step. /spl Pscr//spl Fscr//spl Cscr/ can be used to implement distributed resetting, distributed infimum computation and a global synchronizer in O(1) waves. Assuming that a checking mechanism exists to detect transient failures or topological changes, /spl Pscr//spl Fscr//spl Cscr/ allows processors to detect if the system is stabilized in O(1) waves without using any global metric. Finally, we show that the state requirement for both /spl Pscr//spl Fscr//spl Cscr/ algorithms matches the exact lower bound of the PIF algorithms on tree networks-three states per processor, except for the root and leaf processors which use only two states. Thus, the proposed algorithms are optimal PIF schemes in terms of the number of states.","PeriodicalId":395768,"journal":{"name":"Proceedings 19th IEEE International Conference on Distributed Computing Systems","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122641119","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}

引用次数: 97

An exercise in proving convergence through transfer functions 通过传递函数证明收敛性的练习

Proceedings 19th IEEE International Conference on Distributed Computing Systems Pub Date : 1999-06-05 DOI: 10.1109/SLFSTB.1999.777485

Oliver E. Theel, F. Freiling

{"title":"An exercise in proving convergence through transfer functions","authors":"Oliver E. Theel, F. Freiling","doi":"10.1109/SLFSTB.1999.777485","DOIUrl":"https://doi.org/10.1109/SLFSTB.1999.777485","url":null,"abstract":"Self-stabilizing algorithms must fulfill two requirements generally called closure and convergence. We are interested in the convergence property and discuss a new method for proving it. Usually proving the convergence of self-stabilizing algorithms requires a well foundedness argument: briefly spoken it involves exhibiting a convergence function which is shown to decrease with every transition of the algorithm, starting in an illegal state. Devising such a convergence function can be difficult task, since it must bear in itself the essence of stabilization which lies within the algorithm. We explore how to utilize results from control theory to proving the stability of self-stabilizing algorithms. We define a simple stabilization task and adapt stability criteria for linear control circuits to construct a self-stabilizing algorithm which solves the task. In contrast to the usual procedure in which finding a convergence function is an afterthought of algorithm design, our approach can be seen as starting with a convergence function which is implicitly given through a so-called transfer function. Then, we construct an algorithm around it. It turns out that this methodology seems to adapt well to those settings which are quite difficult to handle by the traditional methodologies of self-stabilization.","PeriodicalId":395768,"journal":{"name":"Proceedings 19th IEEE International Conference on Distributed Computing Systems","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126582475","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}

引用次数: 19

Scalable self-stabilization 可伸缩的自动稳定

Proceedings 19th IEEE International Conference on Distributed Computing Systems Pub Date : 1999-06-05 DOI: 10.1109/SLFSTB.1999.777482

Sukumar Ghosh, Xin He

引用次数: 21

Self-stabilizing max-heap 稳定max-heap

Proceedings 19th IEEE International Conference on Distributed Computing Systems Pub Date : 1999-06-05 DOI: 10.1109/SLFSTB.1999.777492

L. O. Alima

引用次数: 3