Abstract
Ordered Binary-Decision Diagrams (OBDD) are the state-of-the art<br />data structure for boolean function manipulation and there exist<br />several software packages for OBDD manipulation. OBDDs have<br />been successfully used to solve problems in e.g. digital-systems design, verification and testing, in mathematical logic, concurrent system design and in artificial intelligence. The OBDDs used in many of these applications quickly get larger than the available main memory and it becomes essential to consider the problem of minimizing the Input/Output (I/O) communication. In this paper we analyze why existing OBDD manipulation algorithms perform poorly in an I/O environment and develop new I/O-efficient algorithms.
Publisher
Det Kgl. Bibliotek/Royal Danish Library
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Predicting Memory Demands of BDD Operations Using Maximum Graph Cuts;Automated Technology for Verification and Analysis;2023
2. Adiar Binary Decision Diagrams in External Memory;Tools and Algorithms for the Construction and Analysis of Systems;2022
3. External Memory Data Structures;Massive Computing;2002