YapDss: An or-parallel prolog system for scalable Beowulf clusters

6Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper discusses the design of YapDss, an or-parallel Prolog system for distributed memory parallel machines, such as the Beowulf PC clusters. The system builds on the work of YapOr, an or-parallel system for shared memory machines, and uses the distributed stack splitting binding model to represent computation state and work sharing among the computational workers. A new variant scheme of stack splitting, the diagonal splitting, is proposed and implemented. This scheme includes efficient algorithms to balance work load among computing workers, to determine the bottommost common node between two workers, and to calculate exactly the work load of one worker. An initial evaluation of the system shows that it is able to achieve very good speedups on a Beowulf PC cluster. © Springer-Verlag Berlin Heidelberg 2003.

Cite

CITATION STYLE

APA

Rocha, R., Silva, F., & Martins, R. (2003). YapDss: An or-parallel prolog system for scalable Beowulf clusters. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2902, 136–150. https://doi.org/10.1007/978-3-540-24580-3_21

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free