Abstract
In reconfigurable system, hardware task placement algorithms are trying to find rectangle of available reconfigurable logic units in a fast manner. Furthermore, low cost and less fragmentation are another two metrics of high performance algorithm. In previous work we proposed a Transformable Vertexes Information based Algorithm (TVIA) for online task placement in reconfigurable system. In this paper, based on TVIA, we adopt Resource Swap scheme for reuse based hardware task scheduling. Hardware tasks will remain in the reconfigurable device after execution. Only when there is no enough space left for incoming tasks will previous tasks been swapped out from configurable device. This paper discusses the principle and procedure of resource swap management and compares several algorithms using simulation.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
