Parallel Disk-Based Computation for Large, Monolithic Binary Decision Diagrams

Binary Decision Diagrams (BDDs) are widely used in formal verification. They are also widely known for consuming large amounts of memory. For larger problems, a BDD computation will often start thrashing due to lack of memory within minutes. This work uses the parallel disks of a cluster or a SAN (Storage Area Network) as an extension of RAM, in order to efficiently compute with BDDs that are orders of magnitude larger than what is available on a typical computer. The use of parallel disks overcomes the bandwidth problem of single disk methods, since the bandwidth of 50 disks is similar to the bandwidth of a single RAM subsystem.

Provided by: Association for Computing Machinery Topic: Storage Date Added: Jul 2010 Format: PDF

Find By Topic