A new scheduling strategy for NUMA multiprocessor systems

This study examined the impact of multiprocessor scheduling strategies on the performances of non-uniform memory access (NUMA) shared-memory multiprocessor systems. A new scheduling algorithm named the Longest Extended Critical Path First (LECPF) algorithm is proposed here. The proposed algorithm schedules parallel tasks by considering complex communication options and the contentions of shared communication resources. It also ensures performance within a factor of two of the optimum for general directed acyclic task graphs (DATGs). Experimental results show the superiority of the LECPF algorithm over that of scheduling algorithms in the literature