Abstract
Hardware/software partition is a crucial point in the design of a reconfigurable embedded system. Reconfigurable computing is a promising approach to overcome the traditional trade-off between flexibility and performance in the design of computer architectures which adapt their hardware to each application to achieve a high performance of dedicated hardware. In this paper, some hardware and software partitioning algorithms were analyzed and summarized first, then a innovative algorithm for task partition and scheduling is proposed based on new features of reconfigurable hardware such as dynamic reconfiguration and the delay of reconfiguration. In the proposed algorithm, a large-scale application is decomposed into multiple sub-tasks of suitable granularity and each sub-task has constraint relationship with each other. And a directed acyclic graph (DAG) which presents the relationship between tasks was drawn according to the execution order of tasks. Then the specific application presented in the DAG is mapped to the hardware and software platform by a strategy called GATS which combine the Genetic Algorithm and the Tabu Search algorithm together. The shortest time of assignment and task execution order can be found by the priority-based scheduling method. The experimental results show that the method is of high performance and can effectively mapping the application task to the reconfigurable system.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have