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

Proceedings of IEEE International Computer Performance and Dependability Symposium最新文献

筛选
英文 中文
DEPEND: a simulation environment for system dependability modeling and evaluation DEPEND:用于系统可靠性建模和评估的仿真环境
Proceedings of IEEE International Computer Performance and Dependability Symposium Pub Date : 1996-09-04 DOI: 10.1109/IPDS.1996.540198
G. Ries, Z. Kalbarczyk, T. Kraljević, M. Hsueh, Ravishankar K. Iyer
{"title":"DEPEND: a simulation environment for system dependability modeling and evaluation","authors":"G. Ries, Z. Kalbarczyk, T. Kraljević, M. Hsueh, Ravishankar K. Iyer","doi":"10.1109/IPDS.1996.540198","DOIUrl":"https://doi.org/10.1109/IPDS.1996.540198","url":null,"abstract":"DEPEND is an evolving simulation-based environment for the evaluation of designs from functional and dependability viewpoints. DEPEND supports the VHDL hardware descriptive language as well as the C++ programming language. In addition, DEPEND provides a graphical modeling facility to allow interactive model construction. Designs under evaluation can be functional or structural descriptions of the designs. The Task and Environment Manager provides an easy-access window-based manual page and a tool-kit to allow users to create, modify, and simulate models without leaving the DEPEND environment. At the core of DEPEND are simulation engines supported by a fault injector, a set of fault dictionaries, and component libraries. The component libraries contain model building blocks with detailed functional descriptions and characteristics; the fault dictionaries embody possible fault effects of given fault types, devices, and circuits; and the fault injector provides mechanisms to inject faults.","PeriodicalId":345982,"journal":{"name":"Proceedings of IEEE International Computer Performance and Dependability Symposium","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115318004","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
Architecture and safety requirements of the ACC railway interlocking system ACC铁路联锁系统的结构与安全要求
Proceedings of IEEE International Computer Performance and Dependability Symposium Pub Date : 1996-09-04 DOI: 10.1109/IPDS.1996.540195
A. Amendola, L. Impagliazzo, P. Marmo, G. Mongardi, G. Sartore, A. Trasporti
{"title":"Architecture and safety requirements of the ACC railway interlocking system","authors":"A. Amendola, L. Impagliazzo, P. Marmo, G. Mongardi, G. Sartore, A. Trasporti","doi":"10.1109/IPDS.1996.540195","DOIUrl":"https://doi.org/10.1109/IPDS.1996.540195","url":null,"abstract":"The paper summarizes the design, implementation and validation of the Computer Based Interlocking (ACC) designed by Ansaldo Trasporti under the supervision of the Italian Railways. Particularly, details are provided on the methodology that has been adopted to set the safety requirements and to give preliminary safety demonstrations. During the development of the ACC design, new drafts of European Standards have been circulated on the design and validation of railway signalling systems. Safety assessment activities compliant with the new European Standards have been started and integrated within the ACC safety process. The failure models presented in this paper have demonstrated that the ACC design requirements assure the system compliance with the required safety integrity levels. They also have allowed for the identification of the parameters to be measured by fault injection tests in an exhaustive experimental evaluation environment, which will be developed in the subsequent phases of the validation process.","PeriodicalId":345982,"journal":{"name":"Proceedings of IEEE International Computer Performance and Dependability Symposium","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116893129","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}
引用次数: 10
QNAUT: approximately analyzing networks of PH|PH|1|K queues QNAUT:近似分析PH|PH|1|K队列网络
Proceedings of IEEE International Computer Performance and Dependability Symposium Pub Date : 1996-09-04 DOI: 10.1109/IPDS.1996.540201
B. Haverkort
{"title":"QNAUT: approximately analyzing networks of PH|PH|1|K queues","authors":"B. Haverkort","doi":"10.1109/IPDS.1996.540201","DOIUrl":"https://doi.org/10.1109/IPDS.1996.540201","url":null,"abstract":"With QNAUT we can perform the (approximate) analysis of possibly large, open networks of PH|PH|1 and PH|PH|1|K queues. Since up till now there are no exact means available to study such queueing networks (QNs), the approach supported by QNAUT is currently the best alternative. Starting point of our approach is the analysis of large open QNs as proposed by W. Whitt (known as QNA) in which large QNs are decomposed into individual GI|G|1 queues, characterized by the first and second moments of the service and interarrival time distributions. In order to come to this decomposition, the first- and second-order traffic (flows) equations need to be solved. The first-order equations are well-known and also normally solved when addressing Jackson networks, however, the second-order equations require the investigation of the joint effect of interarrival time variability, queue utilization and service time variability. Once solved, the latter equations provide the second moments of the job streams between queues. On the basis of these results, individual nodes can then be analyzed using the Kramer and Langenbach-Belz approximation for GI|G|1 queues.","PeriodicalId":345982,"journal":{"name":"Proceedings of IEEE International Computer Performance and Dependability Symposium","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114301368","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
Optimal routing for distributed computing systems with data replication 具有数据复制的分布式计算系统的最佳路由
Proceedings of IEEE International Computer Performance and Dependability Symposium Pub Date : 1996-09-04 DOI: 10.1109/IPDS.1996.540197
P. Chang, D. Chen
{"title":"Optimal routing for distributed computing systems with data replication","authors":"P. Chang, D. Chen","doi":"10.1109/IPDS.1996.540197","DOIUrl":"https://doi.org/10.1109/IPDS.1996.540197","url":null,"abstract":"In a Distributed Computing System (DCS), data files are often replicated several copies and stored on different computers to improve reliability and availability. The particular program and the data files required for its execution may thus be placed on different nodes. Successfully executing the program, however, often requires the access of data files from remote machines. Thus, the program execution time is affected by the constraint of communication capacity. Optimal routing thus becomes an important research goal. If data are not replicated, the problem of optimal routing is essentially a multi-commodity flow problem and can be solved by linear programming technique. When the data are replicated, the program can read the data from any replicas. Reads from replicas on different nodes will results in different transmission time. An exhaustive approach could of course find the optimal solution. However, this approach has a high computation price. In this paper, we propose a method that can effectively decide the optimal traffic routing. Examples are provided to demonstrate the applicability of the proposed algorithm. Results obtained from the proposed algorithm are encouraging.","PeriodicalId":345982,"journal":{"name":"Proceedings of IEEE International Computer Performance and Dependability Symposium","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121908925","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
Performance and availability evaluation of NUMA architectures NUMA架构的性能和可用性评估
Proceedings of IEEE International Computer Performance and Dependability Symposium Pub Date : 1996-09-04 DOI: 10.1109/IPDS.1996.540228
R. Geist, J. Westall
{"title":"Performance and availability evaluation of NUMA architectures","authors":"R. Geist, J. Westall","doi":"10.1109/IPDS.1996.540228","DOIUrl":"https://doi.org/10.1109/IPDS.1996.540228","url":null,"abstract":"A new approximation technique is proposed for obtaining analytic estimates of the performance of computing systems exhibiting non-uniform memory access (NUMA) times, where components are subject to failure and repair. The technique uses a multi-chain mean-value analysis together with a service time scaling factor derived to correct for the non-exponential (deterministic) service times found in most service units of a NUMA architecture. The new technique is seen to provide excellent agreement with simulation results in predicting both mean network cycle time and contention at the deterministic system devices. Availability estimation is based on a machine-repair model with deterministic repair (replacement). In this case, exact analysis is available using techniques from Markov regenerative stochastic Petri nets.","PeriodicalId":345982,"journal":{"name":"Proceedings of IEEE International Computer Performance and Dependability Symposium","volume":"134 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134346955","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
Design and simulation of a reliable token-ring protocol for realtime communications 用于实时通信的可靠令牌环协议的设计与仿真
Proceedings of IEEE International Computer Performance and Dependability Symposium Pub Date : 1996-09-04 DOI: 10.1109/IPDS.1996.540214
J. Cao, R. Steele, L. Yao, W. Jia
{"title":"Design and simulation of a reliable token-ring protocol for realtime communications","authors":"J. Cao, R. Steele, L. Yao, W. Jia","doi":"10.1109/IPDS.1996.540214","DOIUrl":"https://doi.org/10.1109/IPDS.1996.540214","url":null,"abstract":"The key to the successful use of computer networks to support realtime communications is an adequate set of network communication protocols that ensure not only timely but also reliable message transmission. Traditional fault tolerance techniques may become invalid in a realtime environment as the latency introduced by those error recovery mechanisms may become unacceptably high. This paper presents the design and simulation of a reliable, realtime token ring protocol. The data link layer design of the protocol provides efficient error detection and recovery, reducing the total message loss rate. The performance of the protocol is evaluated through analysis and simulation.","PeriodicalId":345982,"journal":{"name":"Proceedings of IEEE International Computer Performance and Dependability Symposium","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114836557","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
First passage times in fluid models with an application to two priority fluid systems 流体模型的首次通过时间，并应用于两个优先流体系统
Proceedings of IEEE International Computer Performance and Dependability Symposium Pub Date : 1996-09-04 DOI: 10.1109/IPDS.1996.540218
A. Narayanan, Vidyadhar G. Kulkarni
{"title":"First passage times in fluid models with an application to two priority fluid systems","authors":"A. Narayanan, Vidyadhar G. Kulkarni","doi":"10.1109/IPDS.1996.540218","DOIUrl":"https://doi.org/10.1109/IPDS.1996.540218","url":null,"abstract":"In this paper we analyze the first passage time in a fluid flow model where the input and output rates are controlled by a finite state Continuous Time Markov Chain (CTMC). We derive explicit expressions for the Laplace Transform of the joint distribution of the first time the buffer becomes empty and the state of the CTMC at that time. We discuss both infinite and finite buffer cases. We illustrate the results with the case of a fluid model with an on-off source. We apply these results to a fluid model where the input consists of two types of fluid and a single server removes the fluid. The server gives complete priority to the fluid of type 1 over that of type 2. In this case the down time of the server for priority 2 fluid is the same as the busy period of the fluid of priority 1. We derive the steady state marginal distributions of the buffer-content process for fluids of type 1 and 2. We present numerical results and their interpretations.","PeriodicalId":345982,"journal":{"name":"Proceedings of IEEE International Computer Performance and Dependability Symposium","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126997864","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}
引用次数: 38
Using time to improve the performance of coordinated checkpointing 利用时间改进协调检查点的性能
Proceedings of IEEE International Computer Performance and Dependability Symposium Pub Date : 1996-09-04 DOI: 10.1109/IPDS.1996.540229
N. Neves, W. Fuchs
{"title":"Using time to improve the performance of coordinated checkpointing","authors":"N. Neves, W. Fuchs","doi":"10.1109/IPDS.1996.540229","DOIUrl":"https://doi.org/10.1109/IPDS.1996.540229","url":null,"abstract":"This paper describes and evaluates a coordinated checkpoint protocol that uses time to eliminate several performance overheads that are present in traditional protocols. The time-based protocol does not have to exchange coordination messages, does not need to add information to the processes' messages, and only accesses stable storage when checkpoints are saved. This protocol uses a simple initialization procedure to set checkpoint timers at the different processes. After the initialization, each process saves its state independently from the other processes. By disallowing processes from sending messages during an interval before the checkpoint time, the protocol prevents in-transit messages from occurring. Two coordinated checkpoint protocols were implemented on a CM5, and their performance was compared using several applications. Results showed that the time-based protocol outperforms the two-phase protocol in all applications.","PeriodicalId":345982,"journal":{"name":"Proceedings of IEEE International Computer Performance and Dependability Symposium","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132555844","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}
引用次数: 39
SURF-2-a tool for modeling and evaluation of dependability measures surf -2-用于建模和评估可靠性措施的工具
Proceedings of IEEE International Computer Performance and Dependability Symposium Pub Date : 1996-09-04 DOI: 10.1109/IPDS.1996.540205
K. Kanoun, L. Blain
{"title":"SURF-2-a tool for modeling and evaluation of dependability measures","authors":"K. Kanoun, L. Blain","doi":"10.1109/IPDS.1996.540205","DOIUrl":"https://doi.org/10.1109/IPDS.1996.540205","url":null,"abstract":"SURF-2 is a software tool for evaluating system dependability. It is especially designed for an evaluation based system design approach in which multiple design solutions need to be compared from the dependability viewpoint. SURF-2 allows the user to describe the model behavior using generalized stochastic Petri nets (GSPNs) whose reachability graph is then interpreted as a Markov chain, or enter directly a Markov chain. In the case of GSPNs, it enables the models to be verified in terms of their structural properties. The tool supports the evaluation of different measures of dependability, including pointwise measures, asymptotic measures, mean sojourn times and, by superposing a reward structure onto the behavior model, reward measures such as expected performance or cost. These measures are obtained by processing the Markov chain. SURF-2 can be viewed as a toolbox where each tool can operate independently on objects gathered in a database managed by a supervisory task.","PeriodicalId":345982,"journal":{"name":"Proceedings of IEEE International Computer Performance and Dependability Symposium","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132116478","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
Reliability of traffic management applications based on digital short-range communications 基于数字短距离通信的交通管理应用的可靠性
Proceedings of IEEE International Computer Performance and Dependability Symposium Pub Date : 1996-09-04 DOI: 10.1109/IPDS.1996.540215
Christian Wietfeld
{"title":"Reliability of traffic management applications based on digital short-range communications","authors":"Christian Wietfeld","doi":"10.1109/IPDS.1996.540215","DOIUrl":"https://doi.org/10.1109/IPDS.1996.540215","url":null,"abstract":"In this paper, the performance of short-range vehicle-roadside communication systems, which support RTTT (Road Traffic & Transport Telematics) services, is analysed. After introducing general communication requirements of RTTT applications in a road traffic environment, a short overview about the current status of the Dedicated Short-Range Communications DSRC prENV draft standards developed within CEN TC 278/ISO TC 204 will be given. Analytical techniques (Markov Chain modelling) will be introduced to demonstrate their capability to support the optimal choice of selected system parameters. In order to analyse the overall reliability of the communication system, the concept of the performance evaluation of vehicle-roadside systems based on integrated models of mobility, channel characteristics and communication protocols will be introduced. Simulation results based on an implementation of a high priority interactive service (Automatic Fee Collection) combined with an additional broadcast-oriented service (Dynamic Route Guidance) are analysed in detail (transaction failure rate, used length of the communication zone, interference between different applications, etc.). Optimal choices of system parameters such as antenna configurations are presented. The results show, that DSRC systems are able to provide multiple RTTT services using the same DSRC link to make best use of the available system capacity and to enhance the benefits for potential users.","PeriodicalId":345982,"journal":{"name":"Proceedings of IEEE International Computer Performance and Dependability Symposium","volume":"348 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131397234","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
下一页 尾页
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学术官方微信
小红书