Skip to Main Content
There has been a number of algorithms designed to handle intra-query or inter-query scheduling in multiprocessor-based parallel database system. They all have the assumption that the processors are identical. But in some cases, such as shared nothing environment, this assumption would not be fully valid. In this paper we devise and evaluate a scheduling algorithm ELLIST to handle nonprecedence-based heterogeneous malleable scheduling problem. It uses LLIST_NM as subroutine that handles nonmalleable scheduling without precedence and assuming the processors are identical. Even though the problem we considered is NP-hard in the strong sense, the schedule generated by our algorithm is seen experimentally to achieve results that are close to optimum when there are enough tasks to be scheduled.