论文信息 - The design of a cache-friendly BDD library

The design of a cache-friendly BDD library

We describe the architecture for a new BDD library that is designed to be cache-friendly. The library incorporates a novel technique for terminating searches early during find operations together with a regrouping garbage collector. These features lead to a factor of two improvement in speed on typical examples compared to existing libraries.

D. E. Long | D.E. Long

[1] Randal E. Bryant,et al. Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.

[2] Nils Klarlund,et al. BDD Algortihms and Cache Misses , 1996 .

[3] Pranav Ashar,et al. Efficient breadth-first manipulation of binary decision diagrams , 1994, ICCAD.

[4] Randal E. Bryant,et al. Symbolic Boolean manipulation with ordered binary-decision diagrams , 1992, CSUR.

[5] Rafael Dueire Lins,et al. Garbage collection: algorithms for automatic dynamic memory management , 1996 .

[6] Fabio Somenzi,et al. CUDD: CU Decision Diagram Package Release 2.2.0 , 1998 .

[7] Hiroyuki Ochi,et al. Breadth-first manipulation of very large binary-decision diagrams , 1993, Proceedings of 1993 International Conference on Computer Aided Design (ICCAD).

[8] Randal E. Bryant,et al. Efficient implementation of a BDD package , 1991, DAC '90.

[9] Richard Rudell. Dynamic variable ordering for ordered binary decision diagrams , 1993, ICCAD.

[10] Robert K. Brayton,et al. High performance BDD package by exploiting memory hierarchy , 1996, DAC '96.