Algorithms for Categorizing Multiprocessor Communication Under Invalidate and Update-Based Coherence Protocols.

1994 ◽  
Author(s):  
Ricardo Bianchini ◽  
Leonidas Kontothanassis
Keyword(s):  
Coherence Protocols

Designing Predictable Cache Coherence Protocols for Multi-Core Real-Time Systems

2020 ◽  
pp. 1-1
Author(s):  
Anirudh Mohan Kaushik ◽  
Mohamed Hassan ◽  
Hiren Patel
Keyword(s):  
Real Time ◽  
Cache Coherence ◽  
Real Time Systems ◽  
Cache Coherence Protocols ◽  
Coherence Protocols ◽  
Time Systems

Integrating cache coherence protocols for heterogeneous multiprocessor systems. 1

IEEE Micro ◽  
2004 ◽  
Vol 24 (4) ◽  
pp. 33-41 ◽  
Author(s):  
T. Suh ◽  
H.-H.S. Lee ◽  
D.M. Blough
Keyword(s):  
Cache Coherence ◽  
Multiprocessor Systems ◽  
Cache Coherence Protocols ◽  
Coherence Protocols ◽  
Heterogeneous Multiprocessor

scholarly journals ParaVerifier: An Automatic Framework for Proving Parameterized Cache Coherence Protocols

2015 ◽  
pp. 207-213 ◽  
Author(s):  
Yongjian Li ◽  
Jun Pang ◽  
Yi Lv ◽  
Dongrui Fan ◽  
Shen Cao ◽  
...  
Keyword(s):  
Cache Coherence ◽  
Cache Coherence Protocols ◽  
Coherence Protocols

scholarly journals Cryptographic Protocol Verification via Supercompilation (A Case Study)

10.29007/gpsh ◽  
2018 ◽  
Author(s):  
Abdulbasit Ahmed ◽  
Alexei Lisitsa ◽  
Andrei Nemytykh
Keyword(s):  
Program Transformation ◽  
Cache Coherence ◽  
Protocol Verification ◽  
Cryptographic Protocol ◽  
Levels Of Abstraction ◽  
Transformation Techniques ◽  
Program Specialization ◽  
Coherence Protocols ◽  
Different Levels

It has been known for a while that program transformation techniques, in particular, program specialization, can be used to prove the properties of programs automatically. For example, if a program actually implements (in a given context of use) a constant function, sufficiently powerful and semantics preserving program transformation may reduce the program to a syntactically trivial ``constant'' program, pruning unreachable branches and proving thereby the property. Viability of such an approach to verification has been demonstrated in previous works where it was applied to the verification of parameterized cache coherence protocols and Petri Nets models.In this paper we further extend the method and present a case study on its appication to the verification of a cryptographic protocol. The protocol is modeled by functional programs at different levels of abstraction and verification via program specialization is done by using Turchin's supercompilation method.

A Method for Fast Evaluation of Sharing Set Management Strategies in Cache Coherence Protocols

2017 ◽  
pp. 111-123 ◽  
Author(s):  
Julie Dumas ◽  
Eric Guthmuller ◽  
César Fuguet Tortolero ◽  
Frédéric Pétrot
Keyword(s):  
Cache Coherence ◽  
Management Strategies ◽  
Fast Evaluation ◽  
Cache Coherence Protocols ◽  
Coherence Protocols
Sign in / Sign up

Export Citation Format

Share Document