Slack matching quasi delay-insensitive circuits
Slack matching quasi delay-insensitive circuits
复制标题
松弛匹配准延迟不敏感电路
DOI：
--
复制
发表时间：
2006
期刊：
影响因子：
--
通讯作者：
Alain J. Martin
中科院分区：
文献类型：
--
作者：
Piyush Prakash;Alain J. Martin
松弛匹配是一种优化，它确定必须添加到松弛弹性异步系统的每个通道的缓冲量，以便将其周期时间减少到指定的目标。我们提出了两种方法表示松弛匹配问题作为一个混合整数线性规划问题。第一种方法适用于由全缓冲器或半缓冲器组成的系统，但不适用于两者。第二种方法适用于由全缓冲器和半缓冲器的任意组合组成的系统
Slack matching is an optimization that determines the amount of buffering that must be added to each channel of a slack elastic asynchronous system in order to reduce its cycle time to a specified target. We present two methods of expressing the slack matching problem as a mixed integer linear programming problem. The first method is applicable to systems composed of either full-buffers or half-buffers but not both. The second method is applicable to systems composed of any combination of full-buffers and half-buffers