Scheduling applications on multi-processor is an effective core technology in using distributed systems. Task scheduling is to map applications to parallel system in order to minimize the makespan. Task scheduling is classified into static scheduling and dynamic scheduling. Most task scheduling is NP-complete problem. The authors come up with a new scheduling algorithm: Chunking Splicing Algorithm...Show More
Task Scheduling for parallel computing is a process to map the application to the multi-processors while minimize the execution time. Task scheduling is classified into static scheduling and dynamic scheduling. List scheduling is a class of static heuristic based scheduling algorithms with low complexity and good performance. Based on the principle of list scheduling algorithm with limited numbers...Show More
