scholarly journals An FPGA Task Placement Algorithm Using Reflected Binary Gray Space Filling Curve

2014 ◽  
Vol 2014 ◽  
pp. 1-7 ◽  
Author(s):  
Senoj Joseph Olakkenghil ◽  
K. Baskaran
Keyword(s):  
Search Algorithm ◽  
Space Filling ◽  
New Approach ◽  
Space Filling Curve ◽  
Reconfigurable Devices ◽  
Placement Algorithm ◽  
Filling Curve ◽  
Task Placement ◽  
Online Placement ◽  
Best Fit

With the arrival of partial reconfiguration technology, modern FPGAs support tasks that can be loaded in (removed from) the FPGA individually without interrupting other tasks already running on the same FPGA. Many online task placement algorithms designed for such partially reconfigurable systems have been proposed to provide efficient and fast task placement. A new approach for online placement of modules on reconfigurable devices, by managing the free space using a run-length based representation. This representation allows the algorithm to insert or delete tasks quickly and also to calculate the fragmentation easily. In the proposed FPGA model, the CLBs are numbered according to reflected binary gray space filling curve model. The search algorithm will quickly identify a placement for the incoming task based on first fit mode or a fragmentation aware best fit mode. Simulation experiments indicate that the proposed techniques result in a low ratio of task rejection and high FPGA utilization compared to existing techniques.

ROUTING AWARE PLACEMENT ALGORITHM AND EFFICIENT FREE SPACE MANAGEMENT FOR RECONFIGURABLE SYSTEMS

2010 ◽  
Vol 19 (06) ◽  
pp. 1217-1234
Author(s):  
MOHAMMAD ESMAEILDOUST ◽  
ALI ZAKEROLHOSSEINI
Keyword(s):  
Routing Algorithm ◽  
Communication Channels ◽  
Parallel Execution ◽  
Effective Management ◽  
New Approach ◽  
Space Management ◽  
Reconfigurable Devices ◽  
Placement Algorithm ◽  
Task Placement

In partially reconfigurable devices like FPGA, logic resources and communication channels can be reconfigured without affecting other section of the device. This allows parallel execution of multiple tasks on a FPGA. Due to limited resources on a FPGA, an effective management for efficient execution of tasks is required. We present a new approach for management of FPGA logic resources and also communication channels in an online task placement. The approach creates communication channels between the tasks and also tasks with I/O elements without requiring extra computation overhead. We present a fast algorithm for searching MERs for management of FPGA space. Then, we present a exact routing algorithm to find distance and create exact path between two set of tasks. A new fitting strategy based on the rate of communication between the tasks is also presented. The results indicate the proposed strategy and also its combination with some other known strategies can improve the quality of placement.

scholarly journals An Efficient Algorithm for On-line Placement of Partially Reconfigurable Devices

2015 ◽  
pp. 310-314
Author(s):  
U.Lenin Marksia ◽  
S. Darwin
Keyword(s):  
Efficient Algorithm ◽  
Time Axis ◽  
Reconfigurable Devices ◽  
Line Placement ◽  
On Line ◽  
Future Task ◽  
Complete Set ◽  
Placement Algorithm ◽  
Task Placement ◽  
Online Placement

Partial Runtime Reconfigurable (PRTR) FPGAs allow HW tasks to be placed and removed dynamically at runtime. We make two contributions in this paper. First, we present an efficient algorithm for finding the complete set of Maximal Empty Rectangles on a 2D PRTR FPGA, which is useful for online placement and scheduling of HW tasks. The algorithm is incremental and only updates the local region affected by each task addition or removal event. Second, we present an efficient online deadline-constrained task placement algorithm for minimizing area fragmentation on the FPGA by using an area fragmentation metric that takes into account probability distribution of sizes of future task arrivals as well as the time axis. The techniques presented in this paper are useful in an operating system for runtime reconfigurable FPGAs to manage the HW resources on the FPGA when HW tasks that arrive and finish dynamically at runtime. Online placement methods are required that achieve a high placement quality and lead to efficient implementation.

Region of Interest Based MRI Brain Image Compression Using Peano Space Filling Curve

2016 ◽  
Vol 11 (2) ◽  
pp. 114-120 ◽  
Author(s):  
C. Peter Devadoss ◽  
Balasubramanian Sankaragomathi ◽  
Thirugnanasambantham Monica
Keyword(s):  
Image Compression ◽  
Region Of Interest ◽  
Space Filling ◽  
Brain Image ◽  
Space Filling Curve ◽  
Mri Brain ◽  
Filling Curve ◽  
Mri Brain Image

A Space Filling Curve

1983 ◽  
Vol 90 (4) ◽  
pp. 283
Author(s):  
Liu Wen
Keyword(s):  
Space Filling ◽  
Space Filling Curve ◽  
Filling Curve

scholarly journals Enhancing Quad Tree for Spatial Index Using Space Filling Curves

2020 ◽  
Vol 38 (1B) ◽  
pp. 15-25
Author(s):  
Ali A. Hussain ◽  
Rehab F. Hassan
Keyword(s):  
Spatial Databases ◽  
Space Filling ◽  
Space Filling Curve ◽  
Effective Implementation ◽  
Quad Tree ◽  
Implementation Time ◽  
Spatial Indexes ◽  
Space Requirements ◽  
Filling Curve ◽  
And Storage

Spatial indexes, such as those based on the Quad Tree, are important in spatial databases for the effective implementation of queries with spatial constraints, especially when queries involve spatial links. The quaternary trees are a very interesting subject, given the fact that they give the ability to solve problems in a way that focuses only on the important areas with the highest density of information. Nevertheless, it is not without the disadvantages because the search process in the quad tree suffers from the problem of repetition when reaching the terminal node and return to the behavior of another way in the search and lead to the absorption of large amounts of time and storage. In this paper, the quad tree was improved by combining it with one of the space filling curve types, resulting in reduced storage space requirements and improved implementation time

Sign in / Sign up

Export Citation Format

Share Document