Clustered time warp and logic simulation
Clustered time warp and logic simulation
复制标题
集群时间扭曲和逻辑模拟
DOI：
10.1109/pads.1995.404310
复制
发表时间：
1995
期刊：
影响因子：
--
通讯作者：
C. Tropper
中科院分区：
文献类型：
--
作者：
Hervé Avril;C. Tropper
在本文中，我们提出了一种混合算法，该算法利用 LP 集群之间的时间扭曲和集群内的顺序算法。当然，时间扭曲传统上是在各个 LP 之间实施的。该算法在数字逻辑模拟器中实现，其性能与时间扭曲进行了比较。在此平台上，我们开发了一系列三种检查点算法，每种算法在内存使用和执行时间之间可能的权衡中占据不同的位置。该算法在多个数字逻辑电路上实现，并将其速度、保存的状态数和最大内存消耗与时间扭曲进行了比较。其中一种算法节省了时间扭曲消耗的最大内存的 35% 到 50%（取决于所使用的处理器数量），而另外两种算法则将最大使用量降低了 30%。后两种算法的速度与时间扭曲相当，而第一种算法慢了 30-60%。这些算法也比最佳检查点算法更容易实现。<<ETX>>
We present, in this paper, a hybrid algorithm which makes use of Time Warp between clusters of LPs and a sequential algorithm within the cluster. Time Warp is, of course, traditionally implemented between individual LPs. The algorithm was implemented in a digital logic simulator, and its performance compared to that of Time Warp. Resting upon this platform we develop a family of three checkpointing algorithms, each of which occupies a different point in the spectrum of possible trade-offs between memory usage and execution time. The algorithms were implemented on several digital logic circuits and their speed, number of states saved and maximal memory consumption were compared to those of Time Warp. One of the algorithms saved between 35 and 50% of the maximal memory consumed by Time Warp (depending upon the number of processors used), while the other two decreased the maximal usage up to 30%. The latter two algorithms exhibited a speed comparable to Time Warp, while the first algorithm was 30-60% slower. These algorithms are also simpler to implement than optimal checkpointing algorithms.<<ETX>>