Title :
A New Approach to Online FPGA Placement
Author :
Tomono, Mitsuru ; Nakanishi, Masaki ; Yamashita, Shigeru ; Nakajima, Kazuo ; Watanabe, K.
Author_Institution :
Graduate Sch. of Inf. Sci., Nara Inst. of Sci. & Technol.
Abstract :
In a partially reconfigurable FPGA, arbitrary portions of its logic resources and interconnection networks can be reconfigured without affecting the other parts. Thus, several tasks can be mapped and executed concurrently in the FPGA. In order to execute the tasks efficiently using the limited resources of the FPGA, resource management becomes very important. Although some online FPGA placement methods have, recently, been proposed, they cannot handle I/O communications of the tasks. Taking such I/O communications into consideration, we introduce a new approach to online FPGA placement. We present a task placement algorithm which uses I/O routing information of each empty area to select a suitable area for each task. The algorithm uses a combination of two new fitting strategies and modified versions of two existing strategies.
Keywords :
field programmable gate arrays; telecommunication network management; telecommunication network routing; I-O routing information; field programmable gate array; interconnection network; online FPGA placement; resource management; task placement algorithm; Educational institutions; Field programmable gate arrays; Fitting; Hardware; Information science; Multiprocessor interconnection networks; Partitioning algorithms; Reconfigurable logic; Resource management; Routing;
Conference_Titel :
Information Sciences and Systems, 2006 40th Annual Conference on
Conference_Location :
Princeton, NJ
Print_ISBN :
1-4244-0349-9
Electronic_ISBN :
1-4244-0350-2
DOI :
10.1109/CISS.2006.286451