Full prolog and scheduling or-parallelism in muse |
| |
Authors: | Khayri A M Ali Roland Karlsson |
| |
Affiliation: | (1) SICS, Swedish Institute of Computer Science, Box 1263, S-164 28 Kista, Sweden |
| |
Abstract: | Muse is a simple and efficient approach to Or-parallel implementation of the full Prolog language. It is based on havingmultiplesequential Prolog engines, each with its local address space, and some shared memory space. It is currently implemented on a number of bus-based and switch-based multiprocessors. The sequential SICStus Prolog system has been adapted to Or-parallel implementation with very low extra overhead in comparison with other approaches. The Muse performanhce results are very encouraging in absolute and relative terms.The Muse execution model and its performance results on two different multiprocessor machines for a parallel version of Prolog, named Commit Prolog, have been presented in previous papers. This paper discusses supporting the full Prolog language and describes mechanisms being developed for scheduling Or-parallelism in Muse. It also presents performance results of the Muse implementation on Sequent Symmetry after supporting full Prolog. The results show that the extra overhead associated with supporting the full Prolog language is negligible. |
| |
Keywords: | Or-parallelism full Prolog multiprocessors experimental results scheduling |
本文献已被 SpringerLink 等数据库收录! |
|