Title :
BEATNP: a tool for partitioning Boolean networks
Author :
Cho, H. ; Hachtel, G. ; Nash, M. ; Setiono, L.
Author_Institution :
Dept. of Electr. & Comput. Eng., Colorado Univ., Boulder, CO, USA
Abstract :
BEATNP (BoolEAn Tools Network Partitioner) was designed to extend the application size capability of the BOLD (Boulder Optimal Logic Design) system. BEATNP partitions a Boolean network into subnetworks which satisfy user specified size constraints. Most of the tools in the BOLD tools suite solve problems which are in NP or Co-NP, so they can be assumed to have exponential complexity. Because the BEATNP algorithms have log-linear worst-case complexity, the CPU time requirements of optimization tools can be reduced greatly in difficult cases. When used with the BOLD minimizer on a set of well known benchmark examples, BEATNP reduced CPU time by 1 to 3 orders of magnitude while retaining a significant majority of the optimization savings available in the unpartitioned case.<>
Keywords :
computational complexity; logic CAD; minimisation of switching nets; BEATNP; BOLD minimizer; Boolean network; Boolean network partitioner; Boulder Optimal Logic Design; CPU time; CPU time requirements; application size capability; exponential complexity; log-linear worst-case complexity; optimization tools; subnetworks; user specified size constraints; Application software; Benchmark testing; Boolean functions; Clustering algorithms; Computer networks; Design engineering; Design optimization; Logic design; Minimization; Partitioning algorithms;
Conference_Titel :
Computer-Aided Design, 1988. ICCAD-88. Digest of Technical Papers., IEEE International Conference on
Conference_Location :
Santa Clara, CA, USA
Print_ISBN :
0-8186-0869-2
DOI :
10.1109/ICCAD.1988.122452
