Abstract

AbstractThe partially reconfigurable hardware devices are commonly used in real-time systems; these devices feature a high density of heterogeneous resources to enable multitasking and supply a reasonable flexibility with regard to application requirements. As a result, efficient management of hardware tasks and hardware resources is absolutely essential. Scheduling and placement methods suffer, however, from the issues of resource waste, task rejection and configuration overheads. This paper focuses on a new three-level placement strategy of hardware tasks on these prominent devices and aims at optimized use of the resources to target all the mentioned issues. Two complete methods are proposed in this chapter to efficiently solve the issue of reconfigurable area management. Experiments demonstrate improvement of up to 36% in resource utilization over the available reconfigurable resources, 43% in resource gain as compared to static implementation, and an overall configuration overhead of 11% from the total application running time.KeywordsPlacement ProblemGood NodePartial ReconfigurationEmpty RectangleDynamic Partial ReconfigurationThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

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 call

Disclaimer: 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.