An FPGA Task Placement Algorithm Using Reflected Binary Gray Space Filling Curve
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 ha...
Saved in:
| Main Authors: | Senoj Joseph Olakkenghil, K. Baskaran |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2014-01-01
|
| Series: | International Journal of Reconfigurable Computing |
| Online Access: | http://dx.doi.org/10.1155/2014/495080 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
A simple algorithm for computing a multi-dimensional the Sierpiński space-filling curve generalization
by: Ewa Skubalska-Rafajłowicz
Published: (2023-10-01) -
Improved throughput of Elliptic Curve Digital Signature Algorithm (ECDSA) processor implementation over Koblitz curve k-163 on Field Programmable Gate Array (FPGA)
by: Firas Ghanim Tawfeeq, et al.
Published: (2020-09-01) -
WOAIP: Wireless Optimization Algorithm for Indoor Placement Based on Binary Particle Swarm Optimization (BPSO)
by: Omar S. Naif, et al.
Published: (2022-06-01) -
Explorative Binary Gray Wolf Optimizer with Quadratic Interpolation for Feature Selection
by: Yijie Zhang, et al.
Published: (2024-10-01) -
Next-generation ECC processor on FPGA: Leveraging Koblitz curves for enhanced performance
by: Tung Nguyen, et al.
Published: (2025-09-01)