返回
Verification techniques for cache coherence protocols
DOI:10.1145/248621.248624.png)
摘要
En 中文
In this article we present a comprehensive survey of various approaches for the verification of cache coherence protocols based on state enumeration, (symbolic) model checking, and symbolic state models. Since these techniques search the state space of the protocol exhaustively, the amount of memory required to manipulate the state information and the verification time grow very fast with the number of processors and the complexity of the protocol mechanisms. To be successful for systems of arbitrary complexity, a verification technique must solve this so-called state space explosion problem. The emphasis of our discussion is on the underlying theory in each method of handling the state space explosion problem, and formulating and checking the safety properties (e.g., data consistency) and the liveness properties (absence of deadlock and livelock). We compare the efficiency and discuss the limitations of each technique in terms of memory and computation time. Also, we discuss issues of generality, applicability, automaticity, and amenity for existing tools in each class of methods. No method is truly superior because each method has its own strengths and weaknesses. Finally, refinements that can further reduce the verification time and/or the memory requirement are also discussed.
Keyword:
cache coherence
finite state machine
protocol verification
shared-memory multiprocessors
state representation and expansion
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
28
论文数:
2.4K
被引数:
3.5W
机构
暂无机构信息
引用论文
Synthesis, Characterisation and Catalytic Application of Oxidorhenium Complexes Bearing H‐Spirophosphorane Ligands含h-螺膦配体的氧化铼配合物的合成,表征及催化应用
Nuclear Magnetic Resonance Characterization of the Myristoylated, N-Terminal Fragment of ADP-Ribosylation Factor 1 in a Magnetically Oriented Membrane Array
Biochemistry
IF0

