arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2104.12101cs.DS
收藏

外部内存中二进制决策图操作的高效方法

Efficient Binary Decision Diagram Manipulation in External Memory

Aarhus University(奥胡斯大学)

Steffan Christ Sølvsten, Jaco van de Pol, Anna Blume Jakobsen, Mathias Weller Berg Thomasen

AI总结:

本文提出基于迭代I/O高效算法的BDD操作方法,改进了原有算法性能,并扩展至其他BDD操作,实现更高效的外部内存处理。

摘要:

我们延续Lars Arge的想法,将二进制决策图(BDD)的Reduce和Apply过程重新表述为迭代I/O高效算法。我们识别出多个简化和提升其算法性能的途径。此外,我们将该技术扩展到其他常见的BDD操作,其中许多无法仅通过Apply操作推导得出,并为可通过Apply操作推导出的程序提供渐进改进。这些算法在新的BDD包Adiar中实现。当比较Adiar与传统使用递归深度优先算法的BDD包性能时,对于超过8.2 GiB的实例,我们的算法在部分使用磁盘的情况下,比仅使用主内存的CUDD和Sylvan慢1.47到3.69倍。然而,我们的方法仅需传统BDD包极少的主内存即可实现此性能。此外,借助Adiar,我们能够处理超出主内存限制的BDD,从而超越其他BDD包的限制。

英文摘要:

We follow up on the idea of Lars Arge to rephrase the Reduce and Apply procedures of Binary Decision Diagrams (BDDs) as iterative I/O-efficient algorithms. We identify multiple avenues to simplify and improve the performance of his proposed algorithms. Furthermore, we extend the technique to other common BDD operations, many of which are not derivable using Apply operations alone, and we provide asymptotic improvements for the procedures that can be derived using Apply. These algorithms are implemented in a new BDD package, named Adiar. We see very promising results when comparing the performance of Adiar with conventional BDD packages that use recursive depth-first algorithms. For instances larger than 8.2 GiB, our algorithms, in parts using the disk, are 1.47 to 3.69 times slower compared to CUDD and Sylvan, exclusively using main memory. Yet, our proposed techniques are able to obtain this performance at a fraction of the main memory needed by conventional BDD packages to function. Furthermore, with Adiar we are able to manipulate BDDs that outgrow main memory and so surpass the limits of other BDD packages.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑