EFFICIENT STREAM/ARRAY PROCESSING IN LOGIC PROGRAMMING LANGUAGES.

Kazunori Ueda, Takashi Chikayama

研究成果: Conference contribution

3 被引用数 (Scopus)

抄録

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.

本文言語English
ホスト出版物のタイトルUnknown Host Publication Title
出版社Ohmsha Ltd
ページ317-326
ページ数10
ISBN(印刷版)4274072215
出版ステータスPublished - 1984 12 1
外部発表はい

ASJC Scopus subject areas

  • Engineering(all)

フィンガープリント 「EFFICIENT STREAM/ARRAY PROCESSING IN LOGIC PROGRAMMING LANGUAGES.」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル