IMPLEMENTATION OF PARALLEL PROLOG ON TREE MACHINES.

Hajime Miura, Masafumi Yamashita, Masaharu Imai, Toshihide Ibaraki

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Parallel algorithms for controlling the execution of Prolog programs on tree machines are proposed, and their efficiences are compared through simulation experiments. The model of the tree machine used in this experiment consists of a single-tree engine, a multiplexer, and a system controller. The single-tree engine is a common part of tree machines and has generality. From the simulation results it appears that if the given problem has enough parallelism, then high performance can be obtained by the algorithms proposed. While a better utilization of processing elements and a better load balancing remain problems, tree machines are found to be suitable for parallel implementation of Prolog.

Original languageEnglish
Title of host publicationUnknown Host Publication Title
EditorsHarold S. Stone
PublisherIEEE
Pages287-296
Number of pages10
ISBN (Print)0818607432
Publication statusPublished - Dec 1 1986

All Science Journal Classification (ASJC) codes

  • Engineering(all)

Fingerprint Dive into the research topics of 'IMPLEMENTATION OF PARALLEL PROLOG ON TREE MACHINES.'. Together they form a unique fingerprint.

  • Cite this

    Miura, H., Yamashita, M., Imai, M., & Ibaraki, T. (1986). IMPLEMENTATION OF PARALLEL PROLOG ON TREE MACHINES. In H. S. Stone (Ed.), Unknown Host Publication Title (pp. 287-296). IEEE.