Article

Free access

Parallel breadth-first BDD construction

Authors:

David R. O'HallaronAuthors Info & Claims

PPOPP '97: Proceedings of the sixth ACM SIGPLAN symposium on Principles and practice of parallel programming

Pages 145 - 156

https://doi.org/10.1145/263764.263784

Published: 21 June 1997 Publication History

Abstract

With the increasing complexity of protocol and circuit designs, formal verification has become an important research area and binary decision diagrams (BDDs) have been shown to be a powerful tool in formal verification. This paper presents a parallel algorithm for BDD construction targeted at shared memory multiprocessors and distributed shared memory systems. This algorithm focuses on improving memory access locality through specialized memory managers and partial breadth-first expansion, and on improving processor utilization through dynamic load balancing. The results on a shared memory system show speedups of over two on four processors and speedups of up to four on eight processors. The measured results clearly identify the main source of bottlenecks and point out some intereeting directions for further improvements.

References

[1]

AMZA, C., Cox, A., DWARKADAS, S., HYAMS, C., LI, Z., AND ZWAENEPOEL, W. Treadmarks: Shared memory computing on networks of workstations. IEEE Computer 29, 2 (Feb 1996), 18-28.

Digital Library

[2]

ASHAR, R., AND CHEONG, M. Efficient breadth-first manipulation of binary decision diagrams. In Proceedings of the International Conference on Computer- Aided Design (November 1994), pp. 622-627.

Digital Library

[3]

BRACE, K., RUDELL, R., AND BRYANT, R. E. Efficient implementation of a BDD package. In Proceedings of the #Tth A CM/IEEE Design Automation Conference (June 1990), pp. 40-45.

Digital Library

[4]

BRGLZZ, F., AND FUJtWARA, H. A neutral netlist of 10 combinational benchmark circuits and a target translator in Fortran. In 1985 International Symposium on Circuits And Systems (1985).

[5]

BRYANT, R. E. Graph-based algorithms for Boolean function manipulation. In IEEE Transactions on Computers (1986), vol. C-35, pp. 8:677--691.

Digital Library

[6]

CHEN, Y.-A., AND BRYANT, R. E. Acv: An arithmetic circuit verifier, in Proceedings of the International Conference on Computer-Aided Design (November 1996), pp. 361-365.

Digital Library

[7]

CHEN, Y.-A., YANG, B., AND BRYANT, R. E. Breadthfirst with depth-first BDD construction: A hybrid approac.h. Tech. Rep. CMU-CS-97-120, School of Computer Science, Carnegie Mellon University, 1997.

[8]

DRECHSLER, R., BECKER, B., AND RUPPERTZ, S. K*BMDs: a new data structure for verification. In Proceedings of European Design and Test Conference (March 1996), pp. 2-8.

Digital Library

[9]

DRECHSLER, R., SARABI, A., THEOBALD, M., BECKER, B., AND PERKOWSKI, M. A. Efficient representation and manipulation of switching functions based on ordered kronecker functional decision diagrams. In Proceedings of the 31st ACM/IEEE Design Automation Conference (June 1994), pp. 415-419.

Digital Library

[10]

GAI, S., REBAUDENGO, M., AND REORDA, M. S. A data parallel algorithm for Boolean function manipulation. In Proceedings of Fifth Symposium on Frontiers of Massively Parallel Computation (February 1995), pp. 28-34.

Digital Library

[11]

HETT, A., FRECHSLER, R., AND BECKER, B. MORE: Alternative Implementation of BDD-Packages by Multi-Operand Synthesis. In Proceedings of the European Design Automation Conference (1996).

Digital Library

[12]

JAIN, J., NAaAYAN, A., COELHO, C., KHATm, S., SANGIOVANNI-VINCENTELLI, A., AND R.K. BRAYTON, M. F. Decomposition techniques for efficient ROBDD construction. In Proceedings of the Formal Methods on Computer-Aided Design (November 1996), pp. 419- 434.

Digital Library

[13]

JHA, S., Lu, Y., MINEA, M., AND CLARKE, E. M. Equivalence checking using abstract BDDs. Submitted to 1997 IEEE International Conference on Computer Design, 1997.

Digital Library

[14]

KIMURA, S., AND CLARKE, S. M. A parallel algorithm for constructing binary decision diagrams. In 1990 IEEE Proceedings of the International Conference on Computer Design (Sept 1990), pp. 220-223.

[15]

LENOSKI, D., LAUDON, J., GHARACHORLOO, K., WE- BER, W., GUPTA, A., HENNESSV, J., HoaowITz, M., AND LAM, M. The Stanford Dash multiprocessor. IEEE Computer 25, 3 (Mar. 1992), 63-79.

Digital Library

[16]

Ocm, H., ISHIURA, N., AND YAJIMA, S. Breadth-first manipulation of SBDD of Boolean functions for vector processing. In Proceedings of the Z8th ACM/IEEE Design Automation Conference (June 1991), pp. 413-416.

Digital Library

[17]

OCHI, H., YASUOKA, K., AND YAJIMA, S. Breadthfirst manipulation of very large binary-decision diagrams. In Proceedings of the International Conference on Computer-Aided Design (November 1993), pp. 48- 55.

Digital Library

[18]

PARASURAM, Y., STABLER, E., AND CHIN, S.-K. Parallel implementation of BDD algorithms using a distributed shared memory. In Proceedings of 27th Hawaii International Conference on Systems Sciences (January 1994), pp. 16-25.

[19]

RANJAN, R. K., SANGHAVI, J. V., BRAYTON, P#. K., AND SANGIOVANNI-VINCENTELLI, A. Decision diagrasns on network of workstations. In 1996 IEEE Proceedings of the International Conference on Computer Design (October 1996).

Digital Library

[20]

RANJAN, R. K., SANGHAVI, J. V., BRAYTON, R. K., AND SANGIOVANNI-VINCENTELLI, A. High performance BDD package based on exploiting memory hierarchy. In Proceedings of the 33rd A CM/IEEE Design Automation Conference (June 1996), pp. 635-640.

Digital Library

[21]

RUDELL, R. Dynamic variable ordering for ordered binary decision diagrams. In Proceedings of the International Conference on Computer-Aided Design (November 1993), pp. 139-144.

Digital Library

[22]

SENTOVICH, E. M., SINGH, K. J., LAVAGNO, L., MOON) C.)MURGAI, R., SALDANHA, A., SAVOJ, H.# STEPHAN, P. a.)BRAYTON, R. K.) AND SANGIOVANNI- VINCENTELLI.) A. L. SIS: A system for sequential circuit synthesis. Tech. Rep. UCB/ERL M92/41, Electronics Research Lab. University of California, May 1992.

[23]

SOTRNETTA, W., AND BREWER, F. Implementation of an efficient parallel BDD pac#ge. In Proceedings of the 33rd A CM/IEEE Design Automation Conference (June 1996), pp. 641--644.

Digital Library

[24]

SUBHLOK, J., AND YANG, B. A new model for integrated nested task and data parallel programming, in Ninth A CM SIGPLAN Symposium on Principles and Practice of Parallel Programming (June 1997). To Appear.

Digital Library

Cited By

Dijk TPol J(2017)SylvanInternational Journal on Software Tools for Technology Transfer (STTT)10.1007/s10009-016-0433-219:6(675-696)Online publication date: 1-Nov-2017
https://dl.acm.org/doi/10.1007/s10009-016-0433-2
Rossignac J(2011)Ordered Boolean List (OBL): Reducing the Footprint for Evaluating Boolean ExpressionsIEEE Transactions on Visualization and Computer Graphics10.1109/TVCG.2010.23217:9(1337-1351)Online publication date: Sep-2011
https://doi.org/10.1109/TVCG.2010.232
Wimmer MTraff J(2011)An Extended Work-Stealing Framework for Mixed-Mode Parallel ApplicationsProceedings of the 2011 IEEE International Symposium on Parallel and Distributed Processing Workshops and PhD Forum10.1109/IPDPS.2011.325(1683-1690)Online publication date: 16-May-2011
https://dl.acm.org/doi/10.1109/IPDPS.2011.325
Show More Cited By

Index Terms

Recommendations

Parallel breadth-first BDD construction

With the increasing complexity of protocol and circuit designs, formal verification has become an important research area and binary decision diagrams (BDDs) have been shown to be a powerful tool in formal verification. This paper presents a parallel ...
Parallel breadth-first search LTL model-checking
ASE'03: Proceedings of the 18th IEEE International Conference on Automated Software Engineering

We propose a practical parallel on-the-fly algorithm for enumerative LTL model-checking. The algorithm is designed for a cluster of workstations communicating via MPI. The detection of cycles (faulty runs) effectively employs the so called back-level ...
Parallel breadth-first search on distributed memory systems
SC '11: Proceedings of 2011 International Conference for High Performance Computing, Networking, Storage and Analysis

Data-intensive, graph-based computations are pervasive in several scientific applications, and are known to to be quite challenging to implement on distributed memory systems. In this work, we explore the design space of parallel algorithms for Breadth-...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

PPOPP '97: Proceedings of the sixth ACM SIGPLAN symposium on Principles and practice of parallel programming

June 1997

287 pages

ISBN:0897919068

DOI:10.1145/263764

Chairmen:
Rob Schreiber
Hewlett-Packard Labs, Palo Alto, CA
,
Keshav Pingali
Cornell Univ., Ithaca, NY
,
Editor:
Michael A. Berman

ACM SIGPLAN Notices Volume 32, Issue 7
July 1997
287 pages
ISSN:0362-1340
EISSN:1558-1160
DOI:10.1145/263767
Chairmen:
Rob Schreiber
Hewlett-Packard Labs, Palo Alto, CA
,
Keshav Pingali
Cornell Univ., Ithaca, NY
,
Editor:
A. Michael Berman
Issue’s Table of Contents

Copyright © 1997 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGPLAN: ACM Special Interest Group on Programming Languages

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 21 June 1997

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

PPoPP97

Sponsor:

SIGPLAN

PPoPP97: Principles & Practices of Parallel Programming

June 18 - 21, 1997

Nevada, Las Vegas, USA

Acceptance Rates

PPOPP '97 Paper Acceptance Rate 26 of 86 submissions, 30%;

Overall Acceptance Rate 230 of 1,014 submissions, 23%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

23
Total Citations
View Citations
633
Total Downloads

Downloads (Last 12 months)67
Downloads (Last 6 weeks)13

Reflects downloads up to 06 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Dijk TPol J(2017)SylvanInternational Journal on Software Tools for Technology Transfer (STTT)10.1007/s10009-016-0433-219:6(675-696)Online publication date: 1-Nov-2017
https://dl.acm.org/doi/10.1007/s10009-016-0433-2
Rossignac J(2011)Ordered Boolean List (OBL): Reducing the Footprint for Evaluating Boolean ExpressionsIEEE Transactions on Visualization and Computer Graphics10.1109/TVCG.2010.23217:9(1337-1351)Online publication date: Sep-2011
https://doi.org/10.1109/TVCG.2010.232
Wimmer MTraff J(2011)An Extended Work-Stealing Framework for Mixed-Mode Parallel ApplicationsProceedings of the 2011 IEEE International Symposium on Parallel and Distributed Processing Workshops and PhD Forum10.1109/IPDPS.2011.325(1683-1690)Online publication date: 16-May-2011
https://dl.acm.org/doi/10.1109/IPDPS.2011.325
Kunkle DSlavici VCooperman G(2010)Parallel disk-based computation for large, monolithic binary decision diagramsProceedings of the 4th International Workshop on Parallel and Symbolic Computation10.1145/1837210.1837222(63-72)Online publication date: 21-Jul-2010
https://dl.acm.org/doi/10.1145/1837210.1837222
Ciardo GZhao YJin X(2009)Parallel symbolic state-space exploration is difficult, but what is the alternative?Electronic Proceedings in Theoretical Computer Science10.4204/EPTCS.14.114(1-17)Online publication date: 15-Dec-2009
https://doi.org/10.4204/EPTCS.14.1
Hable JRossignac J(2007)CSTIEEE Transactions on Visualization and Computer Graphics10.1109/TVCG.2007.7041113:5(1004-1014)Online publication date: 1-Sep-2007
https://dl.acm.org/doi/10.1109/TVCG.2007.70411
Chung MCiardo G(2006)A dynamic firing speculation to speedup distributed symbolic state-space generationProceedings of the 20th international conference on Parallel and distributed processing10.5555/1898953.1899067(136-136)Online publication date: 25-Apr-2006
https://dl.acm.org/doi/10.5555/1898953.1899067
Ming-Ying Chung Ciardo G(2006)A dynamic firing speculation to speedup distributed symbolic state-space generationProceedings 20th IEEE International Parallel & Distributed Processing Symposium10.1109/IPDPS.2006.1639371(10 pp.)Online publication date: 2006
https://doi.org/10.1109/IPDPS.2006.1639371
Chung MCiardo G(2006)A Pattern Recognition Approach for Speculative Firing Prediction in Distributed Saturation State-Space GenerationElectronic Notes in Theoretical Computer Science (ENTCS)10.1016/j.entcs.2005.10.019135:2(65-80)Online publication date: 1-Feb-2006
https://dl.acm.org/doi/10.1016/j.entcs.2005.10.019
Iyer SJain JSahoo DEmerson E(2006)Under-approximation Heuristics for Grid-based Bounded Model CheckingElectronic Notes in Theoretical Computer Science (ENTCS)10.1016/j.entcs.2005.10.017135:2(31-46)Online publication date: 1-Feb-2006
https://dl.acm.org/doi/10.1016/j.entcs.2005.10.017
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents