基于多处理器嵌入式系统调度算法的研究

A Research on Scheduling Algorithms for a Multiprocessor Embedded System

本文浅析了在多处理器体系结构上的调度实时任务的各种不同方法。我们首先比较了这些不同的解决方案，然后描述了一种调度任务集的方法。该方法基于端对端的任务调度，考虑任务间的线性优先约束以及任务对资源的需求。同时．这种调度方法的另外一个目的是尽量减少处理器间的通信代价。这个模型也考虑了不同处理器之间的不同通信带宽以及各种处理器拥有不同的处理性能。

In this thesis we look into different methods of scheduling real-time tasks on a multiprocessor architecture.First we compare different approaches and then we describe a way to schedule task sets. The method is based on end-to-end scheduling and takes linear precedence constraints between tasks into account,as well as resource requirements of tasks,with an additional goal of trying to minimize communication costs between processors.Different communication bandwidth between different processors is taken into account by this model,and the processors having different processing power has also been considered.