2006 12th Pacific Rim International Symposium on Dependable Computing (PRDC'06)最新文献

A Replication Model for Trading Data Integrity against Availability 数据完整性与可用性交易的复制模型

2006 12th Pacific Rim International Symposium on Dependable Computing (PRDC'06) Pub Date : 2006-12-18 DOI: 10.1109/PRDC.2006.12

Johannes Osrael, Lorenz Froihofer, K. M. Göschka

引用次数: 5

Monitoring Database Application Behavior for Intrusion Detection 针对入侵检测的数据库应用行为监控

2006 12th Pacific Rim International Symposium on Dependable Computing (PRDC'06) Pub Date : 2006-12-18 DOI: 10.1109/PRDC.2006.46

J. Fonseca, M. Vieira, H. Madeira

引用次数: 4

On Statistically Estimated Optimistic Delivery in Wide-Area Total Order Protocols 广域总订单协议中统计估计的乐观交货

2006 12th Pacific Rim International Symposium on Dependable Computing (PRDC'06) Pub Date : 2006-12-18 DOI: 10.1109/PRDC.2006.47

J. Mocito, A. Respício, L. Rodrigues

引用次数: 10

The Survivability of the Augmented Logical Ring Topology in WDM Networks WDM网络中增强型逻辑环拓扑的生存性

2006 12th Pacific Rim International Symposium on Dependable Computing (PRDC'06) Pub Date : 2006-12-18 DOI: 10.1109/PRDC.2006.61

Yung-Chiao Chen, C. Sue, S. Kuo

引用次数: 0

Design Trade-Offs and Deadlock Prevention in Transient Fault-Tolerant SMT Processors 瞬态容错SMT处理器的设计权衡与死锁预防

2006 12th Pacific Rim International Symposium on Dependable Computing (PRDC'06) Pub Date : 2006-12-18 DOI: 10.1109/PRDC.2006.25

Xiaobin Li, J. Gaudiot

{"title":"Design Trade-Offs and Deadlock Prevention in Transient Fault-Tolerant SMT Processors","authors":"Xiaobin Li, J. Gaudiot","doi":"10.1109/PRDC.2006.25","DOIUrl":"https://doi.org/10.1109/PRDC.2006.25","url":null,"abstract":"Since the very concept of simultaneous multi-threading (SMT) entails inherent redundancy, some proposals have been made to run two copies of the same thread on top of SMT platforms in order to detect and correct soft errors. This allows, upon detection of an error, for the rolling back of the processor state to a known safe point, and then a retry of the instructions, thereby resulting in a completely error-free execution. This paper focuses on two crucial implementation issues introduced by this concept: (i) the design trade-off between the fault detection coverage versus the design costs; (ii) the possible occurrence of deadlock situations. To achieve the largest possible fault detection coverage, we replicate the instructions fetched in order to generate the redundant thread copies. Further, we apply the SMT thread scheduling at the instruction dispatch stage so as to lower the performance overhead. As a result, when compared to the baseline processor, our simulation results show that by using our two new schemes, the performance overhead can be reduced down to as little as 34% on the average, down from 42%. Finally, in the fault-tolerant execution mode, since the two copied threads are cooperating with one another, deadlock situations could be quite common. We thus present a detailed deadlock analysis and then conclude that allocating some entries of ROB, LQ, and SQ for the trailing thread is sufficient to prevent such deadlocks","PeriodicalId":314915,"journal":{"name":"2006 12th Pacific Rim International Symposium on Dependable Computing (PRDC'06)","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114708014","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}

引用次数: 0

Towards Adaptive Secure Group Communication: Bridging the Gap between Formal Specification and Network Simulation 迈向自适应安全组通信:弥合形式规范与网络仿真之间的差距

2006 12th Pacific Rim International Symposium on Dependable Computing (PRDC'06) Pub Date : 2006-12-18 DOI: 10.1109/PRDC.2006.62

Sebastian Gutierrez-Nolasco, N. Venkatasubramanian, Mark-Oliver Stehr, C. Talcott

引用次数: 2

A Framework for Inheritance Testing from VDM++ Specifications 基于VDM++规范的继承测试框架

2006 12th Pacific Rim International Symposium on Dependable Computing (PRDC'06) Pub Date : 2006-12-18 DOI: 10.1109/PRDC.2006.7

A. Nadeem, Michael R. Lyu

引用次数: 5

Synchronous Set Agreement: a Concise Guided Tour (including a new algorithm and a list of open problems) 同步集协议:一个简明的导览(包括一个新算法和一个开放问题列表)

2006 12th Pacific Rim International Symposium on Dependable Computing (PRDC'06) Pub Date : 2006-12-18 DOI: 10.1109/PRDC.2006.59

M. Raynal, Corentin Travers

{"title":"Synchronous Set Agreement: a Concise Guided Tour (including a new algorithm and a list of open problems)","authors":"M. Raynal, Corentin Travers","doi":"10.1109/PRDC.2006.59","DOIUrl":"https://doi.org/10.1109/PRDC.2006.59","url":null,"abstract":"The k-set agreement problem is a paradigm of coordination problems encountered in distributed computing. The parameter k defines the coordination degree we are interested in. (The case k=1 corresponds to the well-known uniform consensus problem.) More precisely, the k-set agreement problem considers a system made up of n processes where each process proposes a value. It requires that each non-faulty process decides a value such that a decided value is a proposed value, and no more than k different values are decided. This paper visits the k-set agreement problem in synchronous systems where up to t processes can experience failures. Three failure models are explored: the crash failure model, the send omission failure model, and the general omission failure model. Lower bounds and protocols are presented for each model. Open problems for the general omission failure model are stated. This paper can be seen as a short tutorial whose aim is to make the reader familiar with the k-set agreement problem in synchrony models with increasing fault severity. An important concern of the paper is simplicity. In addition to its survey flavor, several results and protocols that are presented are new","PeriodicalId":314915,"journal":{"name":"2006 12th Pacific Rim International Symposium on Dependable Computing (PRDC'06)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130825013","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

Fault-Tolerant Partitioning Scheduling Algorithms in Real-Time Multiprocessor Systems 实时多处理器系统中的容错分区调度算法

2006 12th Pacific Rim International Symposium on Dependable Computing (PRDC'06) Pub Date : 2006-12-18 DOI: 10.1109/PRDC.2006.34

H. Beitollahi, Geert Deconinck

{"title":"Fault-Tolerant Partitioning Scheduling Algorithms in Real-Time Multiprocessor Systems","authors":"H. Beitollahi, Geert Deconinck","doi":"10.1109/PRDC.2006.34","DOIUrl":"https://doi.org/10.1109/PRDC.2006.34","url":null,"abstract":"This paper presents the performance analysis of several well-known partitioning scheduling algorithms in real-time and fault-tolerant multiprocessor systems. Both static and dynamic scheduling algorithms are analyzed. Partitioning scheduling algorithms, which are studied, are heuristic algorithms that are formed by combining any of the bin-packing algorithms with any of the schedulability conditions for the rate-monotonic (RM) and earliest-deadline-first (EDF) policies. A tool is developed which enables to experimentally evaluate the performance of the algorithms from the graph of tasks. The results show that among several partitioning algorithms evaluated, the RM-small-task (RMST) algorithm is the best static algorithm and the EDF-best-fit (EDF-BF) is the best dynamic algorithm, for non fault-tolerant systems. For fault-tolerant systems which require about 49% more processors, the results show that the RM-first-fit decreasing utilization (RM-FFDU) is the best static algorithm and the EDF-BF is the best dynamic algorithm. To decrease the number of processors in fault-tolerant systems, the RMST is modified. The results show that the modified RMST decreases the number of required processors between 7% and 78% in comparison with the original RMST, the RM-FFDU and other well-known static partitioning scheduling algorithms","PeriodicalId":314915,"journal":{"name":"2006 12th Pacific Rim International Symposium on Dependable Computing (PRDC'06)","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116980040","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}

引用次数: 22

End-to-end consensus using end-to-end channels 使用端到端通道的端到端共识

2006 12th Pacific Rim International Symposium on Dependable Computing (PRDC'06) Pub Date : 2006-12-18 DOI: 10.1109/PRDC.2006.32

M. Wiesmann, X. Défago

引用次数: 2