Improved Cluster Merging by Preemption in Task Scheduling

摘要

Most static task scheduling algorithms schedule tasks in non-preemptive mode. Basic reason of such tendency is that preemption invokes overheads and it does not help to minimize its schedule length. We found that preemption helps to reduce the number of processors while the schedule length does not increase. We propose a task scheduling algorithm that applies task preemption. The basic process of the algorithm uses preemption when it merges tasks in two processors into one processor.