LECSIM: a levelized event driven compiled logic simulation
DAC '90 Proceedings of the 27th ACM/IEEE Design Automation Conference
The shadow algorithm: a scheduling technique for both compiled and interpreted simulation
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Unit delay simulation with the inversion algorithm
Proceedings of the 1996 IEEE/ACM international conference on Computer-aided design
Software bit-slicing: a technique for improving simulation performance
DATE '99 Proceedings of the conference on Design, automation and test in Europe
Logic simulation using networks of state machines
DATE '00 Proceedings of the conference on Design, automation and test in Europe
Event driven simulation without loops or conditionals
Proceedings of the 2000 IEEE/ACM international conference on Computer-aided design
A fast logic simulator using a look up table cascade emulator
ASP-DAC '06 Proceedings of the 2006 Asia and South Pacific Design Automation Conference
Metamorphic differential simulation using the multi-delay timing model
Proceedings of the Symposium on Theory of Modeling & Simulation - DEVS Integrative M&S Symposium
| Hi-index | 0.00 |
The Inversion Algorithm is an event-driven algorithm, whose performance rivals or exceeds that of Levelized Compiled code simulation, even at activity rates of 50% or more. The Inversion Algorithm has several unique features, the most remarkable of which is the size of the run-time code. The basic Algorithm can be implemented using no more than a page of run-time code, although in practice it is more efficient to provide several different variations of the basic algorithm. The run-time code is independent of the circuit under test, so the algorithm can be implemented either as a compiled code or an interpreted simulator with little variation in performance. Because of the small size of the run-time code, the run-time portions of the Inversion Algorithm can be implemented in assembly language for peak efficiency, and still be retargeted for new platforms with little effort.