Opportunity Cost Model of the Task Scheduling in Heterogeneous Systems

With the micro-electronics technology has encountered a bottleneck, adding heterogeneous core has become the primary means of increasing processor speed. However, how to assign heterogeneous processor to maximize the performance becomes an urgent problem. The problem has been proved to be NP-complete problem, i.e. it cannot find the optimal solution in polynomial time. This article draws on the idea of the economy, given the concept of opportunity cost in heterogeneous systems, and were analyzed by the opportunity cost model for task scheduling on heterogeneous systems. On this basis, draw the basic principles of a number of task scheduling. Theory and simulation results show that the task assignment algorithm to achieve the desired performance.