Battling Bad Bits with Checksums in the Loris Page Cache

D. V. Moolenbroek, Raja Appuswamy, A. Tanenbaum
{"title":"Battling Bad Bits with Checksums in the Loris Page Cache","authors":"D. V. Moolenbroek, Raja Appuswamy, A. Tanenbaum","doi":"10.1109/LADC.2013.10","DOIUrl":null,"url":null,"abstract":"In this paper, we aim to improve the reliability of a central part of the operating system storage stack: the page cache. We consider two reliability threats: memory errors, where bits in DRAM are flipped due to cosmic rays, and software bugs, where programming errors may ultimately result in data corruption and crashes. We argue that by making use of checksums, we can significantly reduce the probability that either threat results in any application-visible effects. In particular, we can use checksums to detect memory corruption as well as validate the integrity of the cache's internal state for recovery after a crash. We show that in many cases, we can avoid the overhead of computing checksums especially for these purposes. We implement our ideas in the Loris storage stack. Our analysis and evaluation show that our approach improves the overall reliability of the cache at relatively little added cost.","PeriodicalId":243515,"journal":{"name":"2013 Sixth Latin-American Symposium on Dependable Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 Sixth Latin-American Symposium on Dependable Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LADC.2013.10","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

In this paper, we aim to improve the reliability of a central part of the operating system storage stack: the page cache. We consider two reliability threats: memory errors, where bits in DRAM are flipped due to cosmic rays, and software bugs, where programming errors may ultimately result in data corruption and crashes. We argue that by making use of checksums, we can significantly reduce the probability that either threat results in any application-visible effects. In particular, we can use checksums to detect memory corruption as well as validate the integrity of the cache's internal state for recovery after a crash. We show that in many cases, we can avoid the overhead of computing checksums especially for these purposes. We implement our ideas in the Loris storage stack. Our analysis and evaluation show that our approach improves the overall reliability of the cache at relatively little added cost.
在Loris页面缓存中使用校验和对抗坏位
在本文中,我们的目标是提高操作系统存储堆栈的核心部分:页面缓存的可靠性。我们考虑两种可靠性威胁:存储器错误(由于宇宙射线导致DRAM中的位翻转)和软件错误(编程错误可能最终导致数据损坏和崩溃)。我们认为,通过使用校验和,我们可以显著降低任一威胁导致任何应用程序可见影响的概率。特别是,我们可以使用校验和来检测内存损坏,以及验证缓存内部状态的完整性,以便在崩溃后进行恢复。我们表明,在许多情况下,我们可以避免计算校验和的开销,特别是对于这些目的。我们在Loris存储堆栈中实现我们的想法。我们的分析和评估表明,我们的方法以相对较少的额外成本提高了缓存的整体可靠性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信