Proceedings of 16th International Conference on Distributed Computing Systems最新文献_第6页

Parallel simulation of mesh routing algorithms 网格路由算法的并行仿真

Proceedings of 16th International Conference on Distributed Computing Systems Pub Date : 1996-05-27 DOI: 10.1109/ICDCS.1996.507913

S. Rahman, C. Das

引用次数: 1

General connection rerouting method for various connection-oriented mobile communication networks 用于各种面向连接的移动通信网络的通用连接重路由方法

Proceedings of 16th International Conference on Distributed Computing Systems Pub Date : 1996-05-27 DOI: 10.1109/ICDCS.1996.507929

Min-ho Song, Yanghee Choi, Chongsang Kim

引用次数: 2

Fault-tolerant clock synchronization of large multicomputers via multistep interactive convergence 基于多步交互收敛的大型多机容错时钟同步

Proceedings of 16th International Conference on Distributed Computing Systems Pub Date : 1996-05-27 DOI: 10.1109/ICDCS.1996.507923

Marcelo M. de Azevedo, D. Blough

{"title":"Fault-tolerant clock synchronization of large multicomputers via multistep interactive convergence","authors":"Marcelo M. de Azevedo, D. Blough","doi":"10.1109/ICDCS.1996.507923","DOIUrl":"https://doi.org/10.1109/ICDCS.1996.507923","url":null,"abstract":"We present a fault-tolerant algorithm that internally synchronizes clocks in multicomputer systems employing not completely connected networks (NCCNs). The algorithm is referred to as multistep interactive convergence, and is locally implemented in each node by a time sewer process (TSP). The algorithm proceeds in rounds, and bases its operation on a logical mapping of the system's TSPs into an m-dimensional array. A TSP executes m steps per round, each step including a call to an interactive convergence procedure. Clock readings in step i are gathered only from TSPs sharing a row along dimension i of the array, which reduces the number of messages by orders of magnitude over a conventional interactive convergence algorithm. The algorithm can be used in systems of arbitrary topology, and provides the added benefit of increased locality of communication in regular NCCNs. These advantages can be combined with a variety of message staggering mechanisms to maintain network contention at a minimum. We characterize the maximum clock skew maximum clock drift, maximum clock discontinuity, and number of messages produced by the algorithm, and show that it tolerates arbitrary faults. A comparison with other algorithms is provided.","PeriodicalId":159322,"journal":{"name":"Proceedings of 16th International Conference on Distributed Computing Systems","volume":"313 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120940857","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}

引用次数: 13

Monotone response-time derivation for distributed execution of rule-based programs 基于规则的程序分布式执行的单调响应时间派生

Proceedings of 16th International Conference on Distributed Computing Systems Pub Date : 1996-05-27 DOI: 10.1109/ICDCS.1996.507900

Rwo-Hsi Wang, A. Mok

引用次数: 0

Dynamic resource migration for multiparty real-time communication 用于多方实时通信的动态资源迁移

Proceedings of 16th International Conference on Distributed Computing Systems Pub Date : 1996-05-27 DOI: 10.1109/ICDCS.1996.508016

R. Bettati, Amit Gupta

引用次数: 10

A low-overhead recovery technique using quasi-synchronous checkpointing 一种使用准同步检查点的低开销恢复技术

Proceedings of 16th International Conference on Distributed Computing Systems Pub Date : 1996-05-27 DOI: 10.1109/ICDCS.1996.507906

D. Manivannan, M. Singhal

{"title":"A low-overhead recovery technique using quasi-synchronous checkpointing","authors":"D. Manivannan, M. Singhal","doi":"10.1109/ICDCS.1996.507906","DOIUrl":"https://doi.org/10.1109/ICDCS.1996.507906","url":null,"abstract":"In this paper, we propose a quasi-synchronous checkpointing algorithm and a low-overhead recovery algorithm based on it. The checkpointing algorithm preserves process autonomy by allowing them to take checkpoints asynchronously and uses communication-induced checkpoint coordination for the progression of the recovery line which helps bound rollback propagation during a recovery. Thus, it has the easiness and low overhead of asynchronous checkpointing and the recovery time advantages of synchronous checkpointing. There is no extra message overhead involved during checkpointing and the additional checkpointing overhead is nominal. The algorithm ensures the existence of a recovery line consistent with the latest checkpoint of any process all the time. The recovery algorithm exploits this feature to restore the system to a state consistent with the latest checkpoint of a failed process. The recovery algorithm has no domino effect and a failed process needs only to rollback to its latest checkpoint and request the other processes to roll back to a consistent checkpoint. To avoid domino effect, it uses selective pessimistic message logging at the receiver end. The recovery is asynchronous for single process failure. Neither the recovery algorithm nor the checkpointing algorithm requires the channels to be FIFO. We do not use vector timestamps for determining dependency between checkpoints since vector timestamps generally result in high message overhead during failure-free operation.","PeriodicalId":159322,"journal":{"name":"Proceedings of 16th International Conference on Distributed Computing Systems","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126264384","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}

引用次数: 140

Group communication for upgrading distributed programs 用于升级分布式程序的群通信

Proceedings of 16th International Conference on Distributed Computing Systems Pub Date : 1996-05-27 DOI: 10.1109/ICDCS.1996.507990

H. Higaki, Y. Hirakawa

引用次数: 9

Data mining for path traversal patterns in a web environment web环境中路径遍历模式的数据挖掘

Proceedings of 16th International Conference on Distributed Computing Systems Pub Date : 1996-05-27 DOI: 10.1109/ICDCS.1996.507986

Ming-Syan Chen, Jong Soo Park, Philip S. Yu

引用次数: 17

An efficient causal ordering algorithm for mobile computing environments 移动计算环境下一种高效的因果排序算法

Proceedings of 16th International Conference on Distributed Computing Systems Pub Date : 1996-05-27 DOI: 10.1109/ICDCS.1996.508027

R. Prakash, M. Raynal, M. Singhal

引用次数: 78

Sentries for the execution of concurrent programs 执行并发程序的哨兵

Proceedings of 16th International Conference on Distributed Computing Systems Pub Date : 1996-05-27 DOI: 10.1109/ICDCS.1996.507896

S. Chodrow, M. Gouda

{"title":"Sentries for the execution of concurrent programs","authors":"S. Chodrow, M. Gouda","doi":"10.1109/ICDCS.1996.507896","DOIUrl":"https://doi.org/10.1109/ICDCS.1996.507896","url":null,"abstract":"The sentry of a concurrent program P is a program that executes concurrently with P, periodically takes snapshots of P, and issues a warning if it detects that some snapshot does not satisfy a predefined predicate. The sentry is unique among snapshot-taking systems in its low-overhead. First, the shared storage between the observed program P and the sentry is linear in the number of P variables that are being observed. Second, the observed program P never waits for the sentry. Third, the mutual exclusion between the observed program and the sentry is achieved without using any special hardware or software constructs. In this paper, we present a family of two sentries. One sentry can be used for taking snapshots of scalar variables (and can check whether these snapshots satisfy a given propositional predicate), and the other sentry can be used for taking snapshots of complex variables such as arrays (and can check whether these snapshots satisfy a given first-order predicate). We briefly describe a system prototype for automatically generating sentries for any given concurrent program, and present some encouraging empirical results that we obtained from this prototype.","PeriodicalId":159322,"journal":{"name":"Proceedings of 16th International Conference on Distributed Computing Systems","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124750062","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}

引用次数: 1