Relating data-parallelism and (and-) parallelism in logic programs

Computer Languages

Volumn 22, Issue 2-3, 1996, Pages 143-163

  Hermenegildo, Manuel V ^a   Carro, Manuel ^a  

^a UNIVERSIDAD POLITÉCNICA DE MADRID   (Spain)

Author keywords

And parallelism; Data parallelism; Fast task startup; Parallel logic programming; Scheduling

Indexed keywords

DATA PROCESSING; PARALLEL PROCESSING SYSTEMS;

DATA PARALLELISM TECHNIQUES;

LOGIC PROGRAMMING;

EID: 0030182034     PISSN: 00960551     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0096-0551(96)00011-2     Document Type: Article

References (59)

1. Metcalf, M. and Reid, J. Fortran 90 Explained. Oxford: Oxford University Press; 1990.
2. Thinking Machines Corp., Cambridge, MA. C* Programming Guide; 1990.
3. Hatcher, P. J. and Quinn, M. J. Data-parallel Programming on MIMD Computers. Cambridge, MA: MIT Press; 1991.
4. Thinking Machines Corp., Cambridge, MA. The Essential *LISP Manual; 1986.
5. Voronkov, A. Logic programming with bounded quantifiers. In Logic Programming - Proc. Second Russian Conf. on Logic Programming (Edited by Voronkov, A.). LNCS 592, Berlin: Springer-Verlag; 1992.
6. Nilsson, M. and Tanaka, H. A Flat GHC implementation for supercomputers. In Proc. Fifth Int. Conf. Symp. on Logic Programming (Edited by Kowalski, R. A. and Bowen, K. A.), pp. 1337-1350. Cambridge, MA: MIT Press; 1988.
7. Barklund, J. and Millroth, H. Nova Prolog. UPMAIL Technical Report 52, Comp. Sci. Dept., Uppsala University, Uppsala; 1988.
8. Blanck, J. Abstrakt maskin for Nova Prolog. Internal report, Computer Science Department, Uppsala University, Uppsala; 1992.
9. Kacsuk, P. Execution Models of Prolog for Parallel Computers. London: Pitman; 1990.
10. Wise, M. J. Experimenting with epilog: Some results and preliminary conclusions. In 13th Annual International Symposium on Computer Architecture, pp. 130-139. IEEE Computer Society; June 1986.
11. Millroth, H. Reforming Compilation of Logic Programs. Ph.D. thesis, Computer Science Department, Uppsala University, Uppsala; 1990.
12. Barklund, J. Parallel Unification. Ph.D. thesis, Computer Science Department, Uppsala University, Uppsala; 1990.
13. Bevemyr, J., Lindgren, T. and Millroth, H. Exploiting recursion-parallelism in Prolog. In Proc. PARLE'93. Berlin: Springer-Verlag; 1993.
14. Bevemyr, J., Lindgren, T. and Millroth, H. Reform Prolog: the language and its implementation. In Proc. 10th Int. Conf. Logic Programming, Budapest, Hungary. Cambridge, MA: MIT Press; 1993.
15. Conery, J. S. The And/Or Process Model for Parallel Interpretation of Logic Programs. Ph.D. thesis, The University of California At Irvine, Technical Report 204; 1983.
16. DeGroot, D. Restricted AND-Parallelism. In International Conference on Fifth Generation Computer Systems, pp. 471-478. Tokyo; November 1984.
17. DeGroot, D. Restricted AND-Parallelism and Side-Effects. In International Symposium on Logic Programming, pp. 80-89. San Francisco, IEEE Computer Society; August 1987.
18. Hermenegildo, M. V. An Abstract Machine Based Execution Model for Computer Architecture Design and Efficient Implementation of Logic Programs in Parallel. Ph.D. thesis, Dept. of Electrical and Computer Engineering (Dept. of Computer Science TR-86-20). University of Texas at Austin, Austin, Texas; August 1986.
19. Hermenegildo, M. and Greene, K. &-Prolog and its performance: exploiting independent and-parallelism. In 1990 International Conference on Logic Programming, pp. 253-268. Cambridge, MA: MIT Press; 1990.
20. Kumar, V. and Kanal, L. N. Parallel branch-and-bound formulations for and/or tree search. IEEE Transactions on Pattern Analysis and Machine Intelligence 6: 768-778; 1984.
21. Lin, Y. J. and Kumar, V. And-Parallel execution of logic programs on a shared-memory multiprocessor: a summary of results. In Fifth International Conference and Symposium on Logic Programming, pp. 1123-1141. Cambridge, MA: MIT Press; 1988.
22. Warren, D. H. D. The SRI model for or-parallel execution of Prolog - abstract design and implementation. In International Symposium on Logic Programming, pp. 92-102. San Francisco, IEEE Computer Society; August 1987.
23. E. Lusk et al. The Aurora or-parallel prolog system. New Generation Computing 7(2,3); 1990.
24. Ali, K. A. M. Or-parallel execution of Prolog on the BC-machine. In Fifth International Conference and Symposium on Logic Programming, pp. 253-268. Seattle, Washington, Cambridge, MA: MIT Press; 1988.
25. Ali, K. A. M. and Karlsson, R. The Muse or-parallel Prolog model and its performance. In 1990 North American Conference on Logic Programming, pp. 757-776. Cambridge, MA: MIT Press; 1990.
26. Gupta, G. and Jayaraman, B. Compiled and-or parallelism on shared memory multiprocessors. In 1989 North American Conference on Logic Programming, pp. 332-349. Cambridge, MA: MIT Press; 1989.
27. Gupta, G., Santos-Costa, V., Yang, R. and Hermenegildo, M. IDIOM: integrating dependent and-, independent and-, and or-parallelism. In 1991 International Logic Programming Symposium, pp. 152-166. Cambridge, MA: MIT Press; 1991.
28. Gupta, G., Hermenegildo, M., Pontelli, E. and Santos Costa, V. ACE: and/or-parallel copying-based execution of logic programs. In International Conference on Logic Programming, pp. 93-110. Cambridge, MA: MIT Press; 1994.
29. Fagin, B. S. A Parallel Execution Model for Prolog. Ph.D. thesis, The University of California at Berkeley, Technical Report UCB/CSD 87/380; November 1987.
30. Kalé, L. V. Parallel execution of logic programs: the reduce-or process model. In Fourth International Conference on Logic Programming, pp. 616-632. Melbourne, Australia. Cambridge, MA: MIT Press; 1987.
31. Shen, K. Exploiting dependent and-parallelism in Prolog: the dynamic, dependent and-parallel scheme. In Proc. Joint Int. Conf. and Symp. on Logic Prog. Cambridge, MA: MIT Press; 1992.
32. Warren, D. H. D. The Andorra model. Presented at Gigalips Project workshop. University of Manchester; March 1988.
33. Santos-Costa, V., Warren, D. H. D. and Yang, R. Andorra-I: a parallel Prolog system that transparently exploits both and- and or-parallelism. In Proceedings of the 3rd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming. New York: ACM; April 1990.
34. Ricci, L., Compilation of Logic Programs for Massively Parallel Systems. Ph.D. thesis, Università di Pisa; December 1989.
35. Karlsson, R. A high performance or-parallel Prolog system. Ph.D. thesis, SICS and the Royal Institute of Technology, S-164 28 Kista, Sweden; March 1992.
36. Carlsson, M. Design and implementation of an or-parallel Prolog engine. Ph.D. thesis, SICS and the Royal Institute of Technology, S-164 28 Kista, Sweden; March 1990.
37. Prestwich, S. On Parallelisation Strategies for Logic Programs. In Proceedings of the International Conference on Parallel Processing, number 854 in Lecture Notes in Computer Science, pp. 289-300. Berlin: Springer-Verlag; 1994.
38. Carlsson, M., Danhof, K. and Overbeek, R. A simplified approach to the implementation of and-parallelism in an or-parallel environment. In Fifth International Conference and Symposium on Logic Programming, pp. 1565-1577. Cambridge, MA: MIT Press; 1988.
39. Hermenegildo, M. and Rossi, F. Strict and non-strict independent and-parallelism in logic programs: correctness, efficiency, and compile-time conditions. Journal of Logic Programming 22(1): 1-45; 1995.
40. Naish, L. Parallelizing NU-Prolog. In Fifth International Conference and Symposium on Logic Programming, pp. 1546-1564. University of Washington. Cambridge, MA: MIT Press; 1988.
41. García de la Banda, M., Hermenegildo, M. and Marriott, K. Independence in constraint logic programs. In 1993 International Logic Programming Symposium, pp. 130-146. Cambridge, MA: MIT Press; 1993.
42. Hermenegildo, M. and the CLIP group. Some methodological issues in the design of CIAO - a generic, parallel, concurrent constraint system. In Principles and Practice of Constraint Programming, LNCS 874, pp. 123-133. Berlin: Springer-Verlag; 1994.
43. Arro, H., Barklund, J. and Bevemyr, J. Parallel bounded quantification - preliminary results. ACM SIGPLAN Notices 28: 117-124; 1993.
44. Hermenegildo, M. V. An abstract machine for restricted and-parallel execution of logic programs. In Third International Conference on Logic Programming, number 225 in Lecture Notes in Computer Science, pp. 25-40. Imperial College, Berlin: Springer-Verlag; 1986.
45. Santos-Costa, V., Warren, D. H. D. and Yang, R. The Andorra-I engine: a parallel implementation of the basic Andorra model. In 1991 International Conference on Logic Programming, pp. 825-839. Cambridge, MA: MIT Press; 1991.
46. Pontelli, E., Gupta, G. and Hermenegildo, M. &ACE: a high-performance parallel Prolog system. In International Parallel Processing Symposium. IEEE Computer Society Technical Committee on Parallel Processing, IEEE Computer Society; 1995.
47. Shen, K. and Hermenegildo, M. Divided we stand: parallel distributed stack memory management. In Implementations of Logic Programming Systems (Edited by Tick, E. and Succi, G.), pp. 185-203. Dordrecht, The Netherlands: Kluwer Academic Press; 1994.
48. Pontelli, E., Gupta, G. and Tang, D. Determinacy driven optimizations of and-parallel Prolog implementations. In Proc. of the Twelfth International Conference on Logic Programming. Cambridge, MA: MIT Press; 1995.
49. Pontelli, E., Gupta, G., Tang, D., Carro, M. and Hermenegildo, M. Improving the efficiency of nondeterministic and-parallel systems. Computer Languages, 22(2/3): 115-141; 1996.
50. Millroth, H. Reforming compilation of logic programs. In Logic Programming, Proceedings of the 1991 International Symposium (Edited by Saraswat V. and Ueda, K.), pp. 485-502. San Diego, CA. Cambridge, MA: MIT Press; 1991.
51. Debray, S. K., Lin, N.-W. and Hermenegildo, M. Task granularity analysis in logic programs. In Proc. of the 1990 ACM Conf. on Programming Language Design and Implementation, pp. 174-188. ACM Press; 1990.
52. King, A. and Soper, P. Granularity analysis of concurrent logic programs. In The Fifth International Symposium on Computer and Information Sciences. Nevsehir, Cappadocia, Turkey; October 1990.
53. Lopez Garcia, P., Hermenegildo, M. and Debray, S. K. Towards granularity based control of parallelism in logic programs. In Proc. of First International Symposium on Parallel Symbolic Computation, PASCO'94, pp. 133-144. World Scientific Publishing Company; 1994. (Also available in López García, P., Hermenegildo, M. and Debray, S. K. A methodology for granularity based control of parallelism in logic programs. Journal of Symbolic Computing, Special Issue on Parallel Symbolic Computation, 1996. In press.)
54. Lopez Garcia, P., Hermenegildo, M. and Debray, S. K. Towards granularity based control of parallelism in logic programs. In Proc. of First International Symposium on Parallel Symbolic Computation, PASCO'94, pp. 133-144. World Scientific Publishing Company; 1994. (Also available in López García, P., Hermenegildo, M. and Debray, S. K. A methodology for granularity based control of parallelism in logic programs. Journal of Symbolic Computing, Special Issue on Parallel Symbolic Computation, 1996. In press.)
55. Zhong, X., Tick, E., Duvvuru, S., Hansen, L., Sastry, A. V. S. and Sundararajan, R. Towards an efficient compile-time granularity analysis algorithm. In Proc. of the 1992 International Conference on Fifth Generation Computer Systems, pp. 809-816. Institute for New Generation Computer Technology (ICOT); Tokyo, June 1992.
56. Hermenegildo, M. and Greene, K. The &-Prolog system: exploiting independent and-parallelism. New Generation Computing 9(3,4): 233-257; 1991.
57. Carro, M., Gómez, L. and Hermenegildo, M. Some paradigms for visualizing parallel execution of logic programs. In 1993 International Conference on Logic Programming, pp. 184-201. Cambridge, MA: MIT Press; 1993.
58. Warren, R. and Hermenegildo, M. Experimenting with Prolog: an overview. Technical Report 43, MCC; Austin, Texas, March 1987.
59. Debray, S. and Jain, M. A Simple program transformation for parallelism. In 1994 International Symposium on Logic Programming, pp. 305-319. Cambridge, MA: MIT Press; 1994.