Abstract
BDDs (binary decision diagrams) are ubiquitous in formal verification tools, and the time and memory used by the BDD package is frequently the constraint that prevents application of formal verification. Accordingly, several researchers have investigated using parallel processing for BDDs. In this paper, we present a parallel BDD package with several novel features. The parallelization scheme strives for minimal communication overhead, so we are able to demonstrate speed-up even running on networked commodity PC workstations. Average memory utilization per node is comparable to that of efficient sequential packages. In addition, the package supports dynamic variable reordering, and simultaneous computation of multiple BDD operations. Finally, the package is designed for portability - providing a subset of the CUDD API for the application programmer, and running on the widely available PVM package.
This work was performed while the first author was visiting the University of British Columbia. The second author was partially supported by an NSERC research grant.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
R. E. Bryant. Graph-based algorithms for boolean function manipulation. IEEE Transactions on Computers, C-35(8):677–691, August 1986.
A. Geist, A. Beguelin, J. Dongarra, W. Jiang, R. Manchek, and V. Sunderam. PVM: Parallel Virtual Machine — A Users’ Guide and Tutorial for Networked Parallel Computing. MIT Press, 1994. See also: http://www.epm.ornl.gov/pvm/pvm_home.html.
C. Meinel and A. Slobodová. Speeding up variable reordering of OBDDs. In International Conference on Computer Design, pages 338–343. IEEE, October 1997.
R. K. Ranjan, W. Gosti, R. K. Brayton, and A. Sangiovanni-Vincentelli. Dynamic reordering in a breadth-first manipulation based BDD package: Challenges and solutions. In International Conference on Computer Design, pages 344–351. IEEE, October 1997.
R. Rudell. Dynamic variable ordering for ordered binary decision diagrams. In International Conference on Computer-Aided Design, pages 42–47. IEEE, 1993.
J. V. Sanghavi, R. K. Ranjan, R. K. Brayton, and A. Sangiovanni-Vincentelli. High performance BDD package by exploiting memory hierarchy. In 33th Design Automation Conference, pages 635–640. ACM/IEEE, 1996.
F. Somenzi. CUDD: CU decision diagram package. Available from: ftp://vlsi.colorado.edu/pub/.
T. Stornetta and F. Brewer. Implementation of an efficient parallel BDD package. In 33th Design Automation Conference, pages 641–644. ACM/IEEE, 1996.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Milvang-Jensen, K., Hu, A.J. (1998). BDDNOW: A Parallel BDD Package. In: Gopalakrishnan, G., Windley, P. (eds) Formal Methods in Computer-Aided Design. FMCAD 1998. Lecture Notes in Computer Science, vol 1522. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49519-3_32
Download citation
DOI: https://doi.org/10.1007/3-540-49519-3_32
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65191-8
Online ISBN: 978-3-540-49519-2
eBook Packages: Springer Book Archive