Abstract: This paper proposes a new scheduling algorithm which can reduce the unnecessary migration and context switching overhead. In this method, each real-time cycle task is proportionally executed on different processor cores, and the priority of task scheduling is specified, and then the real-time cycle tasks are scheduled according to the corresponding real-time scheduling process. By comparing with EDF-os and EDF-fm, which have been considered as set scheduling algorithms of high utilization rate, the experiments show this method not only can ensure high utilization rate but also reduce the times of migrating tasks and context switching overhead.