Title
Performance of Muse on Switch-Based Multiprocessor Machines
Abstract
The Muse (multiple sequential Prolog engines) approach has been used to make a simple and efficient OR-parallel implementation of the full Prolog language. The performance results of the Muse system on bus-based multiprocessor machines have been presented in previous chapters, papers. This chapter paper discusses the implementation and performance results of the Muse system on switch-based multiprocessors (the BBN Butterfly GP1000 and TC2000). The results of Muse execution show that high real speedups can be achieved for Prolog programs that exhibit coarse-grained parallelism. The scheduling overhead is equivalent to around 8 -- 26 Prolog procedure calls per task on the TC2000. The chapter paper also compares the Muse results with corresponding results for the Aurora OR-parallel Prolog system. For a large set of benchmarks, the results are in favor of the Muse system.
Year
DOI
Venue
1992
10.1007/BF03037528
New Generation Computing
Keywords
Field
DocType
Parallel Machines,Parallel Systems,Performance Evaluation,OR-Parallelism,Prolog
Programming language,Scheduling (computing),Computer science,Parallel computing,Multiprocessing,Prolog,Or parallelism,Procedure calls
Journal
Volume
Issue
ISSN
11
1
0288-3635
Citations 
PageRank 
References 
7
0.53
20
Authors
3
Name
Order
Citations
PageRank
Mohammed A Khayri170.53
Roland Karlsson222411.24
Shyam Mudambi3696.20