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}
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.