A message driven OR-parallel machine

Authors:
S. A. Delgado-Rannauro;T. J. Reynolds
Affiliations:
ECRC GmbH, Arabellastr, 17 D-8000, Munchen 81, W. Germany;Dept. of Computer Science, University of Essex, England
Venue:
ASPLOS III Proceedings of the third international conference on Architectural support for programming languages and operating systems
Year:
1989

Citing 4
Cited 0

Memory performance of prolog architectures

Memory performance of prolog architectures
Multipath hierarchies in interconnection networks

Proceedings of the 1st International Conference on Supercomputing
A parallel Prolog: The construction of a data driven model

LFP '82 Proceedings of the 1982 ACM symposium on LISP and functional programming
Banyan networks for partitioning multiprocessor systems

ISCA '73 Proceedings of the 1st annual symposium on Computer architecture

Quantified Score

Hi-index	0.00

Visualization

Abstract

A message driven architecture for the execution of OR-parallel logic languages is proposed. The computational model is based on well known compilation techniques for Logic Languages. We present first the multiple binding mechanism for the OR-parallel Prolog architecture and the corresponding OR-parallel abstract machine is described. A scheduling algorithm which does not rely upon the availability of global data structures to direct the search for work is discussed. The message driven processor, the processing node of the parallel machine, is designed to interact with a shared global address space and to efficiently process messages from other processing nodes. We discuss some of the results obtained from a high level functional simulator of the message driven machine.