An efficient scheduling methodology for heterogeneous multi-core processor systems

Abstract

This paper outlines a scheduling methodology for signal processing applications onto heterogeneous multiprocessor systems. The goal is to efficiently schedule an application in the form of direct acyclic graphs (DAG), onto a heterogeneous processor environment. The solution is to use a variety of optimization techniques based on greedy methods and meta-heuristic methods to solve the problem. Results obtained indicate that the system is efficient in placing tasks to create an optimal schedule.