Online scheduling algorithm with reconfigurable resource management based on vertex position tree

In reconfigurable computing, more tasks could be executed in parallel on the limited hardware resources by time multiplexing. Finding the available start time and appropriate placement position for arrival tasks is the key point of online reconfigurable scheduling. In this paper, we introduce an online scheduling algorithm with reconfigurable resource management. Vertex position tree - a new date structure, and fragmentation shape edges - a simple and intuitive evaluating function etc. are introduced in resource management. Meanwhile, priority greedy scheduling policy is used for online tasks. Under the premise of reducing the complexity of space and time, the algorithm utilizes hardware resources more efficiently, and has higher tasks accept ratio shown by the simulation results.