Automatic compile-time parallelization of logic programs for restricted, goal level, independent and parallelism

Journal of Logic Programming

Volumn 38, Issue 2, 1999, Pages 165-218

  Muthukumar, K ^a   Bueno, F ^b   Garcia De La Banda M ^c   Hermenegildo, M ^b  

^a APPLE INC   (United States)

^b UNIVERSIDAD POLITÉCNICA DE MADRID   (Spain)

^c MONASH UNIVERSITY   (Australia)

Author keywords

prolog; And parallelism; Automatic parallelization; Conditional dependency graphs; Parallelizing compilers

Indexed keywords

CONSTRAINT THEORY; HEURISTIC METHODS; LINEARIZATION; MATHEMATICAL TRANSFORMATIONS; MULTIPROCESSING PROGRAMS; PARALLEL ALGORITHMS; PROGRAM COMPILERS; PROLOG (PROGRAMMING LANGUAGE); RESPONSE TIME (COMPUTER SYSTEMS);

AUTOMATIC COMPILE-TIME PARALLELIZATIONS; CONDITIONAL DEPENDENCY GRAPHS;

LOGIC PROGRAMMING;

EID: 0033079281     PISSN: 07431066     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0743-1066(98)10022-5     Document Type: Article

References (85)

1. H. Ait-Kaci, Warren's Abstract Machine, A Tutorial Reconstruction, MIT Press, Cambridge, MA, 1991.
2. K.A.M. Ali, R. Karlsson, Full prolog and scheduling or-parallelism in muse, Inter. J. Parallel Program. 19 (6) (1990) 445-475.
3. K.A.M. Ali, R. Karlsson, The muse or-parallel prolog model and its performance, in: 1990 North American Conference on Logic Programming, MIT Press, Cambridge, MA, 1990, pp. 757-776.
4. D. Bacon, S. Graham, O. Sharp, Compiler transformations for high-performance computing, Computing Surveys 26 (4) (1994) 345-420.
5. A. Bansal, L. Sterling, Transforming generate-and-test logic programs to committed-choice and-parallelism, Int. J. Parallel Program. 18 (5) (1989) 401-446.
6. A. Bansal, L. Sterling, An abstract interpretation scheme for identifying inherent parallelism in logic programs, New Generation Computing 7 (2-3) (1990) 273-324.
7. P. Brand, S. Haridi, D.H.D. Warren, Andorra Prolog - The language and application in distributed simulation, in: International Conference on Fifth Generation Computer Systems, Tokyo, November 1988.
8. F. Bueno, D. Cabeza, M. Hermenegildo, G. Puebla, Global analysis of standard prolog programs, in: European Symposium on Programming, vol. 1058 in LNCS, Sweden, April 1996, Springer, Berlin, pp. 108-124.
9. F. Bueno, M. García de la Banda, M. Hermenegildo, Effectiveness of global analysis in strict independence-based automatic program parallelization, in: International Symposium on Logic Programming, MIT Press, Cambridge, MA, 1994, pp. 320-336.
10. F. Bueno, M. García de la Banda, M. Hermenegildo, Effectiveness of abstract interpretation in automatic parallelization: A case study in logic programming, ACM Transactions on Programming Languages and Systems, 1998, in press.
11. F. Bueno, M. Hermenegildo, U. Montanari, F. Rossi, From eventual to atomic and locally atomic CC programs: A concurrent semantics, in: Fourth International Conference on Algebraic and Logic Programming, vol. 850 in LNCS, Springer, Berlin, 1994, pp. 114-132.
12. F. Bueno, M. Hermenegildo, U. Montanari, F. Rossi, Partial order and contextual net semantics for atomic and locally atomic CC programs, Sci. Comput. Program. 30 (1998) 51-82 (Special CCP95 Workshop issue).
13. F. Bueno Carrillo, Automatic optimisation and parallelisation of logic programs through program transformation, Ph.D. Thesis, Universidad Politécnica de Madrid (UPM), October 1994.
14. D. Cabeza, M. Hermenegildo, Extracting non-strict independent and-parallelism using sharing and freeness information, in: 1994 International Static Analysis Symposium, vol. 864 in LNCS, Namur, Belgium, Springer, Berlin, 1994.
15. D. Cabeza, M. Hermenegildo, Implementing distributed concurrent constraint execution in the CIAO system, in: Proceedings of the AGP'96 Joint conference on Declarative Programming, pp. 67-78, San Sebastian, Spain, July 1996, University of the Basque Country. Available from http:// www.clip.dia.fl.upm.es.
16. M. Carro, L. Gómez, M. Hermenegildo, Some paradigms for visualizing parallel execution of logic programs, in: 1993 International Conference on Logic Programming, MIT Press, Cambridge, MA, 1993, pp. 184-201.
17. J.-H. Chang, A.M. Despain, D. Degroot, And-parallelism of logic programs based on static data dependency analysis, in: Compcon Spring '85, February 1985, pp. 218-225.
18. S.-E. Chang, Y.P. Chiang, Restricted AND-parallelism execution model with side-effects, in: E.L. Lusk, R.A. Overbeek (Eds.), Proceedings of the North American Conference on Logic Programming, MIT Press, Cambridge, MA, 1989, pp. 350-368.
19. J. Chassin, P. Codognet, Parallel logic programming systems, Computing Surveys 26 (3) (1994) 295-336.
20. K. Clark, S. Gregory, Parlog: Parallel programming in logic, J. ACM 8 (1986) 1-49.
21. M. Codish, A. Mulkers, M. Bruynooghe, M. García de la Banda, M. Hermenegildo, Improving Abstract Interpretations by Combining Domains, ACM Transactions on Programming Languages and Systems 17 (1) (1995) 28-44. Available from http://www.clip.dia.fi.upm.es.
22. J.S. Conery, The and/or process model for parallel interpretation of logic programs, Ph.D. Thesis, The University of California At Irvine, Technical Report 204, 1983.
23. S.K. Debray, P. López García, M. Hermenegildo, N.-W. Lin, Estimating the computational cost of logic programs, in: Static Analysis Symposium, SAS'94, vol. 864 in LNCS, Namur, Belgium, September 1994, Springer, Berlin, pp. 255-265.
24. S.K. Debray, N.W. Lin, Cost analysis of logic programs, ACM Trans. on Program. Languages and Systems 15 (5) (1993) 826-875.
25. D. DeGroot, Restricted AND-parallelism, in: International Conference on Fifth Generation Computer Systems, Tokyo, November 1984, pp. 471-478.
26. D. DeGroot, A technique for compiling execution graph expressions for restricted AND-parallelism in logic programs, in: International Supercomputing Conference, Athens, 1987, Springer, Berlin, pp. 80-89.
27. D. Kuck et al., Dependence graphs and compiler optimizations, in: 8th Symposium on Principles of Programming Languages, ACM, New York, 1981, pp. 207-218.
28. M. Fernández, M. Carro, M. Hermenegildo, IDeal Resource Allocation (IDRA): A technique for computing accurate ideal speedups in parallel logic languages, Technical report, T.U. of Madrid (UPM), June 1992.
29. M. García de la Banda, Independence, global analysis, and parallelism in dynamically scheduled constraint logic programming, Ph.D. Thesis, Universidad Politécnica de Madrid (UPM), Facultad Informatica UPM, 28660-Boadilla del Monte, Madrid, Spain, September 1994.
30. M. García de la Banda, F. Bueno, M. Hermenegildo, Towards independent and-parallelism in CLP, in: Programming Languages: Implementation, Logics, and Programs, vol. 1140 in LNCS, Aachen, Germany, September 1996. Springer, Berlin, pp. 77-91.
31. M. García de la Banda, M. Hermenegildo, A practical application of sharing and freeness inference, In 1992 Workshop on Static Analysis WSA'92, vol. 81-82 in BIGRE, Bourdeaux, France, September 1992, IRISA-Beaulieu, pp. 118-125.
32. M. García de la Banda, M. Hermenegildo, K. Marriott, Independence in constraint logic programs, in: 1993 International Logic Programming Symposium, MIT Press, Cambridge, MA, October 1993, pp. 130-146.
33. D. Gelernter, A. Nicolau, D. Padua, Languages and compilers for parallel computing, MIT Press, Cambridge, MA, 1990.
34. G. Gupta, V. Santos Costa, Cuts and side-effects in and-or parallel prolog, J. Logic Program. 27 (1) (1992) 45-71.
35. G. Gupta, M. Hermenegildo, E. Pontelli, V. Santos-Costa, ACE: And/Or-parallel copying-based execution of logic programs, in: International Conference on Logic Programming, MIT Press, Cambridge, MA, 1994, pp. 93-110.
36. G. Gupta, V. Santos-Costa, R. Yang, M. Hermenegildo, IDIOM: Integrating Dependent And-, Independent And-, and Or-parallelism, in: 1991 International Logic Programming Symposium, MIT Press, Cambridge, MA, 1991, pp. 152-166.
37. M. Hermenegildo, An abstract machine based execution model for computer architecture design and efficient implementation of logic programs in parallel, Ph.D. Thesis, University of Texas at Austin, August 1986.
38. M. Hermenegildo, An abstract machine for restricted AND-parallel execution of logic programs, in: Third International Conference on Logic Programming, vol. 225 in Lecture Notes in Computer Science, Imperial College, Springer, Berlin, 1986, pp. 25-40.
39. M. Hermenegildo, Automatic parallelization of irregular and pointer-based computations: Perspec-tives from logic and constraint programming, in: Proceedings of EUROPAR'97, vol. 1300 in LNCS, Springer, Berlin, 1997, pp. 31-46 (invited).
40. M. Hermenegildo, D. Cabeza, M. Carro, Using attributed variables in the implementation of concurrent and parallel logic programming systems, in: Proceedings of the 12th International Conference on Logic Programming, MIT Press, Cambridge, MA, 1995, pp. 631-645.
41. M. Hermenegildo, K. Greene, The And-prolog system: Exploiting independent And-Parallelism, New Generation Computing 9 (3,4) (1991) 233-257.
42. M. Hermenegildo, R.I. Nasr, Efficient management of backtracking in AND-parallelism, in: Third International Conference on Logic Programming, vol. 225 in LNCS, Imperial College, Springer, Berlin, 1986, pp. 40-55.
43. M. Hermenegildo, F. Rossi, On the correctness and efficiency of independent And-parallelism in logic programs, in: 1989 North American Conference on Logic Programming, MIT Press, Cambridge, 1989, pp. 369-390.
44. M. Hermenegildo, F. Rossi, Non-strict independent And-Parallelism, in: 1990 International Conference on Logic Programming, MIT Press, Cambridge, MA, 1990, pp. 237-252.
45. M. Hermenegildo, F. Rossi, Strict and non-strict independent And-parallelism in logic programs: Correctness, efficiency, and compile-time conditions, J. Logic Program. 22 (1) (1995) 1-45.
46. M. Hermenegildo, The CLIP Group, Some methodological issues in the design of CIAO - A generic, parallel, concurrent constraint system, in: Principles and Practice of Constraint Programming, number 874 in LNCS, Springer, Berlin, 1994, pp. 123-133.
47. M. Hermenegildo, R. Warren, S.K. Debray, Global flow analysis as a practical compilation tool, J. Logic Program. 13 (4) (1992) 349-367.
48. D. Jacobs, A. Langen, Compilation of logic programs for restricted And-Parallelism, in: European Symposium on Programming, 1988, pp. 284-297.
49. J. Jaffar, J.-L. Lassez, Constraint logic programming, in: ACM Symposium Principles of Programming Languages, ACM, New York, 1987, pp. 111-119.
50. S. Janson, S. Haridi, Programming paradigms of the Andorra Kernel Language, in: Logic Programming, Proceedings of the 1991 Symposium, MIT Press, 1991.
51. A. King, P. Soper, Schedule analysis of concurrent logic programs, in: K. Apt (Ed.), Proceedings of the Joint International Conference and Symposium on Logic Programming, Washington, USA, MIT Press, Cambridge, MA, 1992, pp. 478-492.
52. R.A. Kowalski, Logic for Problem Solving, Elsevier, North-Holland, 1979.
53. Y.J. Lin, V. Kumar, AND-Parallel execution of logic programs on a shared memory multiprocessor: A summary of results, in: Fifth International Conference and Symposium on Logic Programming, MIT Press, Cambridge, MA, 1988, pp. 1123-1141.
54. P. López García, M. Hermenegildo, S.K. Debray, A methodology for granularity based control of parallelism in logic programs, J. Symbolic Computation 22 (1996) 715-734 (Special Issue on Parallel Symbolic Computation).
55. E. Lusk et al., The Aurora Or-Parallel Prolog System, New Generation Computing 7(2,3) 1990.
56. U. Montanari, F. Rossi, F. Bueno, M. García de la Banda, M. Hermenegildo, Towards a concurrent semantics-based analysis of CC and CLP, in: Principles and Practice of Constraint Programming, vol. 874 in LNCS, Springer, Berlin, 1994, pp. 151-161.
57. K. Muthukumar, M. Hermenegildo, Complete and efficient methods for supporting side effects in independent/restricted And-parallelism, in: 1989 International Conference on Logic Programming, MIT Press, Cambridge, MA, 1989, pp. 80-101.
58. K. Muthukumar, M. Hermenegildo, The CDG, UDG, and MEL methods for automatic compile-time parallelization of logic programs for independent And-parallelism, in: International Conference on Logic Programming, MIT Press, Cambridge, MA, 1990, pp. 221-237.
59. K. Muthukumar, M. Hermenegildo, Combined determination of sharing and freeness of program variables through abstract interpretation, in: 1991 International Conference on Logic Programming, MIT Press, Cambridge, MA, 1991, pp. 49-63.
60. K. Muthukumar, Compile-time algorithms for efficient parallel implementation of logic programs, Ph.D. Thesis, University of Texas at Austin, August 1991.
61. L. Naish, Parallelizing NU-Prolog, in: Fifth International Conference and Symposium on Logic Programming, University of Washington, MIT Press, Cambridge, MA, August 1988, pp. 1546-1564.
62. E. Pontelli, G. Gupta, M. Hermenegildo, &ACE: A high-performance parallel prolog system, in: International Parallel Processing Symposium, IEEE Computer Society Technical Committee on Parallel Processing, IEEE Computer Society, April 1995, pp. 564-572.
63. E. Pontelli, G. Gupta, F. Pulvirenti, A. Ferro, Automatic compile-time parallelization of prolog programs for dependent And-Parallelism, in: Proceedings of the 14th International Conference on Logic Programming, MIT Press, Cambridge, MA, July 1997, pp. 108-122.
64. B. Ramkumar, L.V. Kale, Compiled execution of the Reduce-OR process model on multiprocessors, in: 1989 North American Conference on Logic Programming, MIT Press, Cambridge, MA, October 1989, pp. 313-331.
65. V. Santos-Costa, D.H.D. Warren, R. Yang, 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, ACM, New York, April 1990.
66. V. Saraswat, Concurrent constraint programming languages, Ph.D. Thesis, Carnegie Mellon University Pittsburgh, School of Computer Science, 1989.
67. V. Saraswat, M. Rinard, P. Panangaden, Semantic foundation of concurrent constraint programming, in: Proceedings of the 18th Annual ACM Conference on Principles of Programming Languages, ACM, New York, 1991.
68. V. Sarkar, Partitioning and Scheduling Parallel Programs for Multiprocessors, Pitman, London, 1989.
69. V. Sarkar, Instruction reordering for fork-join parallelism, in: Proceedings of the ACM SIGPLAN conference on programming language design and implementation, vol. 25, June 1990, pp. 322-336 .
70. E.Y. Shapiro (Ed.), Concurrent Prolog: Collected Papers, MIT Press, Cambridge, MA, 1987.
71. E.Y. Shapiro, The family of concurrent logic programming languages, ACM Computing Surveys 21 (3) (1989) 412-510.
72. K. Shen, Exploiting dependent And-Parallelism in prolog: The dynamic, dependent And-Parallel scheme, in: Proceeding of the Joint International Conference and Symposium on Logic Programming, MIT Press, Cambridge, MA, 1992, pp. 717-731.
73. K. Shen, Overview of DASWAM: Exploitation of Dependent And-parallelism, J. Logic Program. 29 (1-3) (1996) 245-293 .
74. H. Sondergaard, An application of abstract interpretation of logic programs: occur check reduction, in: European Symposium on Programming, LNCS 123, Springer, Berlin, 1986, pp. 327-338.
75. S. Taylor, S. Safra, E. Shapiro, A parallel implementation of flat concurrent prolog, in: E.Y. Shapiro (Ed.), Concurrent Prolog: Collected Papers, MIT Press, Cambridge, MA, 1987, pp. 575-604.
76. E. Tick, The deevolution of concurrent logic programming languages, J. Logic Program. 23 (1-3) (1995) 89-125.
77. E. Tick, C. Bannerjee, Performance evaluation of monaco compiler and runtime kernel, in: 1993 International Conference on Logic Programming, MIT Press, Cambridge, MA, June 1993, pp. 757-773.
78. K. Ueda, Guarded horn clauses, Ph.D. Thesis, University of Tokyo, 1986.
79. K. Ueda, Guarded horn clauses, in: E.Y. Shapiro (Ed.), Concurrent Prolog: Collected Papers, MIT Press, Cambridge MA, 1987, pp. 140-156.
80. K. Ueda, Making exhaustive search programs deterministic, New Generation Computing 5 (1) (1987) 29-44.
81. D.H.D. Warren, An abstract prolog instruction set, Technical Report 309, Artificial Intelligence Center, SRI International, 333 Ravenswood Ave, Menlo Park, CA 94025, 1983.
82. D.H.D. Warren, OR-Parallel execution models of prolog, in: Proceedings of TAPSOFT '87, vol. 250 in Lecture Notes in Computer Science, Springer, Berlin, 1987.
83. D.H.D. Warren, The extended andorra model with implicit control, in: S. Jansson (Ed.), Parallel Logic Programming Workshop, Box 1263, S-163 13 Spanga, Sweden, June 1990, SICS.
84. W. Winsborough, A. Waern, Transparent And-Parallelism in the presence of shared free variables, in: Fifth International Conference and Symposium on Logic Programming, Seattle, Washington, 1988, pp. 749-764.
85. X. Zhong, E. Tick, S. Duvvuru, L. Hansen, A.V.S. Sastry, R. Sundararajan, Towards an efficient compile-time granularity analysis algorithm, in: Proceedings of the 1992 International Conference on Fifth Generation Computer Systems, Institute for New Generation Computer Technology (ICOT), June 1992, pp. 809-816.