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

[1992] Proceedings 11th Symposium on Reliable Distributed Systems最新文献

筛选
英文 中文
Distributed problem solving in spite of processor failures 在处理器故障的情况下分布式解决问题
[1992] Proceedings 11th Symposium on Reliable Distributed Systems Pub Date : 1992-10-05 DOI: 10.1109/RELDIS.1992.235130
K.V.S. Ramarao, Subbarayan Venkatesan
{"title":"Distributed problem solving in spite of processor failures","authors":"K.V.S. Ramarao, Subbarayan Venkatesan","doi":"10.1109/RELDIS.1992.235130","DOIUrl":"https://doi.org/10.1109/RELDIS.1992.235130","url":null,"abstract":"Processor failures not leading to a network partition are considered, and the issue of computing associative functions in spite of processor failures is addressed. An intuitive and fundamental result formally proved is that failure detection and computing associative functions are equivalent in faulty networks: one can be performed if and only if the other can be performed. Protocols and impossibility results in various system models are presented in the context of computing associative functions and solving topological problems.<<ETX>>","PeriodicalId":214473,"journal":{"name":"[1992] Proceedings 11th Symposium on Reliable Distributed Systems","volume":"134 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116391993","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
K/sub I//sup T/L/sub G//sup O/: a generic logging service K/sub I//sup T/L/sub G//sup O/:通用的日志服务
[1992] Proceedings 11th Symposium on Reliable Distributed Systems Pub Date : 1992-10-05 DOI: 10.1109/RELDIS.1992.235133
M. Ruffin
{"title":"K/sub I//sup T/L/sub G//sup O/: a generic logging service","authors":"M. Ruffin","doi":"10.1109/RELDIS.1992.235133","DOIUrl":"https://doi.org/10.1109/RELDIS.1992.235133","url":null,"abstract":"A generic logging service should center to the variable and even antagonistic needs of clients, without imposing unnecessary overhead on clients that do not use all of its functions. A solution to this problem, called K/sub I//sup T/L/sub G//sup O/, is described in detail. It solves the problem by separating logging characteristics into five mechanisms: buffering policy, distribution of records, replication of records, sharing of logs, and management of physical media. Each characteristic is embodied in a class. For each class, multiple policy implementations can be provided. Instances of these classes are stackable in any appropriate number or order. A client customizes his log to a particular set of failure assumptions by selecting adequate classes, instantiating them, and connecting the instances together.<<ETX>>","PeriodicalId":214473,"journal":{"name":"[1992] Proceedings 11th Symposium on Reliable Distributed Systems","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126808259","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}
引用次数: 8
xAMp: a multi-primitive group communications service 多原语组通信服务
[1992] Proceedings 11th Symposium on Reliable Distributed Systems Pub Date : 1992-10-05 DOI: 10.1109/RELDIS.1992.235136
Luís E. T. Rodrigues, P. Veríssimo
{"title":"xAMp: a multi-primitive group communications service","authors":"Luís E. T. Rodrigues, P. Veríssimo","doi":"10.1109/RELDIS.1992.235136","DOIUrl":"https://doi.org/10.1109/RELDIS.1992.235136","url":null,"abstract":"The xAMp is a highly versatile group communications service aimed at supporting the development of distributed applications with different dependability, functionality, and performance requirements. These range from unreliable and nonordered to atomic multicast, and are enhanced by efficient group addressing and management support. The basic protocols are synchronous, clockless and designed to be used over broadcast local area networks (LANs), and are portable to a number of them. The functionality provided yields a reasonably complete solution to the problem of reliable group communication. While other protocols offer similar services, the authors follow a novel engineering approach by deriving all qualities of services from a single basic procedure. Thus, their implementation shares data structures, procedures, failure-recovery algorithms, and group monitor services, resulting in a highly integrated package.<<ETX>>","PeriodicalId":214473,"journal":{"name":"[1992] Proceedings 11th Symposium on Reliable Distributed Systems","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121165245","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}
引用次数: 90
The triangular lattice protocol: a highly fault tolerant and highly efficient protocol for replicated data 三角晶格协议:一种高度容错和高效的复制数据协议
[1992] Proceedings 11th Symposium on Reliable Distributed Systems Pub Date : 1992-10-05 DOI: 10.1109/RELDIS.1992.235141
Chienwen Wu, G. Belford
{"title":"The triangular lattice protocol: a highly fault tolerant and highly efficient protocol for replicated data","authors":"Chienwen Wu, G. Belford","doi":"10.1109/RELDIS.1992.235141","DOIUrl":"https://doi.org/10.1109/RELDIS.1992.235141","url":null,"abstract":"A protocol for managing replicated data in which data copies are organized as a triangular lattice is introduced. The smallest quorum size is O( square root N), where N is the number of data copies, which is currently considered optimal for a fully distributed environment. The protocol has the property of graceful degradation. The quorum sizes increase gradually as data copy failures increase. The protocol also has the property of asymptotically high availability, i.e., the availability approaches 1 as the number of data copies goes to infinity if the probability that a data copy available is greater than 0.5.<<ETX>>","PeriodicalId":214473,"journal":{"name":"[1992] Proceedings 11th Symposium on Reliable Distributed Systems","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122812621","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}
引用次数: 32
Communication protocols for fault-tolerant clock synchronization in not-completely connected networks 非完全连接网络中容错时钟同步的通信协议
[1992] Proceedings 11th Symposium on Reliable Distributed Systems Pub Date : 1992-10-05 DOI: 10.1109/RELDIS.1992.235134
M. J. Pfluegl, D. Blough
{"title":"Communication protocols for fault-tolerant clock synchronization in not-completely connected networks","authors":"M. J. Pfluegl, D. Blough","doi":"10.1109/RELDIS.1992.235134","DOIUrl":"https://doi.org/10.1109/RELDIS.1992.235134","url":null,"abstract":"Communications protocols for not-completely-connected networks are presented, and their cost is evaluated in terms of message exchanges. An efficient protocol tailored to convergence function clock synchronization is introduced. The number of messages used by this approach is equal to a proven lower bound on the number of messages and, hence, the approach is optimal. This protocol can be combined with a convergence function algorithm to achieve fault-tolerant clock synchronization in not-completely-connected networks at a far lower cost than previous approaches.<<ETX>>","PeriodicalId":214473,"journal":{"name":"[1992] Proceedings 11th Symposium on Reliable Distributed Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134518178","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}
引用次数: 3
Simulation of the Adapt on-line diagnosis algorithm for general topology networks 一般拓扑网络的Adapt在线诊断算法仿真
[1992] Proceedings 11th Symposium on Reliable Distributed Systems Pub Date : 1992-10-05 DOI: 10.1109/RELDIS.1992.235128
M. Stahl, R. Buskens, R. Bianchini
{"title":"Simulation of the Adapt on-line diagnosis algorithm for general topology networks","authors":"M. Stahl, R. Buskens, R. Bianchini","doi":"10.1109/RELDIS.1992.235128","DOIUrl":"https://doi.org/10.1109/RELDIS.1992.235128","url":null,"abstract":"As dependence on wide-area and other point-to-point networks increases, the need for diagnosis of the distributed resources becomes critical. Continuous online distributed diagnosis at the system-level provides a desirable solution. The Adapt algorithm, which performs online adaptive distributed diagnosis in arbitrary networks in the presence of node failures, is examined. Simulation results depicting operation for various network topologies are given, including test and message counts and diagnosis latency. The results indicate that Adapt performs significantly better than derived worst-case bounds. The best- and worst-case performance bounds are analyzed.<<ETX>>","PeriodicalId":214473,"journal":{"name":"[1992] Proceedings 11th Symposium on Reliable Distributed Systems","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134095590","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
A replicated object server for a distributed object-oriented system 用于分布式面向对象系统的复制对象服务器
[1992] Proceedings 11th Symposium on Reliable Distributed Systems Pub Date : 1992-10-05 DOI: 10.1109/RELDIS.1992.235148
P. Chevalier
{"title":"A replicated object server for a distributed object-oriented system","authors":"P. Chevalier","doi":"10.1109/RELDIS.1992.235148","DOIUrl":"https://doi.org/10.1109/RELDIS.1992.235148","url":null,"abstract":"The design and implementation of a replicated object server called Goofy, which is intended to provide a fault-tolerant storage system for distributed object-oriented applications, are described. Goofy supplies the object storage of the GUIDE (Grenoble Universities Integrated Distributed Environment) distributed object-oriented system with integrity, reliability and availability, while preserving object consistency despite network partition failures. Some preliminary experiments are described. Goofy is compared with related work on replicated servers, and the lessons drawn from this work and some conclusions on fault tolerance in GUIDE are given.<<ETX>>","PeriodicalId":214473,"journal":{"name":"[1992] Proceedings 11th Symposium on Reliable Distributed Systems","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124967918","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}
引用次数: 18
首页 上一页
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学术官方微信
小红书