HITSM: A Heuristic Algorithm for Independent Task Scheduling in Multicore

Nowadays, multicore is widely used in servers which are shared by many users. Besides the tasks submitted by different users are usually data-independent. However, the existing scheduling algorithms for multicore always take data dependence into consideration which limit the performance of multicore. As a consequence, we propose a heuristic algorithm called HITSM for independent task scheduling in multicore. In the proposed HITSM, we take makespan and load balancing into consideration. The experiment results demonstrate that, compared to First Come First service (FCFS) and Min-min algorithm, the proposed HITSM respectively reduces the makespan by 9.4% and 6.8%, and separately increases the performance on load balancing by 27.6 and 25.2 times on the heterogeneous cores.