As FPGA densities increase, partitioning-based FPGA placement approaches are becoming increasingly important as they can be used to provide high-quality and computationally scalable placement solutions. However, modern FPGA architectures incorporate heterogeneous resources, which place additional requirements on the partitioning algorithms because they now need to not only minimize the cut and balance the partitions, but also they must ensure that none of the resources in each partition is oversubscribed. In this paper, we present a number of multilevel multi-resource hypergraph partitioning algorithms that are guaranteed to produce solutions that balance the utilization of the different resources across the partitions. We evaluate our algorithms on twelve industrial benchmarks ranging in size from 5,236 to 140, 118 vertices and show that they achieve minimal degradation in the min-cut while balancing the various resources. Comparing the quality of the solution produced by some of our algorithms against that produced by hMETlS, we show that our algorithms are capable of balancing the different resources while incurring only a 3.3%-5.7% higher cut.
|Original language||English (US)|
|Number of pages||6|
|Journal||Proceedings - Design Automation Conference|
|State||Published - Jan 1 2004|
|Event||Proceedings of the 41st Design Automation Conference - San Diego, CA, United States|
Duration: Jun 7 2004 → Jun 11 2004