Performance of Muse on switch-based multiprocessor machines

Khayri, Mohammed A; Karlsson, Roland; Mudambi, Shyam

doi:10.1007/bf03037528

Cited by 5 publications

(3 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The MUSE or-parallel Prolog system has been designed and implemented on a number of UMA and NUMA computers (Sequent Symmetry, Sun Galaxy, BBN Butterfly II, etc.) [Ali and Karlsson 1990b;1990a;Ali et al 1992;Ali and Karlsson 1992b;Karlsson 1992]. It supports the full Prolog language and programs run on it with almost no user annotations.…”

Section: 52mentioning

confidence: 99%

“…For programs with no or very low or-parallelism, the speed-ups obtained are close to 1 due to very low parallel overheads. More details of the MUSE system and a discussion of its performance results can be found in references cited earlier [Ali and Karlsson 1992a;Ali et al 1992;Ali and Karlsson 1992b;Karlsson 1992].…”

Section: 52mentioning

confidence: 99%

“…Examples of processor-based systems are &-Prolog, Aurora, MUSE, Andorra-I, PEPSys, AO-WAM, DDAS, ACE, PBA, etc. Processor-based systems are more suited for shared memory machines, although techniques like stack-copying and stack-splitting show a high degree of locality in memory reference behavior and hence are suited for non-shared memory machines as well [Ali 1988;Ali et al 1992;Gupta and Pontelli 1999c]. As has been shown by the ACE model, MUSE's stackcopying technique can be applied to and-or parallel systems as well, so one can envisage implementing a processor-based system on a non-shared memory machine using stack-copying [Villaverde et al 2001;.…”

Section: Implementation and Efficiency Issuesmentioning

confidence: 99%

See 2 more Smart Citations

Parallel execution of prolog programs

Gupta

Pontelli

Ali

et al. 2001

ACM Trans. Program. Lang. Syst.

116

View full text Add to dashboard Cite

Since the early days of logic programming, researchers in the field realized the potential for exploitation of parallelism present in the execution of logic programs. Their high-level nature, the presence of non-determinism, and their referential transparency, among other characteristics, make logic programs interesting candidates for obtaining speedups through parallel execution. At the same time, the fact that the typical applications of logic programming frequently involve irregular computations, make heavy use of dynamic data structures with logical variables, and involve search and speculation, makes the techniques used in the corresponding parallelizing compilers and run-time systems potentially interesting even outside the field. The objective of this paper is to provide a comprehensive survey of the issues arising in parallel execution of logic programming languages along with the most relevant approaches explored to date in the field. Focus is mostly given to the challenges emerging from the parallel execution of Prolog programs. The paper describes the major techniques used for shared memory implementation of Or-parallelism, Andparallelism, and combinations of the two. We also explore some related issues, such as memory management, compile-time analysis, and execution visualization.

show abstract

Section: 52mentioning

confidence: 99%

Section: 52mentioning

confidence: 99%