|
Hokkaido University Collection of Scholarly and Academic Papers >
Graduate School of Information Science and Technology / Faculty of Information Science and Technology >
Peer-reviewed Journal Articles, etc >
Streaming BDD manipulation
| Title: | Streaming BDD manipulation |
| Authors: | Minato, Shin-ichi Browse this author →KAKEN DB |
| Keywords: | BDD | | binary decision diagram | | VLSI CAD | | logic design | | verification | | testing | | data structure | | algorithm | | combinatorial problem |
| Issue Date: | May-2002 |
| Publisher: | IEEE |
| Journal Title: | IEEE Transactions on Computers |
| Volume: | 51 |
| Issue: | 5 |
| Start Page: | 474 |
| End Page: | 485 |
| Publisher DOI: | 10.1109/TC.2002.1004587 |
| Abstract: | Binary decision diagrams (BDDs) are commonly used for handling Boolean functions because of their excellent efficiency in terms of time and space. However, the conventional BDD manipulation algorithm is strongly based on the hash table technique, so it always encounters the memory overflow problem when handling large-scale BDD data. This paper proposes a new streaming BDD manipulation method that never causes memory overflow or swap out. This method allows us to handle very large-scale BDD stream data beyond the memory limitation. Our method can be characterized as follows: (1) it gives a continuous tradeoff curve between memory usage and stream data length, (2) valid solutions for a partial Boolean space can be obtained if we break the process before finishing, and (3) easily accelerated by pipelined multiprocessing. An experimental result demonstrates that we can succeed in finding a number of solutions to a SAT problem using a commodity PC with a 64 MB memory, where as the conventional BDD manipulator would have required a 100 GB memory. BDD manipulation has been considered as an intensively memory-consuming procedure, but now we can also utilize the hard disk and network resources as well. The method leads to a new approach to BDD manipulation |
| Rights: | © 2002 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. |
| Relation: | http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12 |
| Type: | article |
| URI: | http://hdl.handle.net/2115/16897 |
| Appears in Collections: | 情報科学院・情報科学研究院 (Graduate School of Information Science and Technology / Faculty of Information Science and Technology) > 雑誌発表論文等 (Peer-reviewed Journal Articles, etc)
|
Submitter: 湊 真一
|
