Performance of Muse on the BBN Butterfly TC2000

Citation:

Anon. Performance of Muse on the BBN Butterfly TC2000. In: Parallel Execution of Logic Programs, ICLP'91 Pre-Conference Workshop. Parallel Execution of Logic Programs, ICLP'91 Pre-Conference Workshop. ; 1991. p. .

Abstract:

Muse is a simple and efficient approach to Or-parallel implementation of the full Prolog language. It is based on having multiple sequential 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 performance results of Muse on bus-based multiprocessor machines have been presented in previous papers. This paper discusses implementation and performance results of Muse on the BBN Butterfly TC2000. It also compares the Muse results with the corresponding results of the Aurora Or-parallel Prolog system. The results of Muse execution show that high real speedups can be achieved on Prolog programs that exhibit coarse-grained parallelism, the scheduling overhead being equivalent to around 8 – 26 Prolog procedure calls per task, and that for a large set of benchmarks the Muse system is faster than the Aurora system.