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
PublisherOhmsha Ltd
Pages317-326
Number of pages10
ISBN (Print)4274072215
Publication statusPublished - 1984 Dec 1
Externally publishedYes

ASJC Scopus subject areas

  • Engineering(all)

Fingerprint Dive into the research topics of 'EFFICIENT STREAM/ARRAY PROCESSING IN LOGIC PROGRAMMING LANGUAGES.'. Together they form a unique fingerprint.

  • Cite this

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