Abstract: Task schedule problem arises in many fields of science and engineering. It can be parallelized in master-worker fashion and relevant scheduling strategies have been proposed to reduce application makespan. By imposing the restriction that equal sized chun

Key words: Divisible task,Task schedule,One round algorithm, Multi-round algorithm, Make-span