Pub Date : 1989-06-05DOI: 10.1109/ICDCS.1989.37949
J. Ostroff
Decision procedures are presented for checking a small but useful class of properties for any finite-state system consisting of real-time discrete-event processes. A timed transition model (TTM) is used for representing real-time discrete-event processes, and real-time temporal logic (RTTL) is the assertion language in which the property to be verified is stated. The relationship of TTMs to other formalisms is summarized along with a complete definition of TTMs and an overview of RTTL. The construction of reachability graphs is discussed, two different procedures are presented for constructing reachability graphs, and the corresponding decision procedures are given.<>
{"title":"Verifying finite state real-time discrete event processes","authors":"J. Ostroff","doi":"10.1109/ICDCS.1989.37949","DOIUrl":"https://doi.org/10.1109/ICDCS.1989.37949","url":null,"abstract":"Decision procedures are presented for checking a small but useful class of properties for any finite-state system consisting of real-time discrete-event processes. A timed transition model (TTM) is used for representing real-time discrete-event processes, and real-time temporal logic (RTTL) is the assertion language in which the property to be verified is stated. The relationship of TTMs to other formalisms is summarized along with a complete definition of TTMs and an overview of RTTL. The construction of reachability graphs is discussed, two different procedures are presented for constructing reachability graphs, and the corresponding decision procedures are given.<<ETX>>","PeriodicalId":266544,"journal":{"name":"[1989] Proceedings. The 9th International Conference on Distributed Computing Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1989-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120976561","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}
Pub Date : 1989-06-05DOI: 10.1109/ICDCS.1989.37993
S. Shatz, Khanh Mai, D. Moorthi, J. Woodward
A discussion is presented of research on the development of a toolkit that supports general static analysis using a Petri net framework for Ada tasking. The toolkit integrates some custom and general-purpose tools. The custom tools were defined and implemented specifically for research in Ada tasking analysis; the general-purpose tools are Petri net tools developed to support arbitrary Petri-net-based research. The analysis toolkit is divided into two major subsystems. The first is the front-end translator subsystem, which translates Ada source (or design-level source specified in a design language called Ada Tasking Language) into a Petri net format. The translation allows one to base current and future analysis techniques on a model that is both theoretically mature and actively investigated. The second is the back-end information display subsystem, which receives user queries and presents tasking analysis results. Example Ada tasking programs are used to demonstrate the utility of the tools individually as well as collectively.<>
{"title":"A toolkit for automated support of Ada tasking analysis","authors":"S. Shatz, Khanh Mai, D. Moorthi, J. Woodward","doi":"10.1109/ICDCS.1989.37993","DOIUrl":"https://doi.org/10.1109/ICDCS.1989.37993","url":null,"abstract":"A discussion is presented of research on the development of a toolkit that supports general static analysis using a Petri net framework for Ada tasking. The toolkit integrates some custom and general-purpose tools. The custom tools were defined and implemented specifically for research in Ada tasking analysis; the general-purpose tools are Petri net tools developed to support arbitrary Petri-net-based research. The analysis toolkit is divided into two major subsystems. The first is the front-end translator subsystem, which translates Ada source (or design-level source specified in a design language called Ada Tasking Language) into a Petri net format. The translation allows one to base current and future analysis techniques on a model that is both theoretically mature and actively investigated. The second is the back-end information display subsystem, which receives user queries and presents tasking analysis results. Example Ada tasking programs are used to demonstrate the utility of the tools individually as well as collectively.<<ETX>>","PeriodicalId":266544,"journal":{"name":"[1989] Proceedings. The 9th International Conference on Distributed Computing Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1989-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123274584","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}
Pub Date : 1989-06-05DOI: 10.1109/ICDCS.1989.37940
P. Melliar-Smith, L. Moser
Distributed systems present problems of maintaining consistency of distributed data in the presence of faults. These problems are currently solved by agreement protocols that require many messages to be exchanged between processors with adverse effects on system performance. An approach is presented to the design of fault-tolerant distributed systems that avoids this message exchange, resulting in systems that are substantially more efficient. This approach is based on broadcast communication over a local area network such as the Ethernet, and on two novel protocols: the Trans protocol which provides efficient reliable broadcast communication, and the Total protocol which, with high probability, promptly takes a total order on messages and achieves distributed agreement even in the presence of a fault. Reliable distributed operations, such as locking, update, and commitment, require only a single broadcast message rather than the several tens of messages required by current algorithms.<>
{"title":"Fault-tolerant distributed systems based on broadcast communication","authors":"P. Melliar-Smith, L. Moser","doi":"10.1109/ICDCS.1989.37940","DOIUrl":"https://doi.org/10.1109/ICDCS.1989.37940","url":null,"abstract":"Distributed systems present problems of maintaining consistency of distributed data in the presence of faults. These problems are currently solved by agreement protocols that require many messages to be exchanged between processors with adverse effects on system performance. An approach is presented to the design of fault-tolerant distributed systems that avoids this message exchange, resulting in systems that are substantially more efficient. This approach is based on broadcast communication over a local area network such as the Ethernet, and on two novel protocols: the Trans protocol which provides efficient reliable broadcast communication, and the Total protocol which, with high probability, promptly takes a total order on messages and achieves distributed agreement even in the presence of a fault. Reliable distributed operations, such as locking, update, and commitment, require only a single broadcast message rather than the several tens of messages required by current algorithms.<<ETX>>","PeriodicalId":266544,"journal":{"name":"[1989] Proceedings. The 9th International Conference on Distributed Computing Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1989-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125558230","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}
Pub Date : 1989-06-05DOI: 10.1109/ICDCS.1989.37987
R. Gaglianello, B. Robinson, T. Lindstrom, E. E. Sampieri
A system is described that combines the major strengths of local area networks and multicomputers, namely resource sharing over geographically significant distances and small communication latencies. The result is a new architecture called a local area multicomputer (LAM). The system that is described attempts to solve the seemingly incompatible needs of the two application domains by utilizing a high-capacity, low-latency interconnection network called the HPC supported by the VORX multiprocessor computing environment. For systems with hundreds of nodes, the network capacity is in the Gb/s range, and the latency for small messages is about 10 mu s. The HPC can connect resources located several kilometers apart. The VORX environment provides the necessary program development tools and resource management functions needed to experiment with distributed applications. Two applications are outlined to show the diverse uses for a LAM system and the status of an 80-node system that includes 70 adjunct processors and ten SUN 3 workstations/fileservers.<>
{"title":"HPC/VORX: a local area multicomputer system","authors":"R. Gaglianello, B. Robinson, T. Lindstrom, E. E. Sampieri","doi":"10.1109/ICDCS.1989.37987","DOIUrl":"https://doi.org/10.1109/ICDCS.1989.37987","url":null,"abstract":"A system is described that combines the major strengths of local area networks and multicomputers, namely resource sharing over geographically significant distances and small communication latencies. The result is a new architecture called a local area multicomputer (LAM). The system that is described attempts to solve the seemingly incompatible needs of the two application domains by utilizing a high-capacity, low-latency interconnection network called the HPC supported by the VORX multiprocessor computing environment. For systems with hundreds of nodes, the network capacity is in the Gb/s range, and the latency for small messages is about 10 mu s. The HPC can connect resources located several kilometers apart. The VORX environment provides the necessary program development tools and resource management functions needed to experiment with distributed applications. Two applications are outlined to show the diverse uses for a LAM system and the status of an 80-node system that includes 70 adjunct processors and ten SUN 3 workstations/fileservers.<<ETX>>","PeriodicalId":266544,"journal":{"name":"[1989] Proceedings. The 9th International Conference on Distributed Computing Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1989-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129869130","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}
Pub Date : 1989-06-05DOI: 10.1109/ICDCS.1989.37934
L. Gong
A framework for designing a type of distributed authentication protocol is given, whose security and availability are higher compared to those of centralized ones. It uses the technique of secret sharing and introduces a cross checksum scheme to achieve secure replication. Fewer than a certain number of malicious servers cannot damage security except by causing denial of service, and this only happens when too many honest servers accidentally fail at the same time. The protocol is suited to an environment where no trustworthiness of any server is permanently guaranteed. The approach is general enough not to rely on any particular authentication protocol. Existing implementations need minor modification. Only a short piece of code is needed to run the implementations as many times as required. Hence, different centralized protocols can be incorporated into one distributed protocol.<>
{"title":"Securely replicating authentication services","authors":"L. Gong","doi":"10.1109/ICDCS.1989.37934","DOIUrl":"https://doi.org/10.1109/ICDCS.1989.37934","url":null,"abstract":"A framework for designing a type of distributed authentication protocol is given, whose security and availability are higher compared to those of centralized ones. It uses the technique of secret sharing and introduces a cross checksum scheme to achieve secure replication. Fewer than a certain number of malicious servers cannot damage security except by causing denial of service, and this only happens when too many honest servers accidentally fail at the same time. The protocol is suited to an environment where no trustworthiness of any server is permanently guaranteed. The approach is general enough not to rely on any particular authentication protocol. Existing implementations need minor modification. Only a short piece of code is needed to run the implementations as many times as required. Hence, different centralized protocols can be incorporated into one distributed protocol.<<ETX>>","PeriodicalId":266544,"journal":{"name":"[1989] Proceedings. The 9th International Conference on Distributed Computing Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1989-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128606669","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}
Pub Date : 1989-06-05DOI: 10.1109/ICDCS.1989.37989
Joel C. Adams, K. Ramarao
The problem of correctly identifying the faulty processors and links in a distributed system where faulty behavior is unrestricted (Byzantine) is examined. A very general class of algorithms called evidence-based diagnosis algorithms is proposed that encompasses all past approaches to the diagnosis problem. An algorithm is presented which is proven optimal in this class. It is further shown that, in the worst case, no evidence-based diagnosis algorithm can guarantee that its diagnosis is both correct and complete, when evidence can be false. It is argued both analytically and from experimental data that in systems of N processors of which t can be faulty, the complexity of this algorithm is O(max(2 to the power of t/sup 2/, N/sup 2/)).<>
{"title":"Distributed diagnosis of Byzantine processors and links","authors":"Joel C. Adams, K. Ramarao","doi":"10.1109/ICDCS.1989.37989","DOIUrl":"https://doi.org/10.1109/ICDCS.1989.37989","url":null,"abstract":"The problem of correctly identifying the faulty processors and links in a distributed system where faulty behavior is unrestricted (Byzantine) is examined. A very general class of algorithms called evidence-based diagnosis algorithms is proposed that encompasses all past approaches to the diagnosis problem. An algorithm is presented which is proven optimal in this class. It is further shown that, in the worst case, no evidence-based diagnosis algorithm can guarantee that its diagnosis is both correct and complete, when evidence can be false. It is argued both analytically and from experimental data that in systems of N processors of which t can be faulty, the complexity of this algorithm is O(max(2 to the power of t/sup 2/, N/sup 2/)).<<ETX>>","PeriodicalId":266544,"journal":{"name":"[1989] Proceedings. The 9th International Conference on Distributed Computing Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1989-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134415370","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}
Pub Date : 1989-06-05DOI: 10.1109/ICDCS.1989.37969
S. Nishio, K. F. Li, E. Manning
Two algorithms, control token transfer algorithm (CTTA) and regenerate, are proposed to realize mutual exclusion in a computer network environment using a resilient circulating token. The algorithm CTTA uses a message called token to transfer the privilege of entering a critical region among the participating sites. The algorithm regenerate checks whether the token is lost during system failures, and regenerates it if necessary. Failures in a computer network are classified into three types. The execution of these two algorithms is described for each type of system failure. To detect system failures, a time-out mechanism based on message delay is used.<>
{"title":"A time-out based resilient token transfer algorithm for mutual exclusion in computer networks","authors":"S. Nishio, K. F. Li, E. Manning","doi":"10.1109/ICDCS.1989.37969","DOIUrl":"https://doi.org/10.1109/ICDCS.1989.37969","url":null,"abstract":"Two algorithms, control token transfer algorithm (CTTA) and regenerate, are proposed to realize mutual exclusion in a computer network environment using a resilient circulating token. The algorithm CTTA uses a message called token to transfer the privilege of entering a critical region among the participating sites. The algorithm regenerate checks whether the token is lost during system failures, and regenerates it if necessary. Failures in a computer network are classified into three types. The execution of these two algorithms is described for each type of system failure. To detect system failures, a time-out mechanism based on message delay is used.<<ETX>>","PeriodicalId":266544,"journal":{"name":"[1989] Proceedings. The 9th International Conference on Distributed Computing Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1989-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132891449","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}
Pub Date : 1989-06-05DOI: 10.1109/ICDCS.1989.37992
James M. Purtilo, P. Jalote
An environment for prototyping distributed applications is described that supports different communication primitives with specified delays, and provides primitives to aid debugging and evaluation. The environment also supports heterogeneous computation in which processes can execute on different hardware. Different source languages can be used for coding different modules of the processes. The system has a centralized control and monitoring facility which is based on the Suntools window system. This approach allows users to develop distributed applications using existing languages and packages, as opposed to restricting users to using only specialized specification languages, and extends the type of work done by R. Hayes et al. (1988) by providing primitives to assist in profiling and instrumenting the applications.<>
{"title":"An environment for prototyping distributed applications","authors":"James M. Purtilo, P. Jalote","doi":"10.1109/ICDCS.1989.37992","DOIUrl":"https://doi.org/10.1109/ICDCS.1989.37992","url":null,"abstract":"An environment for prototyping distributed applications is described that supports different communication primitives with specified delays, and provides primitives to aid debugging and evaluation. The environment also supports heterogeneous computation in which processes can execute on different hardware. Different source languages can be used for coding different modules of the processes. The system has a centralized control and monitoring facility which is based on the Suntools window system. This approach allows users to develop distributed applications using existing languages and packages, as opposed to restricting users to using only specialized specification languages, and extends the type of work done by R. Hayes et al. (1988) by providing primitives to assist in profiling and instrumenting the applications.<<ETX>>","PeriodicalId":266544,"journal":{"name":"[1989] Proceedings. The 9th International Conference on Distributed Computing Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1989-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132850048","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}
Pub Date : 1989-06-05DOI: 10.1109/ICDCS.1989.37986
S. Koppolu, S. Thanawastien, R. Henry
A ring-based media access control protocol and architecture, Fast Ring, which combines the best features of the token ring and contention ring, is proposed. For this protocol, a free token circulates on the ring when the ring is idle. A ready station can transmit either by capturing the token or sensing the ring idle. The protocol works in such a way that the ready node which captures the free token, before or while transmitting, is able to continue transmission. All the other contending nodes have to stop their transmissions and then send the abort signal when they receive the upstream transmission. After its transmission, the successful station puts a free token on the ring and the protocol enters the token mode. It behaves like the token ring protocol until the ring becomes idle again when all the ready nodes complete their transmissions. Comparison of the performance of Fast Ring with those of contention ring, token ring, and carrier-sense multiaccess with collision detection protocols shows that the Fast Ring outperforms all these local area network protocols over the whole throughput range at all transmission rates.<>
{"title":"Fast Ring: a distributed architecture and protocol for local area distributed processing","authors":"S. Koppolu, S. Thanawastien, R. Henry","doi":"10.1109/ICDCS.1989.37986","DOIUrl":"https://doi.org/10.1109/ICDCS.1989.37986","url":null,"abstract":"A ring-based media access control protocol and architecture, Fast Ring, which combines the best features of the token ring and contention ring, is proposed. For this protocol, a free token circulates on the ring when the ring is idle. A ready station can transmit either by capturing the token or sensing the ring idle. The protocol works in such a way that the ready node which captures the free token, before or while transmitting, is able to continue transmission. All the other contending nodes have to stop their transmissions and then send the abort signal when they receive the upstream transmission. After its transmission, the successful station puts a free token on the ring and the protocol enters the token mode. It behaves like the token ring protocol until the ring becomes idle again when all the ready nodes complete their transmissions. Comparison of the performance of Fast Ring with those of contention ring, token ring, and carrier-sense multiaccess with collision detection protocols shows that the Fast Ring outperforms all these local area network protocols over the whole throughput range at all transmission rates.<<ETX>>","PeriodicalId":266544,"journal":{"name":"[1989] Proceedings. The 9th International Conference on Distributed Computing Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1989-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125121852","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}
Pub Date : 1989-06-05DOI: 10.1109/ICDCS.1989.37994
S. Yau, Kris W. I. Chen
An approach is presented for verifying the communication among modules in distributed computing system software. This approach is based on the inductive assertion method. The inference rules used in this approach are derived for verifying the partial correctness of communicating sequential modules. In this approach, the virtual circuits are used for synchronous message-passing. The advantage of this approach is that proofs of the satisfaction and noninterference are not needed, since no assumptions about the effects of receiving messages are made in the sequential proofs and the uses of shared auxiliary variables and universal assertions are carefully controlled during the process verification. Without these proofs, the user only needs to deal with the individual modules instead of the entire distributed computing system. The technique for detecting the deadlock of a program is given.<>
{"title":"An approach to verification of communication in distributed computing system software","authors":"S. Yau, Kris W. I. Chen","doi":"10.1109/ICDCS.1989.37994","DOIUrl":"https://doi.org/10.1109/ICDCS.1989.37994","url":null,"abstract":"An approach is presented for verifying the communication among modules in distributed computing system software. This approach is based on the inductive assertion method. The inference rules used in this approach are derived for verifying the partial correctness of communicating sequential modules. In this approach, the virtual circuits are used for synchronous message-passing. The advantage of this approach is that proofs of the satisfaction and noninterference are not needed, since no assumptions about the effects of receiving messages are made in the sequential proofs and the uses of shared auxiliary variables and universal assertions are carefully controlled during the process verification. Without these proofs, the user only needs to deal with the individual modules instead of the entire distributed computing system. The technique for detecting the deadlock of a program is given.<<ETX>>","PeriodicalId":266544,"journal":{"name":"[1989] Proceedings. The 9th International Conference on Distributed Computing Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1989-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131107442","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：