Age Based Scheduling for Asymmetric Multiprocessors

Provided by: Association for Computing Machinery
Topic: Hardware
Format: PDF
Asymmetric (or heterogeneous) multi-processors are becoming popular in the current era of multi-cores due to their power efficiency and potential performance and energy efficiency. However, scheduling of multithreaded applications in asymmetric multi-processors is still a challenging problem. Scheduling algorithms for asymmetric multi-processors must not only be aware of asymmetry in processor performance, but have to consider the characteristics of application threads also. In this paper, the authors propose a new scheduling policy, age based scheduling, and that assigns a thread with a larger remaining execution time to a fast core.

Find By Topic