Abstract
In this thesis we propose the first optimum process scheduling algorithm for the fast becoming prevalent Heterogeneous multicore (HEMC) systems embedded with high-performance big cores and energy-efficient small cores of same instruction-set architecture (ISA). Existing algorithms are all heuristics-based and the well-known IPC-driven approach essentially tries to schedule high scaling factor processes on big cores. Our analysis shows that in fact it is also critical to consider placing long running processes on big cores for optimum solutions. Tests of SPEC 2006 cases on various big-small cores combinations show that the IPC-driven heuristic results can take up to 34% longer runtime than our optimum results. The complexity of our algorithm is O(NlogN) where N is the number of processes. Therefore the proposed optimum algorithm is practical for use.