抄録
Task Scheduling is key for high speed processing with a multiprocessor system. Scheduler should take consider in not only task size but also communication overhead. Effect of communication overhead is not constant. If a task is smaller than others, communication over head has more effective to this task than to others. By the way, traditional scheduling algorithm uses idle processors aggressively when idle processors exist. It increases communication between processors, and then finally processing time with multiprocessor overcomes processing time with single processor.
In this paper, we propose new task scheduling algorithm. This algorithm is improved version of CP/RCO. This can consider relative relation between task size and communication overhead, and also pending allocation if other busy processor to execute task faster exists. We present that our proposed algorithm is more efficient than traditional algorihtms, and that computaion complexity of our algorithm is O (mn2).
