An efficient and comprehensive scheduler on Asymmetric Multicore Architecture systems

  • Authors:
  • Jiun-Hung Ding;Ya-Ting Chang;Zhou-Dong Guo;Kuan-Ching Li;Yeh-Ching Chung

  • Affiliations:
  • Dept. of Computer Science, National Tsing Hua University, Taiwan;Dept. of Computer Science, National Tsing Hua University, Taiwan;Dept. of Computer Science, National Tsing Hua University, Taiwan;Dept. of Computer Science and Information Engineering, Providence University, Taiwan;Dept. of Computer Science, National Tsing Hua University, Taiwan

  • Venue:
  • Journal of Systems Architecture: the EUROMICRO Journal
  • Year:
  • 2014

Quantified Score

Hi-index 0.00

Visualization

Abstract

Several studies have shown that Asymmetric Multicore Processors (AMPs) systems, which are composed of processors with different hardware characteristics, present better performance and power when compared to homogeneous systems. With Moore's law behavior still lasting, core-count growth creates typical non-uniform memory accesses (NUMA). Existing schedulers assume that the underlying architecture is homogeneous, and as consequence, they may not be well suited for AMP and NUMA systems, since they, respectively, do not properly explore hardware elements asymmetry, while improving memory utilization by avoid multi-processes data starvation. In this paper we propose a new scheduler, namely NUMA-aware Scheduler, to accommodate the next generation of AMP architectures in terms of architecture asymmetry and processes starvation. Experimental results show that the average speedup is 1.36 times faster than default Linux scheduler through evaluation using PARSEC benchmarks, demonstrating that the proposed technique is promising when compared to other prior studies.