A Fast Online Task Placement Algorithm for Three-Dimensional Dynamic Partial Reconfigurable Devices

Three-dimensional (3D) integration technology provides a great opportunity for reconfigurable devices to increase device performance. Nevertheless, there is no efficient data structure and task placement algorithm to manage 3D dynamic partial reconfigurable (DPR) resources in literature. Inefficient algorithms limit the performance of 3D DPR devices. This study addresses the issue of the 3D task placement problem via a novel data structure named Maximal Empty Cuboid (MEC) list, which is proposed to manage the unoccupied space on the 3D DPR device. No matter if a task is assigned or removed on the device, the MEC list is updated in real-time to record 3D unoccupied resources so that the online task placement can be executed in a shorter time. Experiments are carried out to evaluate the performance of the proposed task placement algorithm, and results demonstrate that the proposed algorithm can make a reduction of at least 39% in terms of the task rejection ratio verifying the algorithm’s efficiency.

[1]  Zied Marrakchi,et al.  An Overview of Three-Dimensional Integration and FPGAs , 2015 .

[2]  Katsuyuki Sakuma,et al.  3D Integration in VLSI Circuits Implementation Technologies and Applications , 2019 .

[3]  Kia Bazargan,et al.  Three-dimensional place and route for FPGAs , 2005, Proceedings of the ASP-DAC 2005. Asia and South Pacific Design Automation Conference, 2005..

[4]  Thomas C. Shermer,et al.  On representations of some thickness-two graphs , 1995, Comput. Geom..

[5]  Abdellatif Mtibaa,et al.  Exploring the temporal placement for partially reconfigurable device , 2011, 2011 International Conference on Communications, Computing and Control Applications (CCCA).

[6]  Scott Hauck,et al.  Reconfigurable computing: a survey of systems and software , 2002, CSUR.

[7]  Hortensia Mecha,et al.  A vertex-list approach to 2D HW multitasking management in RTR FPGAs , 2003 .

[8]  Takahiro Watanabe,et al.  A fast online task placement algorithm on 3D partially reconfigurable devices , 2017, TENCON 2017 - 2017 IEEE Region 10 Conference.

[9]  Takahiro Watanabe,et al.  A Fast MER Enumeration Algorithm for Online Task Placement on Reconfigurable FPGAs , 2016, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

[10]  Hortensia Mecha,et al.  A Low Fragmentation Heuristic for Task Placement in 2D RTR HW Management , 2004, FPL.

[11]  K. Saban Xilinx Stacked Silicon Interconnect Technology Delivers Breakthrough FPGA Capacity , Bandwidth , and Power Efficiency , 2009 .

[12]  Stephen K. Wismath,et al.  Characterizing bar line-of-sight graphs , 1985, SCG '85.

[13]  Weidong Xu,et al.  Rothko: A Three-Dimensional FPGA , 1998, IEEE Des. Test Comput..

[14]  Ranga Vemuri,et al.  An efficient algorithm for finding empty space for online FPGA placement , 2004, Proceedings. 41st Design Automation Conference, 2004..

[15]  Koen Bertels,et al.  A novel fast online placement algorithm on 2D partially reconfigurable devices , 2009, 2009 International Conference on Field-Programmable Technology.

[16]  David G. Kirkpatrick,et al.  Weighted Visibility Graphs of Bars and Related Flow Problems (Extended Abstract) , 1989, WADS.

[17]  Tughrul Arslan,et al.  Empty Resource Compaction Algorithms for Real-Time Hardware Tasks Placement on Partially Reconfigurable FPGAs Subject to Fault Ocurrence , 2011, 2011 International Conference on Reconfigurable Computing and FPGAs.

[18]  John E. Karro,et al.  Three-dimensional field-programmable gate arrays , 1995, Proceedings of Eighth International Application Specific Integrated Circuits Conference.

[19]  Tulika Mitra,et al.  A novel online hardware task scheduling and placement algorithm for 3D partially reconfigurable FPGAs , 2011, 2011 International Conference on Field-Programmable Technology.

[20]  Anantha Chandrakasan,et al.  Wiring requirement and three-dimensional integration technology for field programmable gate arrays , 2003, IEEE Trans. Very Large Scale Integr. Syst..

[21]  Weichen Liu,et al.  An Efficient Algorithm for Online Soft Real-Time Task Placement on Reconfigurable Hardware Devices , 2007, 10th IEEE International Symposium on Object and Component-Oriented Real-Time Distributed Computing (ISORC'07).

[22]  Zied Marrakchi,et al.  Three-Dimensional Design Methodologies for Tree-based FPGA Architecture , 2015, Lecture Notes in Electrical Engineering.

[23]  Miriam Leeser,et al.  Design and analysis of a dynamically reconfigurable three-dimensional FPGA , 2001, IEEE Trans. Very Large Scale Integr. Syst..