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

A multi-level explicit rate control scheme for ABR traffic with heterogeneous service requirements 一种针对异构业务需求的ABR流量的多级显式速率控制方案

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

J. Liebeherr, I. Akyildiz, A. Tai

引用次数: 6

Object migration in non-monolithic distributed applications 非单片分布式应用程序中的对象迁移

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

Oliver Ciupke, D. Kottmann, H. Walter

引用次数: 15

A snapshot algorithm for distributed mobile systems 分布式移动系统的快照算法

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

Yasuo Sato, M. Inoue, T. Masuzawa, H. Fujiwara

引用次数: 18

Aster: a framework for sound customization of distributed runtime systems Aster:用于分布式运行时系统的良好定制的框架

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

V. Issarny, C. Bidan

引用次数: 49

Implementation of recoverable distributed shared memory by logging writes 通过记录写入实现可恢复的分布式共享内存

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

Sundar Kanthadai, J. Welch

引用次数: 13

Language support for long-lived concurrent activities 对长期并发活动的语言支持

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

M. Papazoglou, A. Delis, M. Haghjoo, A. Bouguettaya

引用次数: 5

A semi-automated verification method for communication protocols modeled as 2-ECFSMs 建模为2-ECFSMs的通信协议的半自动验证方法

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

M. Higuchi, Junko Sano, K. Hara, M. Fujii

{"title":"A semi-automated verification method for communication protocols modeled as 2-ECFSMs","authors":"M. Higuchi, Junko Sano, K. Hara, M. Fujii","doi":"10.1109/ICDCS.1996.507927","DOIUrl":"https://doi.org/10.1109/ICDCS.1996.507927","url":null,"abstract":"Previously, we proposed a verification method via invariants for communication protocol modeled as 2-ECPSMs. In the proposed method, a human verifier describes an invariant of a given protocol in a disjunctive normal form, and a verification system shows safety or liveness based on the invariant. The tedious work on describing invariant formulae is the most significant shortcoming of the proposed method. This paper deals with a semi-automated derivation of invariant formulae for communication protocol modeled as 2-ECFSMs. In the method, the logical formula which holds on a subset of reachable states is automatically generated. Such a subset consists of states which are teachable by synchronous communication from the initial states and those which are reachable by sequences of sending transitions from synchronously reachable states. To obtain an invariant, a human verifier supplements several disjuncts for other part of reachability set. We conducted an experiment on deriving an invariant formula of a sample protocol extracted from the OSI session protocol. By the result, 636 conjunctive formulae were automatically derived and the conjunction of those formulae was shown to be an invariant of the sample protocol, i.e. the sample protocol was shown to be safe automatically.","PeriodicalId":159322,"journal":{"name":"Proceedings of 16th International Conference on Distributed Computing Systems","volume":"19 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":"132013964","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

Strong interaction fairness via randomization 通过随机化实现强交互公平性

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

Yuh-Jzer Joung, S. Smolka

引用次数: 27

An embeddable and extendable language for large-scale programming on the Internet 一种可嵌入和可扩展的语言，用于Internet上的大规模编程

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

Peter Becker

引用次数: 14

Optimal deadlock detection in distributed systems based on locally constructed wait-for graphs 基于局部构造等待图的分布式系统死锁检测

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

Shigang Chen, Yi Deng, P. Attie, Wei Sun

{"title":"Optimal deadlock detection in distributed systems based on locally constructed wait-for graphs","authors":"Shigang Chen, Yi Deng, P. Attie, Wei Sun","doi":"10.1109/ICDCS.1996.508012","DOIUrl":"https://doi.org/10.1109/ICDCS.1996.508012","url":null,"abstract":"We present a new algorithm for detecting generalized deadlocks in distributed systems. Our algorithm incrementally constructs and reduces a wait-for graph (WFG) at an initiator process. This WFG is then searched for deadlock. The proposed algorithm has two primary advantages: First, it avoids sending messages along the edges of the global wait-for graph (WFG), thereby achieving a worst-case message complexity of 2n, where n is the number of processes in the WFG. Since information must be obtained from every process reachable from the initiator, this is optimal to within a constant factor. All the existing algorithms for the same problem construct a distributed snapshot of the WFG. As this involves sending messages along the edges of the WFG, the best available message complexity among these algorithms is 4e-2n+2l, which is O(n/sup 2/) in the worst case, where e and l are the number of edges and leaves in the WFG, respectively. Second, since the information about a detected deadlock is readily available at the initiator process, rather than distributed among different processes, it significantly simplifies the task of deadlock resolution, and helps to reduce system overhead associated with the resolution. The time complexity of our algorithm is also better than or equal to the existing algorithms.","PeriodicalId":159322,"journal":{"name":"Proceedings of 16th International Conference on Distributed Computing Systems","volume":"16 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":"115622428","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}

引用次数: 41