In this paper a pointerless BDD package is proposed. The new design is
inspired by the 1998 ICCAD paper of David Long [Long98]. The main idea is to enforce a strict ordering on the BDD node identifiers and cleverly reap the advantageous consequences of that decision, such as a better memory locality of the nodes and faster unique table lookup. The down side is a more complicated garbage collection scheme, although it offers some extra
flexibility. It will also be shown how dynamic variable ordering fits into
this new context. The ultimate goal is to exceed the performance of a
pointer-based package and have reproducible results across different
platforms.
By: Geert Janssen
Published in: RC22000 in 2001
LIMITED DISTRIBUTION NOTICE:
This Research Report is available. This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and specific requests. After outside publication, requests should be filled only by reprints or legally obtained copies of the article (e.g., payment of royalties). I have read and understand this notice and am a member of the scientific community outside or inside of IBM seeking a single copy only.
Questions about this service can be mailed to reports@us.ibm.com .