4 research outputs found

    High performance bdd package by exploiting memory hierarchy

    Get PDF
    Abstract The success of binary decision diagram (BDD

    Binary Decision Diagrams on Network of Workstations

    No full text
    The success of all binary decision diagram (BDD) based synthesis and verification algorithms depend on the ability to efficiently manipulate very large BDDs. We present algorithms for manipulation of very large Binary Decision Diagrams (BDDs) on a network of workstations (NOW). ANOW provides a collection of main memories and disks which can be used effectively to create and manipulate very large BDDs. To make efficient use of memory resources of a NOW, while completing execution in a reasonable amount of wall clock time, extension of breadth-first technique is used to manipulate BDDs. BDDs are partitioned such that nodes for a set of consecutive variables are assigned to the same workstation. We present experimental results to demonstrate the capability of such an approach and point towards the potential impact for manipulating very large BDDs. 1 Introduction The manipulation of boolean functions is one of the most important operations in several areas of computer-aided design such a..

    ESPRESSO-SIGNATURE: A New Exact Minimizer for Logic Functions

    No full text
    We present a new algorithm for exact two-level logic optimization. We represent a set of primes by the cube of their intersection. Therefore, the unique set of sets of primes which forms the covering problem can be implicitly represented by a set of cubeswhich forms a minimum canonical cover. We obtain the minimum canonical cover starting from any initial cover and then derive the table covering problem. The method is effective; it improves on the runtime and memory usage of ESPRESSO-EXACT by average factors of 1.78 and 1.2x respectively on the 114 of 134 benchmark examples that could be completed by ESPRESSO-EXACT. Of the remaining 20 hard problems, we solve 14 exactly. For 3 of the remaining 6 we derive the covering table but the covering problem could not be solved exactly. The remaining 3 remains intractable for the moment. This research supported by Fujitsu Research y Department of Electrical Engineering and Computer Sciences, University of California Berkeley 1 Introduction..
    corecore