A parallel algorithm for constructing binary decision diagrams

@inproceedings{Kimura1990APA,
  title={A parallel algorithm for constructing binary decision diagrams},
  author={Shinji Kimura and Edmund M. Clarke},
  booktitle={ICCD},
  year={1990}
}
Ordered binary decision diagrams [1] are widely used for representing Boolean functions in various CAD applications. This paper gives a parallel algorithm for constructing such graphs and describes the performance of this algorithm on a 16 processor Encore Multimax. The execution statistics that we have obtained for a number of examples show that our algorithm achieves a high degree of parallelism. In particular, with fifteen processors our algorithm is almost an order of magnitude faster on… CONTINUE READING

Citations

Publications citing this paper.

86 Citations

0246'91'97'04'11'18
Citations per Year
Semantic Scholar estimates that this publication has 86 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
SHOWING 1-6 OF 6 REFERENCES

Performance of COSMOS on The IFIF Workshop Benchmarkes

  • Allan L. Fisher, Randal E. Bryant
  • In Proceedings of IMEC Conference,
  • 1989
2 Excerpts

C threads

  • E. C. Cooper
  • Technical Report CMU-CS-88-154, Carnegie Mellon…
  • 1988
1 Excerpt

Bryant . Graph - Based Algorithms for Boolean Function Manipulation

  • E. Randal
  • IEEE Transactions on Computers
  • 1986

Similar Papers

Loading similar papers…