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

Fingerprint

PROLOG (programming language)
Engines
Parallel algorithms
Resource allocation
Experiments
Controllers
Processing

All Science Journal Classification (ASJC) codes

  • Engineering(all)

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.

IMPLEMENTATION OF PARALLEL PROLOG ON TREE MACHINES. / Miura, Hajime; Yamashita, Masafumi; Imai, Masaharu; Ibaraki, Toshihide.

Unknown Host Publication Title. ed. / Harold S. Stone. IEEE, 1986. p. 287-296.

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

Miura, H, Yamashita, M, Imai, M & Ibaraki, T 1986, IMPLEMENTATION OF PARALLEL PROLOG ON TREE MACHINES. in HS Stone (ed.), Unknown Host Publication Title. IEEE, pp. 287-296.
Miura H, Yamashita M, Imai M, Ibaraki T. IMPLEMENTATION OF PARALLEL PROLOG ON TREE MACHINES. In Stone HS, editor, Unknown Host Publication Title. IEEE. 1986. p. 287-296
Miura, Hajime ; Yamashita, Masafumi ; Imai, Masaharu ; Ibaraki, Toshihide. / IMPLEMENTATION OF PARALLEL PROLOG ON TREE MACHINES. Unknown Host Publication Title. editor / Harold S. Stone. IEEE, 1986. pp. 287-296
@inproceedings{63436292e73447fda2617de938cf6c9c,
title = "IMPLEMENTATION OF PARALLEL PROLOG ON TREE MACHINES.",
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.",
author = "Hajime Miura and Masafumi Yamashita and Masaharu Imai and Toshihide Ibaraki",
year = "1986",
month = "12",
day = "1",
language = "English",
isbn = "0818607432",
publisher = "IEEE",
pages = "287--296",
editor = "Stone, {Harold S.}",
booktitle = "Unknown Host Publication Title",

}

TY - GEN

T1 - IMPLEMENTATION OF PARALLEL PROLOG ON TREE MACHINES.

AU - Miura, Hajime

AU - Yamashita, Masafumi

AU - Imai, Masaharu

AU - Ibaraki, Toshihide

PY - 1986/12/1

Y1 - 1986/12/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0022917886&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0022917886&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0022917886

SN - 0818607432

SP - 287

EP - 296

BT - Unknown Host Publication Title

A2 - Stone, Harold S.

PB - IEEE

ER -