Statistics on logic simulation

  • Authors:
  • K. F. Wong;M. A. Franklin;R. D. Chamberlain;B. L. Shing

  • Affiliations:
  • Center For Computer Systems Design, Washington University, St. Louis, Missouri;Center For Computer Systems Design, Washington University, St. Louis, Missouri;Center For Computer Systems Design, Washington University, St. Louis, Missouri;Center For Computer Systems Design, Washington University, St. Louis, Missouri

  • Venue:
  • DAC '86 Proceedings of the 23rd ACM/IEEE Design Automation Conference
  • Year:
  • 1986

Quantified Score

Hi-index 0.00

Visualization

Abstract

The high costs associated with logic simulation of large VLSI based systems have led to the need for new computer architectures tailored to the simulation task. Such architectures have the potential for significant speedups over standard software based logic simulators. Several commercial simulation engines have been produced to satisfy needs in this area. To properly explore the space of alternative simulation architectures, data is required on the simulation process itself. This paper presents a framework for such data gathering activity by first examining possible sources of speedup in the logic simulation task, examining the sort of data needed in the design of simulation engines, and then presenting such data. The data contained in the paper includes information on subtask times found in standard discrete event simulation algorithms, event intensities, queue length distributions and simultaneous event distributions.