Distributed binary decision diagrams for verification of large circuits
Authors:
- C. ChaseCCC. Chase
- D. MoundanosDMD. Moundanos
- 24 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 365-370
Abstract
Binary Decision Diagrams (BDDs) are widely used for efficiently representing logic designs and for verifying their equivalence. However, they often require large amounts of memory even for relatively small circuits. This paper presents a new mechanism for alleviating the memory consumption problem by exploiting the memory available in a cluster of workstations. The memory required for a BDD node may be allocated in other machines on the network, and any reference to a BDD node returns the value from the appropriate machine in a transparent fashion. Using this technique we are able to verify the sequential benchmark s1423, even though the BDDs required for verification exceed 2 gigabytes of storage.Keywords
This publication has 7 references indexed in Scilit:
- IBDDs: an efficient functional representation for digital circuits2003
- A parallel algorithm for constructing binary decision diagrams2002
- Symbolic Boolean manipulation with ordered binary-decision diagramsACM Computing Surveys, 1992
- Implementing Safety-Critical Systems: The VIPER Microprocessor1988
- Logic verification algorithms and their parallel implementation1987
- Graph-Based Algorithms for Boolean Function ManipulationIEEE Transactions on Computers, 1986
- Binary Decision DiagramsIEEE Transactions on Computers, 1978