基于缓存层次图模型的缓存验证测试自动生成方法

A. V. Garashchenko, F. Putrya, L. Gagarina, Alena V. Garashchenko, A. Dzhurakulov
{"title":"基于缓存层次图模型的缓存验证测试自动生成方法","authors":"A. V. Garashchenko, F. Putrya, L. Gagarina, Alena V. Garashchenko, A. Dzhurakulov","doi":"10.1109/EICONRUS.2019.8657064","DOIUrl":null,"url":null,"abstract":"In modern heterogeneous System-on-Chip (SoC), the cache hierarchy is one of the most complex and problematic components. Due to a huge number of possible cache hierarchy states, verification of the cache hierarchy requires numerous complex tests, which becomes the main problem for functional and formal verification. The most common solution to this problem is to develop specialized test generators for a single level of cache. However, for the entire cache hierarchy, such generators cover only a few localized subsets of the global state space leaving large gaps between these subsets. A verification test generator was developed based on the graph model to cover the entire state space. The proposed approach revealed several critical errors in verifying the VLIW DSP processor hierarchy cache with the Elcore50 architecture. In the future, it is planned to apply this approach to verify other processor cores.","PeriodicalId":6748,"journal":{"name":"2019 IEEE Conference of Russian Young Researchers in Electrical and Electronic Engineering (EIConRus)","volume":"72 1","pages":"1876-1879"},"PeriodicalIF":0.0000,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Automatic Test Generation Methodology for Verification of a Cache Memory Based on the Graph Model of Cache Hierarchy\",\"authors\":\"A. V. Garashchenko, F. Putrya, L. Gagarina, Alena V. Garashchenko, A. Dzhurakulov\",\"doi\":\"10.1109/EICONRUS.2019.8657064\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In modern heterogeneous System-on-Chip (SoC), the cache hierarchy is one of the most complex and problematic components. Due to a huge number of possible cache hierarchy states, verification of the cache hierarchy requires numerous complex tests, which becomes the main problem for functional and formal verification. The most common solution to this problem is to develop specialized test generators for a single level of cache. However, for the entire cache hierarchy, such generators cover only a few localized subsets of the global state space leaving large gaps between these subsets. A verification test generator was developed based on the graph model to cover the entire state space. The proposed approach revealed several critical errors in verifying the VLIW DSP processor hierarchy cache with the Elcore50 architecture. In the future, it is planned to apply this approach to verify other processor cores.\",\"PeriodicalId\":6748,\"journal\":{\"name\":\"2019 IEEE Conference of Russian Young Researchers in Electrical and Electronic Engineering (EIConRus)\",\"volume\":\"72 1\",\"pages\":\"1876-1879\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 IEEE Conference of Russian Young Researchers in Electrical and Electronic Engineering (EIConRus)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/EICONRUS.2019.8657064\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE Conference of Russian Young Researchers in Electrical and Electronic Engineering (EIConRus)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EICONRUS.2019.8657064","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

在现代异构片上系统(SoC)中,缓存层次结构是最复杂和最有问题的组件之一。由于可能存在大量的缓存层次结构状态,对缓存层次结构的验证需要进行大量复杂的测试,这成为功能验证和形式验证的主要问题。这个问题最常见的解决方案是为单个缓存级别开发专门的测试生成器。然而,对于整个缓存层次结构,这样的生成器只覆盖全局状态空间的几个局部子集,在这些子集之间留下了很大的空白。基于图模型开发了覆盖整个状态空间的验证测试生成器。提出的方法揭示了在使用Elcore50架构验证VLIW DSP处理器层次缓存时的几个关键错误。在未来,计划将这种方法应用于验证其他处理器内核。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Automatic Test Generation Methodology for Verification of a Cache Memory Based on the Graph Model of Cache Hierarchy
In modern heterogeneous System-on-Chip (SoC), the cache hierarchy is one of the most complex and problematic components. Due to a huge number of possible cache hierarchy states, verification of the cache hierarchy requires numerous complex tests, which becomes the main problem for functional and formal verification. The most common solution to this problem is to develop specialized test generators for a single level of cache. However, for the entire cache hierarchy, such generators cover only a few localized subsets of the global state space leaving large gaps between these subsets. A verification test generator was developed based on the graph model to cover the entire state space. The proposed approach revealed several critical errors in verifying the VLIW DSP processor hierarchy cache with the Elcore50 architecture. In the future, it is planned to apply this approach to verify other processor cores.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信