Recursive bi-partitioning of netlists for large number of partitions

Abstract

In many application in VLSI CAD, a given netlist has to be partitioned into smaller sub-designs which can be handled much better. In this paper we present a new recursive bi-partitioning algorithm that is especially applicable, if a large number of final partitions, e.g. more than 1000, has to be computed. The algorithm consists of two steps. Based on recursive splits the problem is divided into several sub-problems, but with increasing recursion depth more run time is invested. By this an initial solution is determined very fast. The core of the method is a second step, where a very powerful greedy algorithm is applied to refine the partitions. Experimental results are given that compare the new approach to state-of-the-art tools. The experiments show that the new approach outperforms the standard techniques with respect to run time and quality. Furthermore, the memory usage is very low and is reduced in comparison to other methods by more than a factor of four.

Hardware-Software Co-Visualization: Developing systems in the holodeck

“…Development kits such as the Unreal Development Kit 3 or the Unity Game Engine 4 can be used to create virtual worlds. While this software usually manages the organization of the actual world, the navigation of the character, and the interaction with virtual objects, the creation of 3D assets should be carried out using off-the-shelf 3D modeling software such as Blender 5 .…”

“…Approaches for hardware visualization differ depending on the abstraction level they are targeting. At lower abstraction levels the efficiency of the algorithms is a primary cost criteria [5]. Two-dimensional visualization techniques for SystemC models have been presented in [6] and [7] and follow the ideas for visualization at the register transfer level.…”

A Multiway Design-driven Partitioning Algorithm for Distributed Verilog Simulation

“…There are two kinds of multiway partitioning algorithms, a flat k-way partitioning [30] and a recursive multiway partitioning algorithm [31][32][33]. The recursive approach applies bi-partitioning recursively until the desired number of partitions is obtained, while the direct approach forsakes recursion.…”

On Grid Partitioning in AC Optimal Power Flow

“…Such an approach is called bi-partitioning, and recursive bi-partitioning can create a k-partitioning, but it is not a computationally efficient means of doing so [10]. While not computationally efficient, recursive bi-partitioning has been shown to make more efficient use of memory resources [11]. Some specialized partitioning methods have been developed for use in distributed optimal power flow, such as the spectral method of [9].…”