Breadth-First with Depth-First BDD Construction: A Hybrid Approach,
Abstract
This paper presents the technique of operator sifting as a new way of understanding both breadth-first and depth-first approaches to BDD construction. A new algorithm is also proposed to capture the breadth-first approach's advantage of memory access locality, while keeping the depth-first approach's advantage of low memory overhead. Our preliminary experimental results show that our approach is generally faster than other implementations that rely exclusively on either breadth-first or depth-first approaches while keeping memory overhead comparable to that of depth-first approaches.
Document Details
- Document Type
- Technical Report
- Publication Date
- Mar 01, 1997
- Accession Number
- ADA324567
Entities
People
- Bwolen Yang
- Randal Bryant
- Yirng-an Chen
Organizations
- Carnegie Mellon University