In this article a task scheduling algorithm for parallel logic programming systems and its im-plementation in an And-Parallel prolog system are described. This algorithm schedules under centralized control all of the parallel subtasks which are created during the exeution of a pro-gram and allows the processors choicely to give their priorities to some tasks so that the solution to a question can be acquired as quickly as possi-ble and that the parallel system obtains a higher speedup. In this algorithm co-scheduling is intro-duced and load-balancing of processors is con-sidered.
展开▼
