Abstract
Since further improvements in speed for sequential architectures are limited, the development of parallel implementation techniques for logic programming languages has become an increasingly important area of research. This paper presents a data flow model, which allows an efficient realization of the nondeterminisms contained in logic programs, especially of AND-, OR-nondeterminism and backtracking. The model is based primarily on a dependency analysis similar to Restricted AND-Parallelism [DeG84], which starts with a static classification of dependency situations among subgoals. The classification performed in our model results in a single data flow graph representation for each rule. These graphs contain simple tests, which can decide at execution time on the dependency of subgoals. Additionally, we use this kind of dependency analysis to organize intelligent backtracking. Finally, our model allows realization of OR-parallelism similar to the method used in the AND/OR Process Model [Con83].
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Arvind, Gostelow K. P.: The U-Interpreter, IEEE Computer, Vol. 15, No. 2, pp. 42–49, Feb. 1982.
Chang J.-H.: High Performance Execution of Prolog Programs Based on a Static Data Dependency Analysis, PhD Thesis, Univ. of California, Berkeley, Oct. 1985.
Ciepielewski A.: Towards a Computer Architecture for Or-Parallel Execution of Logic Programs, PhD Thesis, Royal Institute of Technologie, Stockholm, 1984.
Clark K., Gregory S.: Parlog: Parallel Programming in Logic, Research Report DOC 84/4, Dept. of Computing, Imperial College London, April 1984.
Clocksin W. F., Mellish C. S.: Programming in Prolog, Springer-Verlag, 1981.
Conery J. S.: The AND/OR Process Model for Parallel Interpretations, PhD Thesis, Univ. of California, Irvine, June 1983.
De Groot D.: Restricted AND-Parallelism, Proceedings of the Int. Conf. on Fifth Generation Computer Systems, North-Holland, pp. 471–478, Nov. 1984.
Dennis J. B.: Data Flow Supercomputers, Computer IEEE, Vol. 13, No. 10, pp. 48–56, Oct. 1980.
Hermenegildo M. V.: An Abstract Machine for Resticted AND-Parallel Execution of Logic Programs, Proceedings of the Third International Conference on Logic Programming, Springer-Verlag, pp. 25–39, July 1986.
Hermenegildo M. V., Nasr R. I.: Efficient Management of Backtracking in AND-Parallelism, Proceedings of the Third International Conference on Logic Programming, Springer-Verlag, pp. 40–54, July 1986.
Hermenegildo M. V.: An Abstract Machine Based Execution Model for Computer Architecture Design and Efficient Implementation of Logic Programs in Parallel, Ph. D. Thesis, University of Texas, Austin, Aug. 1986.
Kowalski R. A.: Logic for Problem Solving, North-Holland Publishing Co., 1979.
Lin Y.-J., Kumar V., Leung C.: An Intelligent Backtracking Algorithm for Parallel Execution of Logic Programs, Proceedings of the Third Int. Conf. on Logic Programming, Springer-Verlag, pp. 55–68, July 1986.
Pereira L. M., Porto A.: Selective Backtracking, Logic Programming, ed. by Clark K. and Tärnlund S.-A., Academic Press, pp. 107–114, 1982.
Schwinn B., Barth G.: An AND-Parallel Execution Model for Logic Programs, Proceedings of the European Symposium on Programming, Springer-Verlag, pp. 289–300, March 1986.
Schwinn B.: RAPiD: Ein Datenflußmodell zur Realisierung von UND-Parallelität und intelligentem Backtracking in Hornklausel-Programmen, Dissertation, Univ. Stuttgart, Mai 1988.
Shapiro E. Y.: A Subset of Concurrent Prolog and its Interpreter, ICOT Technical Report TR003, Feb. 1983.
Ueda K.: Guarded Horn Clauses, ICOT Technical Report TR103, Inst. for New Generation Computer Technology, Tokio, 1985.
Westphal H., Robert P., Chassin J., Syre J.-C.: The PEPSys Model: Combining Backtracking, AND-and OR-parallelism, Proceedings of the 1987 Symposium on Logic Programming, IEEE Computer Society Press, pp. 436–448, Sept. 1987.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Schwinn, B., Barth, G., Welsch, C. (1989). RAPiD a data flow model for implementing parallelism and intelligent backtracking in logic programs. In: Odijk, E., Rem, M., Syre, JC. (eds) PARLE '89 Parallel Architectures and Languages Europe. PARLE 1989. Lecture Notes in Computer Science, vol 366. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51285-3_37
Download citation
DOI: https://doi.org/10.1007/3-540-51285-3_37
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51285-1
Online ISBN: 978-3-540-46184-5
eBook Packages: Springer Book Archive