2010 43rd Annual IEEE/ACM International Symposium on Microarchitecture 2010
DOI: 10.1109/micro.2010.11
|View full text |Cite
|
Sign up to set email alerts
|

Fractal Coherence: Scalably Verifiable Cache Coherence

Abstract: Abstract

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
48
0

Year Published

2010
2010
2020
2020

Publication Types

Select...
4
3

Relationship

1
6

Authors

Journals

citations
Cited by 51 publications
(48 citation statements)
references
References 33 publications
0
48
0
Order By: Relevance
“…To facilitate verification of cache coherence, the nonscalable verification step from Section 2.1, we leverage Fractal Coherence [10]. Fractal Coherence is a design methodology for cache coherence protocols that can be formally verified using existing, automated, easy-to-use formal verification tools.…”
Section: Fractal Coherencementioning
confidence: 99%
See 3 more Smart Citations
“…To facilitate verification of cache coherence, the nonscalable verification step from Section 2.1, we leverage Fractal Coherence [10]. Fractal Coherence is a design methodology for cache coherence protocols that can be formally verified using existing, automated, easy-to-use formal verification tools.…”
Section: Fractal Coherencementioning
confidence: 99%
“…Verification Process: As proven in the original Fractal Coherence paper [10], Fractal Coherence protocols can be formally verified to maintain cache coherence for any number of cores, using two scalable verification steps. First, we must verify that the minimum system is coherent Second, we must verify the fractal behavior, i.e., the larger-scale systems behave like the minimum system.…”
Section: Cache Coherencementioning
confidence: 99%
See 2 more Smart Citations
“…The design of even a simple coherence protocol is not trivial; under a coherence protocol, the response to a given request is determined by the state of all actors in the system, transient states due to indirections (e.g., cache line invalidation), and transient states due to the nondeterminism inherent in the relative timing of events. Since the state space explodes exponentially as the distributed directories and the number of cores grow, it is virtually impossible to cover all scenarios during verification either by simulation or by formal methods [18]. Unfortunately, verifying small subsystems does not guarantee the correctness of the entire system [3].…”
Section: Introductionmentioning
confidence: 99%