硬件任务的软实时调度是影响动态可重构系统性能的关键因素之一。本文提出了一种基于顶点链表的硬件任务间最小空间调度算法MSSA，该算法将硬件任务按照长、宽及调度时间构成一个三维资源模型，以到达任务与已放置任务在三维空间的邻接度来构建代价函数，获取具有最大代价函数值的放置位置和启动时间，可使任务安排得更紧凑，减小对系统资源的浪费，提高并行度。仿真实验表明，与MSG4V和Stuffing算法相比，本文算法具有更高的芯片利用率和任务接受率。

Soft realtime scheduling of the hardware tasks is one of the key factors which affect the performance of dynamic reconfigurable systems. This paper presents a scheduling algorithm MSSA (minimun space scheduling algorithm) based on the minimum space between the hardware tasks of the vertex list. The algorithm constitutes a threedimensional resources model according to the length,width and the activation time to reach the adjacent degree of the task and the task placed in the threedimensional space to construct the cost function, which obtains the place position and the start time of the greatest value of the cost function and enables the task scheduling even more compact, reducing the waste of the system resources to improve the degree of parallelism.The simulation results show that this algorithm has a higher chip utilization and acceptance rate of tasks compared with the MSG4V algorithm and the Stuffing algorithm.