Abstract
The incremental simulation algorithm speeds up the simulation of digital hardware by storing and reusing simulation events. For large circuits, in order to reduce the amount of events to be stored, it is necessary to select nets and store only the events relevant to those nets. Our new incremental simulation algorithm selects nets according to expected amounts of evaluation eliminated by storing each net's simulation events. Compared to traditional net selection algorithm, speedups of 1.78 to 1.94 were achievable with our algorithm.
Original language | English |
---|---|
Pages | 343-346 |
Number of pages | 4 |
Publication status | Published - 1995 Dec 1 |
Externally published | Yes |
Event | Proceedings of the 1995 IEEE Region 10 International Conference on Microelectronics and VLSI, TENCON'95 - Hong Kong, Hong Kong Duration: 1995 Nov 6 → 1995 Nov 10 |
Other
Other | Proceedings of the 1995 IEEE Region 10 International Conference on Microelectronics and VLSI, TENCON'95 |
---|---|
City | Hong Kong, Hong Kong |
Period | 95/11/6 → 95/11/10 |
ASJC Scopus subject areas
- Computer Science Applications
- Electrical and Electronic Engineering