Detecting Silent Data Corruptions in Aerospace-Based Computing Using Program Invariants

被引:5
|
作者
Ma, Junchi [1 ,2 ]
Yu, Dengyun [3 ]
Wang, Yun [1 ,2 ]
Cai, Zhenbo [3 ]
Zhang, Qingxiang [3 ]
Hu, Cheng [1 ,2 ]
机构
[1] Southeast Univ, Sch Comp Sci & Engn, Nanjing 211189, Jiangsu, Peoples R China
[2] Minist Educ, Key Lab Comp Network & Informat Integrat, Nanjing 211189, Jiangsu, Peoples R China
[3] Beijing Inst Spacecraft Syst Engn, Beijing 100094, Peoples R China
关键词
ERROR-DETECTION;
D O I
10.1155/2016/8213638
中图分类号
V [航空、航天];
学科分类号
08 ; 0825 ;
摘要
Soft error caused by single event upset has been a severe challenge to aerospace-based computing. Silent data corruption (SDC) is one of the results incurred by soft error. SDC occurs when a program generates erroneous output with no indications. SDC is the most insidious type of results and very difficult to detect. To address this problem, we design and implement an invariant-based system called Radish. Invariants describe certain properties of a program; for example, the value of a variable equals a constant. Radish first extracts invariants at key program points and converts invariants into assertions. It then hardens the program by inserting the assertions into the source code. When a soft error occurs, assertions will be found to be false at run time and warn the users of soft error. To increase the coverage of SDC, we further propose an extension of Radish, named Radish D, which applies software-based instruction duplication mechanism to protect the uncovered code sections. Experiments using architectural fault injections show that Radish achieves high SDC coverage with very low overhead. Furthermore, Radish D provides higher SDC coverage than that of either Radish or pure instruction duplication.
引用
收藏
页数:10
相关论文
共 50 条
  • [21] Detecting tourism destinations using scalable geospatial analysis based on cloud computing platform
    Zhou, Xiaolu
    Xu, Chen
    Kimmons, Brandon
    COMPUTERS ENVIRONMENT AND URBAN SYSTEMS, 2015, 54 : 144 - 153
  • [22] Detecting TV Program Highlight Scenes Using Twitter Data Classified by Twitter User Behavior
    Hayama, Tessai
    RECENT ADVANCES AND FUTURE PROSPECTS IN KNOWLEDGE, INFORMATION AND CREATIVITY SUPPORT SYSTEMS, 2018, 685 : 1 - 13
  • [23] OUTLIER - A BASIC PROGRAM FOR DETECTING OUTLYING MEMBERS OF MULTIVARIATE CLUSTERS BASED ON PRESENCE ABSENCE DATA
    SNEATH, PHA
    LANGHAM, CD
    COMPUTERS & GEOSCIENCES, 1989, 15 (06) : 939 - 964
  • [24] Using Data Mining Techniques for Detecting Dependencies in the Outcoming Data of a Web-Based System
    Rak, Tomasz
    Zyla, Rafal
    APPLIED SCIENCES-BASEL, 2022, 12 (12):
  • [25] A Study on Detecting and Resolving major issues in Wireless Sensor Network by using Data Mining and Soft Computing Techniques
    Sunitha, R.
    Chandrika, J.
    FIRST INTERNATIONAL CONFERENCE ON EMERGING TRENDS IN ENGINEERING, TECHNOLOGY AND SCIENCE - ICETETS 2016, 2016,
  • [26] BOTTLENECK: A computer program for detecting recent reductions in the effective population size using allele frequency data
    Piry, S
    Luikart, G
    Cornuet, JM
    JOURNAL OF HEREDITY, 1999, 90 (04) : 502 - 503
  • [27] Detecting Anomaly Using the Scene Modeling Based on Time Delayed Statistical Data
    Chen, Lixin
    Guo, Huiwen
    Wang, Min
    Chen, Yen-Lun
    Wu, Xinyu
    Feng, Wei
    2015 IEEE INTERNATIONAL CONFERENCE ON INFORMATION AND AUTOMATION, 2015, : 871 - 876
  • [28] DETECTING AND PREDICTING INFLUENZA EPIDEMICS IN JAPAN USING INTERNET-BASED DATA
    Inoue, Masashi
    Hasegawa, Shinsaku
    Kakehashi, Masayuki
    PROCEEDINGS OF THE INTERNATIONAL CONFERENCES ON ICT, SOCIETY AND HUMAN BEINGS 2014, WEB BASED COMMUNITIES AND SOCIAL MEDIA 2014, E-COMMERCE 2014, INFORMATION SYSTEMS POST-IMPLEMENTATION AND CHANGE MANAGEMENT 2014 AND E-HEALTH 2014, 2014, : 414 - 416
  • [29] Data sharing using proxy re-encryption based on DNA computing
    Ahmed Elhadad
    Soft Computing, 2020, 24 : 2101 - 2108
  • [30] Data sharing using proxy re-encryption based on DNA computing
    Elhadad, Ahmed
    SOFT COMPUTING, 2020, 24 (03) : 2101 - 2108