Improving utilization of reconfigurable resources using two dimensional compaction

ABSTRACT

Partial reconfiguration allows parts of the reconfigurable chip area to be configured without affecting the rest of the chip. This allows placement of tasks at run time on the reconfigurable chip. Area management is a very important issue which highly affect the utilization of the chip and hence the performance.

This paper focuses on a major aspect of moving running tasks to free space for new incoming tasks (compaction). We study the effect of compacting running tasks to free more contiguous space on the system performance. First, we introduce a straightforward compaction strategy called Blind compaction. We use its performance as a reference to measure the performance of other compaction algorithms. Then we propose a two-dimensional compaction algorithm called one-corner compaction. This algorithm runs with respect to one chip corner. We further extend this algorithm to the four corners of the chip and introduce the 4-corner compaction algorithm. Finally, we compare the performance of these algorithms with some existing compaction strategies [3]. The simulation results show improvement in average task allocation time when using the 4-corner compaction algorithm by 15% and in chip utilization by 16% over the Blind compaction. These results outperform the existing strategies.

References

1. Manuel G. Gericota, Gustavo R. Alves, Miguel L. Silva, José M. Ferreira, "On-line Defragmentation for Run-Time Partially Reconfigurable FPGAs", FPL 2002, LNCS 2438, pp. 302--311, 2002.
2. Manuel G. Gericota, Gustavo R. Alves, Miguel L. Silva, José M. Ferreira, "Run-Time Management of Logic Resources on Reconfigurable Systems", In Proceedings of the Design, Automation and Test in Europe 2003 Conference and Exhibition (DATE'2003), Munich, Germany, March 2003, pp. 974--979.
3. O. Diessel, H. ElGindy, M. Middendorf, H. Schmeck, and B. Schmidt, "Dynamic scheduling of tasks on partially reconfigurable FPGAs". In IEEE Proceedings on Computers and Digital Techniques, volume 147, pages 181--188, May 2000.
4. Sandor P. Fekete, and Jorg Schepers. "A Combinatorial Characterization of Higher-Dimensional Orthogonal Packing". In Mathematics of Operations Research, Volume 29: 353--368 (2004).
5. Kiarash Bazargan, Ryan Kastner, and Majid Sarrafzadeh. "Fast Template Placement for Reconfigurable Computing Systems". In IEEE Design and Test of Computers, volume 17, pages 68--83, 2000.
6. H. Walder, C. Steiger, and M. Platzner, "Fast Online Task Placement on FPGAs: Free Space Partitioning and 2D-Hashing", International Parallel and Distributed Processing Symposium, April 2003.
7. M. Handa and R. Vemuri, "An Efficient Algorithm for Finding Empty Space for Online FPGA Placement", Design Automation Conference, San Diego, CA, June 2004, pp. 960--965.
8. Katherine Compton, James Cooley, Stephen Knol, and Scott Hauck. "Configuration Relocation and Defragmentation for Reconfigurable Computing". In Proceedings of the IEEE Symposium on FPGAs for Custom Computing Machines (FCCM). IEEE CS Press, April 2001.
9. H. Kalte, M. Koester, B. Kettelhoit, M. Porrmann and U. Rückert "A Comparative Study on System Approaches for Partially Reconfigurable Architectures". Engineering of Reconfigurable Systems and Algorithms (ERSA06).