Abstract: In this paper, we discuss the problem of non-preemptively scheduling
independent multiprocessor tasks in a grid computing environment. Such a
scheduling problem in finding an optimal schedule is NP-hard. We thereby propose
the Higher Parallelism Earlier Assign (HPEA) scheduling algorithm, which is
simplified from the Multi-Organization Load BalancingAlgorithm(MOLBA), forsuch a problem. We use a simple way to show that the performance bound of
the HPEA algorithm is where Pis the total number of processors in the scheduling environment. The
derived performance bound of the HPEA algorithm is better than that of the MOLBA
algorithm.
