Data-flow based execution mechanisms of Parallel and Concurrent Prolog
Tóm tắt
Study attempts to show that our machine architecture based on the data flow model is suitable for two types of logic programming languages with different aims: one is Parallel Prolog and the other is Concurrent Prolog. The data flow model can naturally implement parallel computation, and it has close similarity to these languages. Unification and nondeterministic control, two basic functions of these languages, are represented by data flow graphs and interpreted by the machine. Several representations of variables, that facilitate the development of parallel unification and nondeterministic control mechanisms for these languages, the unification and control primitives needed to execute these languages on this architecture are presented.
Tài liệu tham khảo
Ackerman, W. B., “A Structured Processing Facility for Data FLow Computers,”Proceeding of International Conference on Parallel Processing, 1978.
Amamiya, M. and Hasegawa R., “Data Flow Machine and Functional Language,”AL81-84, PRL81-63, IECE Japan, Dec., 1981 [in Japanese].
Amamiya, M., Hasegawa, R., Nakamura, O. and Mikami, H., “A List-processing-oriented data flow architecture,”National Computer Conference 1982, pp. 143–151, June, 1982.
Arvind, Gostelow, K. P. and Plouffe, W. E., “An Asynchronous Programming Language and Computing Machine,”TR-114a, Dept. of ICS, University of California, Irvine, Dec., 1978.
Arvind and Innucci, R. A., “A Critique of Multiprocessing von Neumann Style,”Proceedings of 10th International Symposium on Computer Architecture, June, 1983.
Clark, K. and Gregory, S., “A Relational Language for Parallel Programming,”Research Report DOC 81/16 Imperial College of Science and Technology, July, 1981.
Clark, K. and Gregory, S., “PARLOG: Parallel Programming in Prolog,”Research Report DOC 84/4 Imperial College of Science and Technology, April, 1984.
Cohen, J. “Garbage Collection of Linked Data Structures,”Computing Surveys,Vol.13,No. 3, Sept., 1981.
Conery, J. S. and Kibler, D., “Parallel Interpretation of Logic Programming,”Proceedings of Conference on Functional Programming and Computer Architecture, ACM, Oct., 1981.
Dijkstra, E. M.,A Discipline of Programming, Prentice-Hall, 1976.
Gurd, J. R. and Watson, I., “Data Driven System for High Speed Parallel Computing,”Computer Design, July, 1980.
Ito, N., Masuda, K. and Shimizu, H., “Parallel Prolog Machine Based on the Data Flow Model,”ICOT Technical Report, TR-035, Institute for New Generation Computer Technology, Tokyo, Japan, 1983.
Ito, N. and Kuno, E., “Simulation of a Parallel Prolog Machine,”Proceedings of 28th National Conference of Information Processing Society of Japan, Tokyo, Japan, March, 1984 [in Japanese].
Ito, N. and Masuda, K., “Parallel Inference Machine Based on the Data Flow Model,”International Workshop on High Level Computer Architecture 84, Hyatt International Hotel, Los Angeles, California, May, 1984.
Kowalski, R., “Predicate Logic as Programming Language,”IFIP 74, North-Holland, 1974.
Nakamura, O., Hasegawa, R. and Amamiya, M., “The Design and Evaluation of the Structure Memories for a List Processing Oriented Data Flow Machine,”EC 81-32, IECE Japan, 1981 [in Japanese].
Onai, R. and Asou, M., “Control Mechanisms of the Guard and Read-Only Annotation in Parallel Inference Machine,”Proceedings of 27th National Conference of Information Processing Society of Japan, Nagoya, Japan, Oct., 1983 [in Japanese].
Shapiro, E. Y., “A Subset of Concurrent Prolog and its Interpreter,”ICOT Technical Report, TR-003, Institute for New Generation Computer Technology, Tokyo, Japan, Jan., 1983.
Shapiro, E. Y., “System Programming in Concurrent Prolog,”ICOT Technical Report, TR-034, Institute for New Generation Computer Technology, Tokyo, Japan, Nov., 1983.