KLL草图可靠性评估与容错设计

IF 5.1 2区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS
Zhen Gao;Jinhua Zhu;Pedro Reviriego
{"title":"KLL草图可靠性评估与容错设计","authors":"Zhen Gao;Jinhua Zhu;Pedro Reviriego","doi":"10.1109/TETC.2023.3324331","DOIUrl":null,"url":null,"abstract":"Quantile estimation is a fundamental task in Big Data analysis. In order to achieve high-speed estimation with low memory consumption, especially for streaming Big Data processing, data sketches which provide approximate estimates at low overhead are commonly used, and the Karnin-Lang-Liberty (KLL) sketch is one of the most popular options. However, soft errors in KLL memory may significantly degrade estimation performance. In this article, the influence of soft errors on the KLL sketch is considered for the first time. First, the reliability of KLL to soft errors is studied through theoretical analysis and fault injection experiments. The evaluation results show that the errors in the KLL construction phase may cause a large deviation in the estimated value. Then, two protection schemes are proposed based on a single parity check (SPC) and on the incremental property (IP) of the KLL memory. Further evaluation shows that the proposed schemes can significantly improve the reliability of KLL, and even remove the effect SEUs on the highest bits. In particular, the SPC scheme that requires additional memory, provides better protection for middle bit positions than the IP scheme which does not introduce any memory overhead.","PeriodicalId":13156,"journal":{"name":"IEEE Transactions on Emerging Topics in Computing","volume":"12 4","pages":"1002-1013"},"PeriodicalIF":5.1000,"publicationDate":"2023-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Reliability Evaluation and Fault Tolerant Design for KLL Sketches\",\"authors\":\"Zhen Gao;Jinhua Zhu;Pedro Reviriego\",\"doi\":\"10.1109/TETC.2023.3324331\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Quantile estimation is a fundamental task in Big Data analysis. In order to achieve high-speed estimation with low memory consumption, especially for streaming Big Data processing, data sketches which provide approximate estimates at low overhead are commonly used, and the Karnin-Lang-Liberty (KLL) sketch is one of the most popular options. However, soft errors in KLL memory may significantly degrade estimation performance. In this article, the influence of soft errors on the KLL sketch is considered for the first time. First, the reliability of KLL to soft errors is studied through theoretical analysis and fault injection experiments. The evaluation results show that the errors in the KLL construction phase may cause a large deviation in the estimated value. Then, two protection schemes are proposed based on a single parity check (SPC) and on the incremental property (IP) of the KLL memory. Further evaluation shows that the proposed schemes can significantly improve the reliability of KLL, and even remove the effect SEUs on the highest bits. In particular, the SPC scheme that requires additional memory, provides better protection for middle bit positions than the IP scheme which does not introduce any memory overhead.\",\"PeriodicalId\":13156,\"journal\":{\"name\":\"IEEE Transactions on Emerging Topics in Computing\",\"volume\":\"12 4\",\"pages\":\"1002-1013\"},\"PeriodicalIF\":5.1000,\"publicationDate\":\"2023-10-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Transactions on Emerging Topics in Computing\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10299608/\",\"RegionNum\":2,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Emerging Topics in Computing","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10299608/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

摘要

分位数估计是大数据分析中的一项基本任务。为了以低内存消耗实现高速估计,特别是对于流式大数据处理,通常使用以低开销提供近似估计的数据草图,而Karnin-Lang-Liberty (KLL)草图是最流行的选择之一。然而,KLL内存中的软错误可能会显著降低估计性能。本文首次考虑了软误差对KLL草图的影响。首先,通过理论分析和故障注入实验研究了KLL对软误差的可靠性。评估结果表明,KLL建设阶段的误差可能会导致估计值出现较大偏差。然后,提出了基于单奇偶校验(SPC)和基于KLL存储器的增量特性(IP)的两种保护方案。进一步的评估表明,所提出的方案可以显著提高KLL的可靠性,甚至可以消除seu对最高位的影响。特别是,SPC方案需要额外的内存,为中间位提供了比IP方案更好的保护,IP方案不引入任何内存开销。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Reliability Evaluation and Fault Tolerant Design for KLL Sketches
Quantile estimation is a fundamental task in Big Data analysis. In order to achieve high-speed estimation with low memory consumption, especially for streaming Big Data processing, data sketches which provide approximate estimates at low overhead are commonly used, and the Karnin-Lang-Liberty (KLL) sketch is one of the most popular options. However, soft errors in KLL memory may significantly degrade estimation performance. In this article, the influence of soft errors on the KLL sketch is considered for the first time. First, the reliability of KLL to soft errors is studied through theoretical analysis and fault injection experiments. The evaluation results show that the errors in the KLL construction phase may cause a large deviation in the estimated value. Then, two protection schemes are proposed based on a single parity check (SPC) and on the incremental property (IP) of the KLL memory. Further evaluation shows that the proposed schemes can significantly improve the reliability of KLL, and even remove the effect SEUs on the highest bits. In particular, the SPC scheme that requires additional memory, provides better protection for middle bit positions than the IP scheme which does not introduce any memory overhead.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
IEEE Transactions on Emerging Topics in Computing
IEEE Transactions on Emerging Topics in Computing Computer Science-Computer Science (miscellaneous)
CiteScore
12.10
自引率
5.10%
发文量
113
期刊介绍: IEEE Transactions on Emerging Topics in Computing publishes papers on emerging aspects of computer science, computing technology, and computing applications not currently covered by other IEEE Computer Society Transactions. Some examples of emerging topics in computing include: IT for Green, Synthetic and organic computing structures and systems, Advanced analytics, Social/occupational computing, Location-based/client computer systems, Morphic computer design, Electronic game systems, & Health-care IT.
×
引用
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学术官方微信