Age based scheduling for asymmetric multiprocessors

Asymmetric (or Heterogeneous) Multiprocessors 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 Multiprocessors is still a challenging problem. Scheduling algorithms for Asymmetric Multiprocessors must not only be aware of asymmetry in processor performance, but have to consider the characteristics of application threads also. In this paper, we propose a new scheduling policy, Age based scheduling, that assigns a thread with a larger remaining execution time to a fast core. Age based scheduling predicts the remaining execution time of threads based on their age, i.e., when the threads were created. These predictions are based on the insight that most threads that are created together tend to have similar execution durations. Using Age based scheduling, we improve the overall performance of several important multithreaded applications inc...

• Type: Conference
• Year: 2009
• Where: SC
• Authors: Nagesh B. Lakshminarayana, Jaekyu Lee, Hyesoon Kim
• Keywords: Age Based Scheduling, Applied Computing, Asymmetric Multiprocessor, SC 2009, Scheduling Policy