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

Proceedings of IEEE 13th Symposium on Reliable Distributed Systems最新文献

筛选
英文 中文
Interaction of formal design systems in the development of a fault-tolerant clock synchronization circuit 在容错时钟同步电路开发中的形式设计系统的交互
Proceedings of IEEE 13th Symposium on Reliable Distributed Systems Pub Date : 1994-10-25 DOI: 10.1109/RELDIS.1994.336902
P. Miner, S. Pullela, S. Johnson
{"title":"Interaction of formal design systems in the development of a fault-tolerant clock synchronization circuit","authors":"P. Miner, S. Pullela, S. Johnson","doi":"10.1109/RELDIS.1994.336902","DOIUrl":"https://doi.org/10.1109/RELDIS.1994.336902","url":null,"abstract":"We propose a design strategy that exploits the strengths of different formal approaches to establish a reliable path from a mechanically verified high-level description to a concrete gate-level realization. We demonstrate the use of this approach in the realization of a fault-tolerant clock synchronization circuit. We used the Digital Design Derivation system (DDD) to derive a major portion of the design leaving relatively small portions to be verified either by use of a mechanical theorem prover (PVS) or by demonstrating boolean equivalence using Ordered Binary Decision Diagrams. The interface between the different formal systems has not yet been completely formalized but we believe our approach will provide an effective formal design path from high-level specifications to concrete realizations.<<ETX>>","PeriodicalId":373931,"journal":{"name":"Proceedings of IEEE 13th Symposium on Reliable Distributed Systems","volume":"28 8","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131614049","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
PLinda 2.0: a transactional/checkpointing approach to fault tolerant Linda PLinda 2.0:一种容错Linda的事务/检查点方法
Proceedings of IEEE 13th Symposium on Reliable Distributed Systems Pub Date : 1994-10-25 DOI: 10.1109/RELDIS.1994.336905
K. Jeong, D. Shasha
{"title":"PLinda 2.0: a transactional/checkpointing approach to fault tolerant Linda","authors":"K. Jeong, D. Shasha","doi":"10.1109/RELDIS.1994.336905","DOIUrl":"https://doi.org/10.1109/RELDIS.1994.336905","url":null,"abstract":"Robust parallel computation in Linda requires both tuple space and processes to be resilient to failure. In this paper, we present PLinda 2.0, set of extensions to Linda to support robust parallel computation on loosely coupled processors communicating over a network. The principal extensions of PLinda 2.0 to Linda are transaction mechanisms for reliable tuple space and process-private logging mechanisms for resilient processes. The transaction mechanisms support two kinds of tuple space: stable tuple space always guaranteed to reflect state as of last committed transaction, and unstable tuple space protected by a transaction-consistent checkpoint. The process-private logging mechanisms are provided as tools for a process checkpointing scheme. These mechanisms allow the customization of checkpointing and recovery operations in each process to achieve low runtime overhead.<<ETX>>","PeriodicalId":373931,"journal":{"name":"Proceedings of IEEE 13th Symposium on Reliable Distributed Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129890140","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}
引用次数: 43
Probabilistic internal clock synchronization 概率内部时钟同步
Proceedings of IEEE 13th Symposium on Reliable Distributed Systems Pub Date : 1994-10-25 DOI: 10.1109/RELDIS.1994.336912
F. Cristian, C. Fetzer
{"title":"Probabilistic internal clock synchronization","authors":"F. Cristian, C. Fetzer","doi":"10.1109/RELDIS.1994.336912","DOIUrl":"https://doi.org/10.1109/RELDIS.1994.336912","url":null,"abstract":"We propose an improved probabilistic method for reading remote clocks in systems subject to unbounded communication delays and use this method to design a fault-tolerant probabilistic internal clock synchronization protocol. This protocol masks clock reading failures and arbitrary failures of processes. Because of probabilistic reading, our protocol achieves better synchronization precisions than those achievable by previously known deterministic algorithms. Another advantage of the proposed protocol is that it uses a linear, instead of quadratic, number of messages, and that message exchanges are staggered in time instead of all happening in narrow synchronization intervals. The drift rate of the synchronized clocks is optimal.<<ETX>>","PeriodicalId":373931,"journal":{"name":"Proceedings of IEEE 13th Symposium on Reliable Distributed Systems","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115141127","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}
引用次数: 65
An environment for importance sampling based on stochastic activity networks 基于随机活动网络的重要抽样环境
Proceedings of IEEE 13th Symposium on Reliable Distributed Systems Pub Date : 1994-10-25 DOI: 10.1109/RELDIS.1994.336908
W. D. Obal, W. Sanders
{"title":"An environment for importance sampling based on stochastic activity networks","authors":"W. D. Obal, W. Sanders","doi":"10.1109/RELDIS.1994.336908","DOIUrl":"https://doi.org/10.1109/RELDIS.1994.336908","url":null,"abstract":"Model-based evaluation of reliable distributed and parallel systems is difficult due to the complexity of these systems and the nature of the dependability measures of interest. The complexity creates problems for analytical model solution techniques, and the fact that reliability and availability measures are based on rare events makes traditional simulation methods inefficient. Importance sampling is a well-known technique for improving the efficiency of rare event simulations. However, finding an importance sampling strategy that works well in general is a difficult problem. The best strategy for importance sampling depends on the characteristics of the system and the dependability measure of interest. This fact motivated the development of an environment for importance sampling that would support the wide variety of model characteristics and interesting measures. The environment is based on stochastic activity networks, and importance sampling strategies are specified using the new concept of the importance sampling governor. The governor supports dynamic importance sampling strategies by allowing the stochastic elements of the model to be redefined based on the evolution of the simulation. The utility of the new environment is demonstrated by evaluating the unreliability of a highly dependable fault-tolerant unit used in the well-known MARS architecture. The model is non-Markovian, with Weibull distributed failure times and uniformly distributed repair times.<<ETX>>","PeriodicalId":373931,"journal":{"name":"Proceedings of IEEE 13th Symposium on Reliable Distributed Systems","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116722345","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}
引用次数: 16
Efficient treatment of failures in RPC systems 有效地处理RPC系统中的故障
Proceedings of IEEE 13th Symposium on Reliable Distributed Systems Pub Date : 1994-10-25 DOI: 10.1109/RELDIS.1994.336898
V. Issarny, Gilles Muller, I. Puaut
{"title":"Efficient treatment of failures in RPC systems","authors":"V. Issarny, Gilles Muller, I. Puaut","doi":"10.1109/RELDIS.1994.336898","DOIUrl":"https://doi.org/10.1109/RELDIS.1994.336898","url":null,"abstract":"This paper addresses extensions to be made to a basic remote procedure call system for the integration of primitive fault tolerance measures. Our main design goal is to not introduce performance penalty for remote procedure calls executing in the absence of failures, and to not impose significant overhead by the treatment of failures. Basically, extensions include a simple algorithm that finds and eliminates orphans, and a mechanism that detects abnormally terminated remote calls. Our solution for orphan detection as based on the extermination approach, its efficiency coming from a minor addition to the system architecture that allows the implementation of high speed stable storage. Performance measures given by the implementation of our reliability mechanisms on top of the Mach 3.0/BSD UX36 operating system show that the mechanisms are responsible for adding only 1% overhead on the operating system's base remote procedure call.<<ETX>>","PeriodicalId":373931,"journal":{"name":"Proceedings of IEEE 13th Symposium on Reliable Distributed Systems","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125042286","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
Transparent load sharing in distributed systems: decentralized design alternatives based on the Condor package 分布式系统中的透明负载共享:基于Condor包的分散设计替代方案
Proceedings of IEEE 13th Symposium on Reliable Distributed Systems Pub Date : 1994-10-25 DOI: 10.1109/RELDIS.1994.336895
J. Hou, K. Shin, T. Tsukada
{"title":"Transparent load sharing in distributed systems: decentralized design alternatives based on the Condor package","authors":"J. Hou, K. Shin, T. Tsukada","doi":"10.1109/RELDIS.1994.336895","DOIUrl":"https://doi.org/10.1109/RELDIS.1994.336895","url":null,"abstract":"In recent years a number of load sharing (LS) mechanisms have been proposed or implemented to fully utilize system resources. We design and implement a decentralized LS mechanism based on the Condor package, and give in this paper a description of our design and implementation approaches. Two important features of the design are the use of region-change broadcasts in the information policy to provide each workstation with timely state information at the minimum communication cost, and the use of preferred list in the location policy to avoid task collisions. With these two features, we remove the central manager workstation in Condor, configure its functionalities into each participating workstation, and thus enhance the capability to tolerate single workstation failure and the reliability of Condor. We also discuss the experiments we conduct on the LS mechanism and the observations we obtained from empirical data.<<ETX>>","PeriodicalId":373931,"journal":{"name":"Proceedings of IEEE 13th Symposium on Reliable Distributed Systems","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128545416","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}
引用次数: 5
Analysis of checkpointing schemes for multiprocessor systems 多处理器系统的检查点方案分析
Proceedings of IEEE 13th Symposium on Reliable Distributed Systems Pub Date : 1994-10-25 DOI: 10.1109/RELDIS.1994.336909
A. Ziv, Jehoshua Bruck
{"title":"Analysis of checkpointing schemes for multiprocessor systems","authors":"A. Ziv, Jehoshua Bruck","doi":"10.1109/RELDIS.1994.336909","DOIUrl":"https://doi.org/10.1109/RELDIS.1994.336909","url":null,"abstract":"Parallel computing systems provide hardware redundancy that helps to achieve low cost fault-tolerance, by duplicating the task into more than a single processor, and comparing the states of the processors at checkpoints. This paper suggests a novel technique, based on a Markov reward model (MRM), for analyzing the performance of checkpointing schemes with task duplication. We show how this technique can be used to derive the average execution time of a task and other important parameters related to the performance of checkpointing schemes. Our analytical results match well the values we obtained using a simulation program. We compare the average task execution time and total work of four checkpointing schemes, and show that generally increasing the number of processors reduces the average execution time, but increases the total work done by the processors. However, in cases where there is a big difference between the time it takes to perform different operations, those results can change.<<ETX>>","PeriodicalId":373931,"journal":{"name":"Proceedings of IEEE 13th Symposium on Reliable Distributed Systems","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125559426","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}
引用次数: 26
Probabilistic validation using worst event driven and importance sampling simulation 使用最坏事件驱动和重要抽样模拟的概率验证
Proceedings of IEEE 13th Symposium on Reliable Distributed Systems Pub Date : 1994-10-25 DOI: 10.1109/RELDIS.1994.336906
N. Bennacer, G. Florin, S. Natkin
{"title":"Probabilistic validation using worst event driven and importance sampling simulation","authors":"N. Bennacer, G. Florin, S. Natkin","doi":"10.1109/RELDIS.1994.336906","DOIUrl":"https://doi.org/10.1109/RELDIS.1994.336906","url":null,"abstract":"Probabilistic validation is an approach for the validation of highly dependable and complex systems. It relies on a partial analysis on a system model and tries to prove that the failed event occurrences has a sufficiently low probability. We define a probabilistic validation method using worst event driven and an importance sampling simulation. The system which must be validated is modeled by a stochastic Petri net. An efficient simulation of the net must be able to sample complex and improbable trajectories which eventually reach critical markings. Two problems have to be solved. The sequence of transition firings which may lead to critical markings must be characterized ad the Petri net level. The second problem is to sample these sequences and to build an accurate estimate of the incorrect behavior probability. We discuss several simulation algorithms in the Markovian and non-Markovian cases. We show the effectiveness of these techniques on the validation of several examples.<<ETX>>","PeriodicalId":373931,"journal":{"name":"Proceedings of IEEE 13th Symposium on Reliable Distributed Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125886643","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
Reducing interprocessor dependence in recoverable distributed shared memory 减少可恢复分布式共享内存中的处理器间依赖
Proceedings of IEEE 13th Symposium on Reliable Distributed Systems Pub Date : 1994-10-25 DOI: 10.1109/RELDIS.1994.336911
B. Janssens, W. Fuchs
{"title":"Reducing interprocessor dependence in recoverable distributed shared memory","authors":"B. Janssens, W. Fuchs","doi":"10.1109/RELDIS.1994.336911","DOIUrl":"https://doi.org/10.1109/RELDIS.1994.336911","url":null,"abstract":"Checkpointing techniques in parallel systems use dependency tracking and/or message logging to ensure that a system rolls back to a consistent state. Traditional dependency tracking in distributed shared memory (DSM) systems is expensive because of high communication frequency. In this paper we show that, if designed correctly, a DSM system only needs to consider dependencies due to the transfer of blocks of data, resulting in reduced dependency tracking overhead and reduced potential for rollback propagation. We develop an ownership timestamp scheme to tolerate the loss of block state information and develop a passive server model of execution where interactions between processors are considered atomic. With our scheme, dependencies are significantly reduced compared to the traditional message-passing model.<<ETX>>","PeriodicalId":373931,"journal":{"name":"Proceedings of IEEE 13th Symposium on Reliable Distributed Systems","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128451914","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}
引用次数: 29
Fault tolerance in a multisensor environment 多传感器环境中的容错
Proceedings of IEEE 13th Symposium on Reliable Distributed Systems Pub Date : 1994-10-25 DOI: 10.1109/RELDIS.1994.336914
D. Jayasimha
{"title":"Fault tolerance in a multisensor environment","authors":"D. Jayasimha","doi":"10.1109/RELDIS.1994.336914","DOIUrl":"https://doi.org/10.1109/RELDIS.1994.336914","url":null,"abstract":"Replicating sensors is desirable not only to tolerate sensor failures but also to increase the expected accuracy of the ensemble of replicated sensors beyond that obtainable with a single one. Such replication is used in a multisensor environment or in a distributed sensor network. We model a continuous valued sensor as an interval of real numbers containing the physical value of interest. Given n sensors of which at most f of them can suffer arbitrary failures, we present an efficient O(n log n) fault tolerant algorithm whose output is reliable when f<n/2. The output of the algorithm could be a single interval or a set of intervals depending on the nature of the multisensor environment. This algorithm can be used not only to detect all the possibly-faulty sensors but to detect all sets (combinations) of possibly-faulty sensors. We derive a number of results pertaining to the possibly-faulty sensors pointed out by the algorithm which help narrow down the search to detect faulty sensors and to bound the number of intervals needed to construct an accurate and reliable \"abstract sensor\".<<ETX>>","PeriodicalId":373931,"journal":{"name":"Proceedings of IEEE 13th Symposium on Reliable Distributed Systems","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129583631","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}
引用次数: 33
下一页 尾页
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学术官方微信
小红书