A parallel execution scheme for exploiting AND-parallelism of logic programs is presented. This scheme follows the generator-consumer approach of the AND/OR process model. Using problem-specific knowledge, literals of a clause are linearly ordered at compile time. This ordering and run-time binding conditions are then used to dynamically select generators and consumers for different variables at run time. The scheme can exploit all the AND-parallelism available in the framework of generator-consumer approach. Compared with other execution schemes based on the same approach, the present scheme is simpler, and potentially more efficient.
|Original language||English (US)|
|Title of host publication||Proceedings of the International Conference on Parallel Processing|
|Editors||Kai Hwang, Steven M. Jacobs, Earl E. Swartzlander|
|Number of pages||4|
|State||Published - Dec 1 1986|