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

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

筛选
英文 中文
Self-stabilizing real-time rule-based systems 自稳定的实时基于规则的系统
[1992] Proceedings 11th Symposium on Reliable Distributed Systems Pub Date : 1992-10-05 DOI: 10.1109/RELDIS.1992.235129
A. Cheng
{"title":"Self-stabilizing real-time rule-based systems","authors":"A. Cheng","doi":"10.1109/RELDIS.1992.235129","DOIUrl":"https://doi.org/10.1109/RELDIS.1992.235129","url":null,"abstract":"The problem of automated recovery in distributed real-time rule-based systems where internal variables may be corrupted during computation as a result of transient faults is discussed. Given a distributed rule-based program p with bounded response time, the problem is to derive a self-stabilizing program q that implements p with the constraint that q must also have bounded response time. An approach for solving this problem for a class of rule-based programs with bounded response time is presented.<<ETX>>","PeriodicalId":214473,"journal":{"name":"[1992] Proceedings 11th Symposium on Reliable Distributed Systems","volume":"106 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":"122614436","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}
引用次数: 14
Dependability analysis of distributed computing systems using stochastic Petri nets 基于随机Petri网的分布式计算系统可靠性分析
[1992] Proceedings 11th Symposium on Reliable Distributed Systems Pub Date : 1992-10-05 DOI: 10.1109/RELDIS.1992.235139
N. Lopez-Benitez
{"title":"Dependability analysis of distributed computing systems using stochastic Petri nets","authors":"N. Lopez-Benitez","doi":"10.1109/RELDIS.1992.235139","DOIUrl":"https://doi.org/10.1109/RELDIS.1992.235139","url":null,"abstract":"Models based on stochastic Petri nets are developed to estimate the reliability/availability of distributed systems. The modeling approach discussed combines stochastic Petri net modeling and previous reliability algorithms so that not only can failures of nodes and links be modeled, but also the effect of global repairs can be considered. The models can be used to derive estimations on the successful execution of one or more programs distributed in the system. In a distributed computing environment successful execution means that all distributed programs can access all the required remote files even in the presence of faults. A global repair model for a small system is considered in detail. A generalization and the results reported for complex systems were obtained by using the Stochastic Petri Net Package (SPNP).<<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":"130592530","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
Dynamic management of highly replicated data 高复制数据的动态管理
[1992] Proceedings 11th Symposium on Reliable Distributed Systems Pub Date : 1992-10-05 DOI: 10.1109/RELDIS.1992.235146
Jehan-Francois Pâris, P. K. Sloope
{"title":"Dynamic management of highly replicated data","authors":"Jehan-Francois Pâris, P. K. Sloope","doi":"10.1109/RELDIS.1992.235146","DOIUrl":"https://doi.org/10.1109/RELDIS.1992.235146","url":null,"abstract":"An efficient replication control protocol, called the dynamic group protocol, for managing replicated data objects that have more than five replicas is presented. Like the grid protocol, the dynamic group protocol requires only O( square root n) messages per access to enforce mutual consistency among n replicas. Unlike other protocols aimed at providing fast access, this protocol adapts itself to changes in site availability and network connectivity, which allows it to tolerate n-2 successive replica failures. The availability of a replicated object consisting of n replicas managed by the dynamic group protocol when the n replicas are on the same LAN segment, is evaluated under standard Markovian assumptions and found to equal that of an object with the same number of replicas, managed by the dynamic-linear voting protocol.<<ETX>>","PeriodicalId":214473,"journal":{"name":"[1992] Proceedings 11th Symposium on Reliable Distributed Systems","volume":"118 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":"121422182","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}
引用次数: 6
Dataflow-like languages for real-time systems: issues of computational models and notation 用于实时系统的类数据流语言:计算模型和符号的问题
[1992] Proceedings 11th Symposium on Reliable Distributed Systems Pub Date : 1992-10-05 DOI: 10.1109/RELDIS.1992.235124
A. Bondavalli, L. Strigini, L. Simoncini
{"title":"Dataflow-like languages for real-time systems: issues of computational models and notation","authors":"A. Bondavalli, L. Strigini, L. Simoncini","doi":"10.1109/RELDIS.1992.235124","DOIUrl":"https://doi.org/10.1109/RELDIS.1992.235124","url":null,"abstract":"The use of dataflow-like models for the in-the-large design of real-time applications is discussed. In these models, modules can only communicate by (asynchronously) receiving messages when activated and transmitting result messages when terminating. This rather restrictive computational model allows the description of typical, cyclic control programs, with predictable, well-verifiable behavior. In particular, important timing properties can be dealt with in the in-the-large design. The case for the use of dataflow-like models is outlined, and the choice of appropriate notations, which implies a tradeoff between predictability of behavior and expressive power, and the potential for an advanced design support environment are discussed.<<ETX>>","PeriodicalId":214473,"journal":{"name":"[1992] Proceedings 11th Symposium on Reliable Distributed Systems","volume":"18 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":"122026296","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}
引用次数: 12
Reliable broadcasting in faulty hypercube computers 故障超立方体计算机的可靠广播
[1992] Proceedings 11th Symposium on Reliable Distributed Systems Pub Date : 1992-10-05 DOI: 10.1109/RELDIS.1992.235135
Jie Wu, E. Fernández
{"title":"Reliable broadcasting in faulty hypercube computers","authors":"Jie Wu, E. Fernández","doi":"10.1109/RELDIS.1992.235135","DOIUrl":"https://doi.org/10.1109/RELDIS.1992.235135","url":null,"abstract":"A nonredundant broadcasting algorithm for faulty hypercube computers is proposed. The concept of unsafe nodes is introduced to identify those nonfaulty nodes that will cause a detour or backtracking because of their proximity to faulty nodes. It is assumed that each healthy node, safe or unsafe, knows the status of all the neighboring nodes. The broadcasting is optimal, meaning that a message is sent to each node via a Hamming distance path if the broadcasting is initiated from a safe node. It is also shown that when the source node is unsafe and there is an adjacent safe node, then the broadcasting can be achieved with only one more time step than the fault-free case.<<ETX>>","PeriodicalId":214473,"journal":{"name":"[1992] Proceedings 11th Symposium on Reliable Distributed Systems","volume":"94 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":"121292372","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}
引用次数: 25
The sentry system 岗哨系统
[1992] Proceedings 11th Symposium on Reliable Distributed Systems Pub Date : 1992-10-05 DOI: 10.1109/RELDIS.1992.235122
S. Chodrow, M. Gouda
{"title":"The sentry system","authors":"S. Chodrow, M. Gouda","doi":"10.1109/RELDIS.1992.235122","DOIUrl":"https://doi.org/10.1109/RELDIS.1992.235122","url":null,"abstract":"A system that observes the execution of each loop in any given sequential program and issues a warning if some loop execution does not terminate as expected (due to a programming error or a failure) is proposed. At each iteration of a loop execution, the program writes the current values of some variables into shared storage; these values are read later by another program called the sentry. The sentry uses these values to compute the loop's termination function at the current iteration, and issues a warning if successive values of the termination function are not monotonically decreasing. The shared storage between the program and the sentry is finite, the program never waits for the sentry during execution, and some form of mutual exclusion is achieved between the program and the sentry. Extensions of the system and an implementation of a prototype are described.<<ETX>>","PeriodicalId":214473,"journal":{"name":"[1992] Proceedings 11th Symposium on Reliable Distributed Systems","volume":"6 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":"132714250","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}
引用次数: 9
Optimal replica control protocols for ring networks 环状网络的最优副本控制协议
[1992] Proceedings 11th Symposium on Reliable Distributed Systems Pub Date : 1992-10-05 DOI: 10.1109/RELDIS.1992.235142
M. Spasojevic
{"title":"Optimal replica control protocols for ring networks","authors":"M. Spasojevic","doi":"10.1109/RELDIS.1992.235142","DOIUrl":"https://doi.org/10.1109/RELDIS.1992.235142","url":null,"abstract":"Distributed computing environments are expected to offer highly available services. Replication of data is one of the main techniques used to achieve this goal. Protocols that achieve optimal performance in replicating data for ring networks are discussed. Coteries, proposed by H. Garcia-Molina and D. Barbara (1985), provide the most general framework for analyzing static pessimistic protocols. It is shown that a simple voting scheme, a very small class of the coterie scheme, provides optimal performance for several variations of the ring interconnection topology.<<ETX>>","PeriodicalId":214473,"journal":{"name":"[1992] Proceedings 11th Symposium on Reliable Distributed Systems","volume":"24 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":"121077747","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}
引用次数: 2
Sensitivity and uncertainty analysis in performability modelling 性能建模中的敏感性和不确定性分析
[1992] Proceedings 11th Symposium on Reliable Distributed Systems Pub Date : 1992-10-05 DOI: 10.1109/RELDIS.1992.235138
B. Haverkort, Adrianus M. H. Meeuwissen
{"title":"Sensitivity and uncertainty analysis in performability modelling","authors":"B. Haverkort, Adrianus M. H. Meeuwissen","doi":"10.1109/RELDIS.1992.235138","DOIUrl":"https://doi.org/10.1109/RELDIS.1992.235138","url":null,"abstract":"The authors present an exact Taylor series model of steady state performability measures and discuss the validity region of this approximation. They also describe an uncertainty analysis approach based on Monte Carlo simulation, apply both approaches to a performability mode, and discuss their relative merits. They vary the dependencies between model parameters and discuss their influence. For the case studies done, the sensitivity analysis overestimated the mean performability and underestimated its variance.<<ETX>>","PeriodicalId":214473,"journal":{"name":"[1992] Proceedings 11th Symposium on Reliable Distributed Systems","volume":"26 2 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":"123495759","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
Availability of coding based replication schemes 基于编码的复制方案的可用性
[1992] Proceedings 11th Symposium on Reliable Distributed Systems Pub Date : 1992-10-05 DOI: 10.1109/RELDIS.1992.235137
G. Agrawal
{"title":"Availability of coding based replication schemes","authors":"G. Agrawal","doi":"10.1109/RELDIS.1992.235137","DOIUrl":"https://doi.org/10.1109/RELDIS.1992.235137","url":null,"abstract":"The availability of a coding-based replication scheme where simple voting is used to maintain correctness of replicated data is evaluated. It is shown that the storage requirement for maintaining the data with a given availability is reduced significantly. The ways that some of the extensions of the voting scheme can be modified to manage this coding-based replication are also described. The availability of these is evaluated, and the reduction in the storage space requirements achieved is studied.<<ETX>>","PeriodicalId":214473,"journal":{"name":"[1992] Proceedings 11th Symposium on Reliable Distributed Systems","volume":"33 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":"122222370","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}
引用次数: 4
A state machine approach to reliable distributed systems 可靠分布式系统的状态机方法
[1992] Proceedings 11th Symposium on Reliable Distributed Systems Pub Date : 1992-10-05 DOI: 10.1109/RELDIS.1992.235125
A. Lim, S. A. Friedberg
{"title":"A state machine approach to reliable distributed systems","authors":"A. Lim, S. A. Friedberg","doi":"10.1109/RELDIS.1992.235125","DOIUrl":"https://doi.org/10.1109/RELDIS.1992.235125","url":null,"abstract":"In many distributed applications, processes synchronize with one another in a complex way and execute for a long period of time. Atomic transactions are inadequate for designing reliable applications with these characteristics, because transactions restrict the types of synchronization than can be specified. An alternative approach that exploits behavior specified in a hierarchical finite-state machine (FSM) model is proposed. A set of general conditions that ensures the correctness of recovery is identified. These general conditions permit combinations of different types of recovery methods to be used in a recovery. They also enable one to enhance recovery efficiency by exploiting permutation and substitution of operations allowed by the behavior specification. It is shown that existing recovery techniques, including those that exploit application semantics, satisfy these conditions for correctness of recovery.<<ETX>>","PeriodicalId":214473,"journal":{"name":"[1992] Proceedings 11th Symposium on Reliable Distributed Systems","volume":"144 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":"122411866","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}
引用次数: 4
下一页 尾页
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学术官方微信
小红书