Structure data sharing method of highly parallel inference engine pie
Keiji Hirata, Hidehiko Tanaka · Systems and Computers in Japan · 1987
Abstract This paper presents an efficient data management technique for the highly parallel reference engine PIE. PIE aims at the general‐purpose machine in the future knowledge processing. It is a machine which executes logic programming languages with a high speed in OR‐parallel, according to the goal‐rewriting model. In the implementation scheme considered by the authors for the goal‐rewriting model, the initial scheme is the one where the elementary processing unit is generated by a complete copy, and the sharing mechanisms are gradually adopted. The structure data sharing scheme proposed in this paper is a scheme, where the elementary processing units share only the ground instances among the structure data owned by the elementary processing units. In this paper, the structure data sharing scheme is estimated by the software simulations indicating its usefulness. The proposed scheme can reduce the degeneration time and the transfer time of the basic processing units, and improve the processing speed. On the other hand, there appears the overhead due to the lazy fetch, separating and storing of group instances, and garbage collection is required. From the detailed simulation for those aspects, we make a quantitative discussion.