The management of reconfigurable resource is one of the most critical factors concerned deeply with the performance of dynamic reconfigurable systems.This paper presents two associated algorithms

KTVP (Keeping Tasks Vertexes for Placement) and KTVS (Keeping Tasks Vertexes for Scheduling)

to maximize the system utilization.These two algorithms arrange the new-coming hardware tasks according to the vertexes' information of the already running tasks.By exploiting a novel encoding scheme

they can validate the feasibility of the scheduling/placement in a fast way

so as to effectively reduce the waste of resource and improve the parallelism of the whole system.The simulation results show that

compared with existent algorithms

KTVP/KTVS can achieve lower task rejection ratio and reduce the execution overhead significantly.