Title :
Distributed dynamic BDD reordering
Author :
Nevo, Ziv ; Farkash, Monica
Author_Institution :
IBM Haifa Res. Labs.
Abstract :
Dynamic BDD reordering is usually a computationally-demanding process, and may slow down BDD-based applications. We propose a novel algorithm for distributing this process over a number of computers, improving both reordering time and application time. Our algorithm is based on Rudell´s popular sifting algorithm, and takes advantage of a few empirical observations we make regarding Rudell´s algorithm. Experimental results show the efficiency and scalability of our approach, when applied within an industrial model checker
Keywords :
binary decision diagrams; circuit CAD; Rudell algorithm; application time; distributed dynamic BDD reordering; reordering time; sifting algorithm; Application software; Binary decision diagrams; Boolean functions; Computer applications; Data structures; Design automation; Distributed computing; Heuristic algorithms; Runtime; Scalability; Algorithms; BDD; Experimentation; Model checking; Performance; Verification; distributed computing; reordering;
Conference_Titel :
Design Automation Conference, 2006 43rd ACM/IEEE
Conference_Location :
San Francisco, CA
Print_ISBN :
1-59593-381-6
DOI :
10.1109/DAC.2006.229205
