A data parallel algorithm for Boolean function manipulation

Authors:
S. Gai;M. Rebaudengo;M. S. Reorda
Affiliations:
-;-;-
Venue:
FRONTIERS '95 Proceedings of the Fifth Symposium on the Frontiers of Massively Parallel Computation (Frontiers'95)
Year:
1995

Citing 0
Cited 4

Implementation of an efficient parallel BDD package

DAC '96 Proceedings of the 33rd annual Design Automation Conference
Parallel breadth-first BDD construction

PPOPP '97 Proceedings of the sixth ACM SIGPLAN symposium on Principles and practice of parallel programming
A Pattern Recognition Approach for Speculative Firing Prediction in Distributed Saturation State-Space Generation

Electronic Notes in Theoretical Computer Science (ENTCS)
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

This paper describes a data-parallel algorithm for boolean function manipulation. The algorithm adopts Binary Decision Diagrams (BDDs), which are the state-of-the-art approach for representing and handling boolean functions. The algorithm is well suited for SIMD architectures and is based on distributing BDD nodes to the available Processing Elements and traversing BDDs in a breadth-first manner. An improved version of the same algorithm is also presented, which does not use virtual processors. A prototypical package has been implemented and its behavior has been studied with two different applications. In both cases the results show that the approach exploits well the parallel hardware by effectively distributing the load; thanks to the limited CPU time required and to the great amount of memory available, it can solve problems that can not be faced with by conventional architectures.