EFFICIENT STREAM/ARRAY PROCESSING IN LOGIC PROGRAMMING LANGUAGES.

Kazunori Ueda, Takashi Chikayama

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

3 Citations (Scopus)

Abstract

The Concurrent Prolog predicate for merging n input streams is investigated, and a compilation technique for getting its efficient code is presented. Using the technique, data are transferred with a delay independent of n. It is shown that the addition and the removal of an input stream can be done within an average time of O(1). The predicate for distributing data on an input stream to n output streams can also be realized as efficiently as n-ary merge. The compilation technique for the distribute predicate can further be applied to the implementation of mutable arrays that allow constant-time accessing and updating. These results are also applicable to PARLOG.

Original languageEnglish
Title of host publicationUnknown Host Publication Title
Place of PublicationTokyo, Jpn
PublisherOhmsha Ltd
Pages317-326
Number of pages10
ISBN (Print)4274072215
Publication statusPublished - 1984
Externally publishedYes

Fingerprint

Array processing
Logic programming
Merging
Computer programming languages

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Ueda, K., & Chikayama, T. (1984). EFFICIENT STREAM/ARRAY PROCESSING IN LOGIC PROGRAMMING LANGUAGES. In Unknown Host Publication Title (pp. 317-326). Tokyo, Jpn: Ohmsha Ltd.

EFFICIENT STREAM/ARRAY PROCESSING IN LOGIC PROGRAMMING LANGUAGES. / Ueda, Kazunori; Chikayama, Takashi.

Unknown Host Publication Title. Tokyo, Jpn : Ohmsha Ltd, 1984. p. 317-326.

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

Ueda, K & Chikayama, T 1984, EFFICIENT STREAM/ARRAY PROCESSING IN LOGIC PROGRAMMING LANGUAGES. in Unknown Host Publication Title. Ohmsha Ltd, Tokyo, Jpn, pp. 317-326.
Ueda K, Chikayama T. EFFICIENT STREAM/ARRAY PROCESSING IN LOGIC PROGRAMMING LANGUAGES. In Unknown Host Publication Title. Tokyo, Jpn: Ohmsha Ltd. 1984. p. 317-326
Ueda, Kazunori ; Chikayama, Takashi. / EFFICIENT STREAM/ARRAY PROCESSING IN LOGIC PROGRAMMING LANGUAGES. Unknown Host Publication Title. Tokyo, Jpn : Ohmsha Ltd, 1984. pp. 317-326
@inproceedings{d04ce457df364d9c9884134b8a932c51,
title = "EFFICIENT STREAM/ARRAY PROCESSING IN LOGIC PROGRAMMING LANGUAGES.",
abstract = "The Concurrent Prolog predicate for merging n input streams is investigated, and a compilation technique for getting its efficient code is presented. Using the technique, data are transferred with a delay independent of n. It is shown that the addition and the removal of an input stream can be done within an average time of O(1). The predicate for distributing data on an input stream to n output streams can also be realized as efficiently as n-ary merge. The compilation technique for the distribute predicate can further be applied to the implementation of mutable arrays that allow constant-time accessing and updating. These results are also applicable to PARLOG.",
author = "Kazunori Ueda and Takashi Chikayama",
year = "1984",
language = "English",
isbn = "4274072215",
pages = "317--326",
booktitle = "Unknown Host Publication Title",
publisher = "Ohmsha Ltd",

}

TY - GEN

T1 - EFFICIENT STREAM/ARRAY PROCESSING IN LOGIC PROGRAMMING LANGUAGES.

AU - Ueda, Kazunori

AU - Chikayama, Takashi

PY - 1984

Y1 - 1984

N2 - The Concurrent Prolog predicate for merging n input streams is investigated, and a compilation technique for getting its efficient code is presented. Using the technique, data are transferred with a delay independent of n. It is shown that the addition and the removal of an input stream can be done within an average time of O(1). The predicate for distributing data on an input stream to n output streams can also be realized as efficiently as n-ary merge. The compilation technique for the distribute predicate can further be applied to the implementation of mutable arrays that allow constant-time accessing and updating. These results are also applicable to PARLOG.

AB - The Concurrent Prolog predicate for merging n input streams is investigated, and a compilation technique for getting its efficient code is presented. Using the technique, data are transferred with a delay independent of n. It is shown that the addition and the removal of an input stream can be done within an average time of O(1). The predicate for distributing data on an input stream to n output streams can also be realized as efficiently as n-ary merge. The compilation technique for the distribute predicate can further be applied to the implementation of mutable arrays that allow constant-time accessing and updating. These results are also applicable to PARLOG.

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

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

M3 - Conference contribution

AN - SCOPUS:0021655451

SN - 4274072215

SP - 317

EP - 326

BT - Unknown Host Publication Title

PB - Ohmsha Ltd

CY - Tokyo, Jpn

ER -