Binary decision diagrams on network of workstation

Authors:
Rajeev K. Ranjan;Jagesh V. Sanghavi;Robert K. Brayton;Alberto L. Sangiovanni-Vincentelli
Affiliations:
-;-;-;-
Venue:
ICCD '96 Proceedings of the 1996 International Conference on Computer Design, VLSI in Computers and Processors
Year:
1996

Citing 0
Cited 11

Parallel breadth-first BDD construction

PPOPP '97 Proceedings of the sixth ACM SIGPLAN symposium on Principles and practice of parallel programming
Parallelizing the Murϕ Verifier

Formal Methods in System Design - Special issue on CAV '97
Streaming BDD Manipulation

IEEE Transactions on Computers
A Scalable Parallel Algorithm for Reachability Analysis of Very Large Circuits

Formal Methods in System Design
ClusterNet: An Object-Oriented Cluster Network

IPDPS '00 Proceedings of the 15 IPDPS 2000 Workshops on Parallel and Distributed Processing
Exploiting Transition Locality in the Disk Based Mur phi Verifier

FMCAD '02 Proceedings of the 4th International Conference on Formal Methods in Computer-Aided Design
Exploiting Transition Locality in Automatic Verification

CHARME '01 Proceedings of the 11th IFIP WG 10.5 Advanced Research Working Conference on Correct Hardware Design and Verification Methods
Dealing with practical limitations of distributed timed model checking for timed automata

Formal Methods in System Design
A Pattern Recognition Approach for Speculative Firing Prediction in Distributed Saturation State-Space Generation

Electronic Notes in Theoretical Computer Science (ENTCS)
Parallel disk-based computation for large, monolithic binary decision diagrams

Proceedings of the 4th International Workshop on Parallel and Symbolic Computation
A dynamic firing speculation to speedup distributed symbolic state-space generation

IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The success of all binary decision diagram (BDD) based synthesis and verification algorithms depend on the ability to efficiently manipulate very large BDDs. We present algorithms for manipulation of very large Binary Decision Diagrams (BDDs) on a network of workstations (NOW). A NOW provides a collection of main memories and disks which can be used effectively to create and manipulate very large BDDs. To make efficient use of memory resources of a Now, while completing execution in a reasonable amount of wall clock time, extension of breadth-first technique is used to manipulate BDDs. BDDs are partitioned such that nodes for a set of consecutive variables are assigned to the same workstation. We present experimental results to demonstrate the capability of such an approach and point towards the potential impact for manipulating very large BDDs.