2016
DOI: 10.15514/ispras-2016-28(3)-10
|View full text |Cite
|
Sign up to set email alerts
|

Approaches to Stand-alone Verification of Multicore Microprocessor Caches

Abstract: Abstract. The paper presents an overview of approaches used in verifying correctness of multicore microprocessors caches. Common properties of memory subsystem devices and those specific to caches are described. We describe the method to support memory consistency in a system using cache coherence protocol. The approaches for designing a test system, generating valid stimuli and checking the correctness of the device under verification (DUV) are introduced. Adjustments to the approach for supporting generation… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
5
0

Year Published

2019
2019
2020
2020

Publication Types

Select...
3

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(5 citation statements)
references
References 0 publications
0
5
0
Order By: Relevance
“…53-60 56 information helps to refine test scenarios and add new ones. This approach is called coverage driven constrained random verification [11].…”
Section: Definitions and Verification Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…53-60 56 information helps to refine test scenarios and add new ones. This approach is called coverage driven constrained random verification [11].…”
Section: Definitions and Verification Methodsmentioning
confidence: 99%
“…A special module and interface signaling about interrupt overlay monitored in the test environment and then transferred to the reference model. Method when we use hints from a verified device for single correct state identification named "gray box" method [7,11]. The information about overlay type used by reference model to exclude extra interrupts.…”
Section: Print_ok(x) Endmentioning
confidence: 99%
“…We call those devices non-deterministic. There are two methods allowing using behavioral event models for verification of these devices [12]. The first method is dynamic refinement of transaction level model.…”
Section: Standalone Verification Methods Of Memory Subsystemmentioning
confidence: 99%
“…But their formation for the entire address space would require a large amount of computing resources. The paper [3] presents the approach based on constraint-random generation page table entries (PTEs), which we used for IOMMU verification as a part of northbridge of our previous microprocessor. However, the availability of hypervisor and guest translation caches as well as a large number of translation pages required for guest virtual address translation does not allow to use the approach described in [3].…”
Section: Iommu Verification Challengesmentioning
confidence: 99%
“…The paper [3] presents the approach based on constraint-random generation page table entries (PTEs), which we used for IOMMU verification as a part of northbridge of our previous microprocessor. However, the availability of hypervisor and guest translation caches as well as a large number of translation pages required for guest virtual address translation does not allow to use the approach described in [3]. The traditional approach is to generate a static table for a limited set of addresses which is used for verification Translation Lookaside Buffer (TLB) of MMU [4]- [6].…”
Section: Iommu Verification Challengesmentioning
confidence: 99%