Adaptive Free Space Management of Online Placement for Reconfigurable Systems

The FPGA can be reconfigured both dynamically and partially. Such reconfigurable FPGA allows several tasks to be executed, placed and removed at the runtime. Therefore, the hardware resources management in FPGA on the online placement becomes very important. Most techniques for finding empty space are based on rectangle. In this paper, we propose an adaptive free space management for finding candidate space with rectangular or nonrectangular to place newly arriving tasks. The adaptive free space management uses two procedures to find all feasible candidate space for arriving tasks, namely C-Look and CSAF. Experiment results show that the proposed method reduces 76.49% in rejection rate, 68.12% in total task execution time, and 76.32% in total task waiting time.

[1]  Oscar Castillo,et al.  Proceedings of the International MultiConference of Engineers and Computer Scientists 2007, IMECS 2007, March 21-23, 2007, Hong Kong, China , 2007, IMECS.

[2]  S.I. Shaheen,et al.  Fragmentation Aware Placement in Reconfigurable Devices , 2006, 2006 6th International Workshop on System on Chip for Real Time Applications.

[3]  Jürgen Teich,et al.  Offline and Online Aspects of Defragmenting the Module Layout of a Partially Reconfigurable Device , 2005, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[4]  S. Noda,et al.  Fire detection in tunnels using an image processing method , 1994, Proceedings of VNIS'94 - 1994 Vehicle Navigation and Information Systems Conference.

[5]  Anju Vyas.  Print , 2003 .

[6]  Marco Platzner,et al.  Online scheduling for block-partitioned reconfigurable devices , 2003, 2003 Design, Automation and Test in Europe Conference and Exhibition.

[7]  M. Esmaeildoust,et al.  Fragmentation aware placement algorithm for a reconfigurable system , 2008, 2008 Second International Conference on Electrical Engineering.

[8]  Jun'ichi Yamaguchi,et al.  A contour fluctuation data processing method for fire flame detection using a color camera , 2000, 2000 26th Annual Conference of the IEEE Industrial Electronics Society. IECON 2000. 2000 IEEE International Conference on Industrial Electronics, Control and Instrumentation. 21st Century Technologies.

[9]  D. Rubin,et al.  Maximum likelihood from incomplete data via the EM - algorithm plus discussions on the paper , 1977 .

[10]  Fernando Gehm Moraes,et al.  Remote and partial reconfiguration of FPGAs: tools and trends , 2003, Proceedings International Parallel and Distributed Processing Symposium.

[11]  W. Eric L. Grimson,et al.  Learning Patterns of Activity Using Real-Time Tracking , 2000, IEEE Trans. Pattern Anal. Mach. Intell..

[12]  Glenn Healey,et al.  A system for real-time fire detection , 1993, Proceedings of IEEE Conference on Computer Vision and Pattern Recognition.

[13]  J. Yamaguchi,et al.  Fire flame detection algorithm using a color camera , 1999, MHS'99. Proceedings of 1999 International Symposium on Micromechatronics and Human Science (Cat. No.99TH8478).

[14]  Jürgen Teich,et al.  Optimal Routing-Conscious Dynamic Placement for Reconfigurable Devices , 2004, FPL.

[15]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[16]  Ioannis Pavlidis,et al.  Urban surveillance systems: from the laboratory to the commercial world , 2001, Proc. IEEE.

[17]  Majid Sarrafzadeh,et al.  Fast Template Placement for Reconfigurable Computing Systems , 2000, IEEE Des. Test Comput..

[18]  I. Xilinx.  Virtex series configuration architecture user guide , 2000 .

[19]  Ali Ahmadinia.  Optimal Free-Space Management and Routing-Conscious Dynamic Placement for Reconfigurable Devices , 2007, IEEE Transactions on Computers.

[20]  Jürgen Teich,et al.  Speeding up Online Placement for XILINX FPGAs by Reducing Configuration Overhead , 2003, VLSI-SOC.

[21]  Reinhard Männer,et al.  Preemptive multitasking on FPGAs , 2000, Proceedings 2000 IEEE Symposium on Field-Programmable Custom Computing Machines (Cat. No.PR00871).

[22]  M. Y. Javed,et al.  Simulation and performance comparison of four disk scheduling algorithms , 2000, 2000 TENCON Proceedings. Intelligent Systems and Technologies for the New Millennium (Cat. No.00CH37119).

[23]  Marco Platzner,et al.  Fast online task placement on FPGAs: free space partitioning and 2D-hashing , 2003, Proceedings International Parallel and Distributed Processing Symposium.

[24]  Franco P. Preparata,et al.  Finding the Contour of a Union of Iso-Oriented Rectangles , 1980, J. Algorithms.

[25]  Ralf Hartmut Güting,et al.  An Optimal Contour Algorithm for Iso-Oriented Rectangles , 1984, J. Algorithms.