2011 IEEE 17th Pacific Rim International Symposium on Dependable Computing最新文献_第5页

A Dependability Solution for Homogeneous MPSoCs 同构mpsoc的可靠性解决方案

2011 IEEE 17th Pacific Rim International Symposium on Dependable Computing Pub Date : 2011-12-12 DOI: 10.1109/PRDC.2011.16

Xiao Zhang, H. Kerkhoff

引用次数: 5

RAMpage: Graceful Degradation Management for Memory Errors in Commodity Linux Servers RAMpage:商用Linux服务器中内存错误的优雅降级管理

2011 IEEE 17th Pacific Rim International Symposium on Dependable Computing Pub Date : 2011-12-12 DOI: 10.1109/PRDC.2011.20

Horst Schirmeier, J. Neuhalfen, Ingo Korb, O. Spinczyk, M. Engel

引用次数: 16

Augmenting Functional Broadside Tests for Transition Fault Coverage with Bounded Switching Activity 有界切换活动下过渡故障覆盖率的增强功能宽边测试

2011 IEEE 17th Pacific Rim International Symposium on Dependable Computing Pub Date : 2011-12-12 DOI: 10.1109/PRDC.2011.14

I. Pomeranz

引用次数: 14

Numerical Defect Correction as an Algorithm-Based Fault Tolerance Technique for Iterative Solvers 数值缺陷校正作为一种基于算法的迭代求解容错技术

2011 IEEE 17th Pacific Rim International Symposium on Dependable Computing Pub Date : 2011-07-01 DOI: 10.1109/PRDC.2011.26

Fabian Oboril, M. Tahoori, V. Heuveline, D. Lukarski, Jan-Philipp Weiss

引用次数: 27

A Self-Stabilizing Synchronization Protocol for Arbitrary Digraphs: A Self-Stabilizing Distributed Clock Synchronization Protocol For Arbitrary Digraphs 适用于任意数字图的自稳定同步协议：适用于任意数字图的自稳定分布式时钟同步协议

2011 IEEE 17th Pacific Rim International Symposium on Dependable Computing Pub Date : 2011-02-01 DOI: 10.1109/PRDC.2011.37

M. Malekpour

{"title":"A Self-Stabilizing Synchronization Protocol for Arbitrary Digraphs: A Self-Stabilizing Distributed Clock Synchronization Protocol For Arbitrary Digraphs","authors":"M. Malekpour","doi":"10.1109/PRDC.2011.37","DOIUrl":"https://doi.org/10.1109/PRDC.2011.37","url":null,"abstract":"This paper presents a self-stabilizing distributed clock synchronization protocol in the absence of faults in the system. It is focused on the distributed clock synchronization of an arbitrary, non-partitioned digraph ranging from fully connected to 1-connected networks of nodes while allowing for differences in the network elements. This protocol does not rely on assumptions about the initial state of the system, other than the presence of at least one node, and no central clock or a centrally generated signal, pulse, or message is used. Nodes are anonymous, i.e., they do not have unique identities. There is no theoretical limit on the maximum number of participating nodes. The only constraint on the behavior of the node is that the interactions with other nodes are restricted to defined links and interfaces. This protocol deterministically converges within a time bound that is a linear function of the self-stabilization period. We present an outline of a deductive proof of the correctness of the protocol. A bounded model of the protocol was mechanically verified for a variety of topologies. Results of the mechanical proof of the correctness of the protocol are provided. The model checking results have verified the correctness of the protocol as they apply to the networks with unidirectional and bidirectional links. In addition, the results confirm the claims of determinism and linear convergence. As a result, we conjecture that the protocol solves the general case of this problem. We also present several variations of the protocol and discuss that this synchronization protocol is indeed an emergent system.","PeriodicalId":254760,"journal":{"name":"2011 IEEE 17th Pacific Rim International Symposium on Dependable Computing","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127379955","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