Defragmenting the Module Layout of a Partially Reconfigurable Device
Jan van der Veen, Sandor P. Fekete, Ali Ahmadinia, Christophe Bobda, Frank Hannig, Juergen Teich
Abstract
Modern generations of field-programmable gate arrays (FPGAs) allow for partial reconfiguration. In an online context, where the sequence of modules to be loaded on the FPGA is unknown beforehand, repeated insertion and deletion of modules leads to progressive fragmentation of the available space, making defragmentation an important issue. We address this problem by propose an online and an offline component for the defragmentation of the available space. We consider defragmenting the module layout on a reconfigurable device. This corresponds to solving a two-dimensional strip packing problem. Problems of this type are NP-hard in the strong sense, and previous algorithmic results are rather limited. Based on a graph-theoretic characterization of feasible packings, we develop a method that can solve two-dimensional defragmentation instances of practical size to optimality. Our approach is validated for a set of benchmark instances.
Create a lesson
Related papers
Evaluating Positive Feedback Adiabatic Logic in 16nm FinFET with a Realistic Power-Clock
Franciszek Łukowski, Maciej Pyrzowski, Aida Todri-Sanial
Evaluation of Power-Clock Waveforms for Positive Feedback Adiabatic Logic in 16 nm FinFET Technology
Maciej Szymon Pyrzowski, Franciszek Łukowski, Aida Todri-Sanial
High-frequency Multispeculative Multiply-Accumulation Unit for Fused Posit Arithmetic
Mario Alonso, Miguel Ángel Sacristán, Guillermo Botella et al.
MiX: Micro-Inverted-Scaling for End-to-End Low-Bit Vision-Language Model Acceleration
Yuan Liao, Jae-sun Seo
MeshKV: A Network-on-Chip KV Cache Fabric for Scalable Transformer Decoding Accelerators
Dong Liu, Yanxuan Yu
Epic: Efficient Programming Paradigm for In-Storage Computing
Yuyue Wang, Zhenyu Zhang, Glenn Reinman et al.