By Topic

A task scheduling algorithm for parallel logic programming systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Jie Tao ; Inst. fur Inf., Tech. Univ. Munchen, Germany ; Jiubin Ju

A task scheduling algorithm for parallel logic programming systems and its implementation in an AND-parallel Prolog system are described. This algorithm schedules all of the parallel subtasks which are created during the execution of a program, under centralized control, and allows the processors to choose to give their priorities to some tasks so that the solution to a question can be acquired as quickly as possible and so that the parallel system obtains a higher speedup. In this algorithm, co-scheduling is introduced and the load balancing of processors is considered.

Published in:

High Performance Computing in the Asia-Pacific Region, 2000. Proceedings. The Fourth International Conference/Exhibition on  (Volume:1 )

Date of Conference:

14-17 May 2000