Fault tolerance analysis of distributed reconfigurable systems using SAT-based techniques

被引:0
|
作者
Feldmann, R [1 ]
Haubelt, C
Monien, B
Teich, J
机构
[1] Univ Gesamthsch Paderborn, AG Monien, Fac CS EE & Math, Paderborn, Germany
[2] Univ Erlangen Nurnberg, Dept Comp Sci 12, Hardware Software Co Design, Erlangen, Germany
关键词
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
The ability to migrate tasks from one reconfigurable node to another improves the fault tolerance of distributed reconfigurable systems. The degree of fault tolerance is inherent to the system and can be optimized during system design. Therefore, an efficient way of calculating the degree of fault tolerance is needed. This paper presents an approach based on satisfiability testing (SAT) which regards the question: How many resources may fail in a distributed reconfigurable system without losing any functionality? We will show by experiment that our new approach can easily be applied to systems of reasonable size as we will find in the future in the field of body area networks and ambient intelligence.
引用
收藏
页码:478 / 487
页数:10
相关论文
共 50 条
  • [31] A Highly Fault-Efficient SAT-Based ATPG Flow
    Eggersgluess, Stephan
    Drechsler, Rolf
    IEEE DESIGN & TEST OF COMPUTERS, 2012, 29 (04): : 63 - 70
  • [32] SAT-Based Fault Coverage Evaluation in the Presence of Unknown Values
    Kochte, Michael A.
    Wunderlich, Hans-Joachim
    2011 DESIGN, AUTOMATION & TEST IN EUROPE (DATE), 2011, : 1303 - 1308
  • [33] A Distributed SAT-Based Framework for Closed Frequent Itemset Mining
    Martin-Prin, Julien
    Dlala, Imen Ouled
    Travers, Nicolas
    Jabbour, Said
    ADVANCED DATA MINING AND APPLICATIONS, ADMA 2022, PT II, 2022, 13726 : 419 - 433
  • [34] Analyzing pathways using SAT-Based approaches
    Tiwari, Ashish
    Talcott, Carolyn
    Knapp, Merrill
    Lincoln, Patrick
    Laderoute, Keith
    ALGEBRAIC BIOLOGY, PROCEEDINGS, 2007, 4545 : 155 - +
  • [35] Dynamic abstraction using SAT-based BMC
    Zhang, L
    Prasad, MR
    Hsiao, MS
    Sidle, T
    42ND DESIGN AUTOMATION CONFERENCE, PROCEEDINGS 2005, 2005, : 754 - 757
  • [36] Improved SAT-based bounded reachability analysis
    Ganai, MK
    Aziz, A
    ASP-DAC/VLSI DESIGN 2002: 7TH ASIA AND SOUTH PACIFIC DESIGN AUTOMATION CONFERENCE AND 15TH INTERNATIONAL CONFERENCE ON VLSI DESIGN, PROCEEDINGS, 2002, : 729 - 734
  • [37] Efficient Decision Ordering Techniques for SAT-based Test Generation
    Chen, Mingsong
    Qin, Xiaoke
    Mishra, Prabhat
    2010 DESIGN, AUTOMATION & TEST IN EUROPE (DATE 2010), 2010, : 490 - 495
  • [38] SAT-based termination analysis using monotonicity constraints over the integers
    Codish, Michael
    Gonopolskiy, Igor
    Ben-Amram, Amir M.
    Fuhs, Carsten
    Giesl, Juergen
    THEORY AND PRACTICE OF LOGIC PROGRAMMING, 2011, 11 : 503 - 520
  • [39] SAT-Based Speedpath Debugging Using Waveforms
    Dehbashi, Mehdi
    Fey, Goerschwin
    2014 19TH IEEE EUROPEAN TEST SYMPOSIUM (ETS 2014), 2014,
  • [40] SAT-Based Automated Completion for Reachability Analysis
    Boichut, Yohan
    Hugot, Vincent
    Boiret, Adrien
    IMPLEMENTATION AND APPLICATION OF AUTOMATA, CIAA 2024, 2024, 15015 : 79 - 93