Optimizing bit-time computer simulation

Authors:
Jesse H. Katz
Affiliations:
Thompson Ramo Woolridge, Inc., Canoga Park, CA
Venue:
Communications of the ACM
Year:
1963

Citing 1
Cited 7

Techniques for storage allocation algorithms

Communications of the ACM

A Programming Language for Simulating Digital Systems

Journal of the ACM (JACM)
Exclusive simulation of activity in digital networks

Communications of the ACM
Generation of optimal code for expressions via factorization

Communications of the ACM
Techniques for the simulation of computer logic

Communications of the ACM
Computer simulation of computer system performance

ACM '67 Proceedings of the 1967 22nd national conference
Programming languages for non-numeric processing—2: Time sequenced logical simulation based on circuit delay and selective tracing of active network paths

ACM '65 Proceedings of the 1965 20th national conference
The application of integer programming in design automation

DAC '66 Proceedings of the SHARE design automation project

Quantified Score

Hi-index	48.27

Visualization

Abstract

A major component of a bit-time computer simulation program is the Boolean compiler. The compiler accepts the Boolean functions representing the simulated computer's digital circuits, and generates corresponding sets of machine instructions which are subsequently executed on the “host” computer. Techniques are discussed for increasing the sophistication of the Boolean compiler so as to optimize bit-time computer simulation. The techniques are applicable to any general-purpose computer.