The Task Assignment And Algorithm Research On A Heterogeneous Multi-Core Processor

With the IC process technology development, the performance of heterogeneous multi-core processors will be multiplied .It is clear that the original system-level problems will be introduced to the processor inside, for example task scheduling assignment. For the multi-core processor, optimize the operating system task scheduling algorithm is key to ensure efficiency of the multi-core processor. Multi-core processors, including heterogeneous multi-core processor and homogeneous multi-core processor, compared to homogeneous multi-core processor, the performance of heterogeneous will be more prominent, task scheduling the allocation of heterogeneous multi-core processor will be more complex. The task scheduling allocation problem of multi-core processors has not yet mature in this field, so researchers has studied by different way. In this paper, heterogeneous multi-core processors, the algorithms of task scheduling have been studied and improved, and compare it with a static task allocation algorithm and Round - Robin method.This algorithm mainly consists of two steps: First, according to the frequency of communication between threads to allocation. Second, according to the runtime behavior to decide the allocation of the other threads that have containing similar proportions of instruction type . At present, assigned the task to processor will appear on two types overhead: the overhead of the implementation of tasks, as well as the communication overhead between the processor. The first step in this algorithm is a better solution for the communication overhead of inter-processor. Because the same processor share the same address space between threads, but address space of thread between the different processes is independent each other. For the heterogeneous multi- core processors, the communication of the processor cores by the mail- box, if we assigned the threads of frequent communication to the same processor core as far as possible, so it can reduce the communication overhead. The second step, improve the utilization of processors.In this paper, our experimentation is using the M5 Simulator System to test the algorithm and rotation method, the static task scheduling algorithm. This structure of the heterogeneous multi-core processors is 5Alpha21164 and 3 Alpha 21- 264 , Using the SPEC2000 benchmark suite have five integer (gcc, gzip, bzip2, parser, crafty), seven floating-point (equake, galgel, lucas, wupwise, mgrid, swim, mmp). We use the number of instructions by dividing the whole execution time. From the test, we can see this algorithm performance than the Round-Robin increase by 3.4%...