Design with race-free hardware semantics
Design with race-free hardware semantics
复制标题
使用无竞争硬件语义进行设计
DOI：
10.1109/date.2006.243956
复制
发表时间：
2006
期刊：
影响因子：
--
通讯作者：
I. Verbauwhede
中科院分区：
文献类型：
--
作者：
P. Schaumont;S. Shukla;I. Verbauwhede
大多数硬件描述语言不强制确定性，这意味着它们可能产生竞争。竞争条件对硬件的实现、验证和确认提出了问题。在建模级别强制确定性提供了解决这个问题的方案。在本文中，我们考虑了一种常见的计算模型的硬件建模-网络的循环真正的有限状态机与数据路径（FSMD）-我们确定的条件下，这些模型是保证是免费的竞争。我们的分析基础上的Kahn原则和一个正式的框架来表示FSMD语义。我们提出了我们的结论为四个简单，易于执行的建模规则。应用这四个建模规则的硬件设计者将因此获得无竞争的硬件
Most hardware description languages do not enforce determinacy, meaning that they may yield races. Race conditions pose a problem for the implementation, verification, and validation of hardware. Enforcing determinacy at the modeling level provides a solution to this problem. In this paper, we consider a common model of computation for hardware modeling - a network of cycle-true finite-state-machines with datapaths (FSMDs) - and we identify the conditions under which such models are guaranteed to be race-free. We base our analysis on the Kahn principle and a formal framework to represent FSMD semantics. We present our conclusions as four simple and easy to enforce modeling rules. A hardware designer that applies those four modeling rules, will thus obtain race-free hardware