Explore the vast range of titles available.

This thesis addresses the feasibility of mapping the COSMOS switch-level simulator onto computers with thousands of simple processors. COSMOS preprocesses transistor networks into equivalent Boolean behavioral models, capturing the switch-level behavior of a circuit in a set of Boolean formulas. We show that thousand-fold parallelism exists in the formulas derived by COSMOS for some actual circuits. We expose this parallelism by eliminating the event list from the simulator, and we demonstrate that this represents an attractive tradeoff given sufficient parallelism in the circuit model. To investigate the feasibility of this approach, we have developed a prototype implementation of the COSMOS simulator on a 32k processor Connection Machine.