Overview of daswam: Exploitation of dependent and-parallelism

Journal of Logic Programming

Volumn 29, Issue 1-3, 1996, Pages 245-293

  Shen, Kish ^a  

^a UNIVERSITY OF MANCHESTER   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SOFTWARE; EFFICIENCY; LOGIC PROGRAMMING; PARALLEL PROCESSING SYSTEMS; PROLOG (PROGRAMMING LANGUAGE);

DYNAMIC DEPENDENT AND PARALLEL SCHEME;

SOFTWARE PROTOTYPING;

EID: 0030260688     PISSN: 07431066     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0743-1066(96)00079-9     Document Type: Article

References (38)

1. Ali, K. A. M. and Karlsson, R., Full Prolog and scheduling or-parallelism in Muse, Int. J. Parallel Program. 19(6):445-475 (1990).
2. Baron, U. C., Chassin de Kergommeaux, J., Hailperin, M., Ratcliffe, M., Robert, P., Syre, J.-C., and Westphal, H., The parallel ECRC Prolog system PEPSys: An overview and evaluation results, in: Proc. Int. Conf. on Fifth Generation Computer Systems 1988, Vol. 3, 1988, pp. 841-850.
3. Carlsson, M., SICStus Prolog Internals Manual, Swedish Institute of Computer Science, Box 1263, S-163 12 Spånga, Sweden, Jan. 1989.
4. Chikayama, T., Fujise, T., and Sekita, D., A portable and efficient implementation of KL1, in: T. Chikayama and E. Tick (eds.), Workshop on Parallel Logic Programming and its Programming Environments, 1994.
5. Codognet, C. and Codognet, P., Non-deterministic stream and-parallelism based on intelligent backtracking, in: G. Levi and M. Martelli (eds.), Logic Programming: Proc. Sixth Int. Conf., MIT Press, 1989, pp. 63-79.
6. Crammond, J., Implementation of Committed Choice Logic Languages on Shared Memory Multiprocessors, Ph.D. thesis, Heriot-Watt University, 1988.
7. DeGroot, D., Restricted and-parallelism, in: Proc. Int. Conf. on Fifth Generation Computer Systems, 1984, pp. 471-478.
8. Drakos, N., Unrestricted and-parallel execution of logic programs with dependency directed backtracking, in: N. S. Sridharan (ed.), Proc. Eleventh Int. Joint Conf. on Artificial Intelligence, Aug. 1989, Vol. 1, pp. 157-162.
9. Gregory, S., Design, Application and Implementation of a Parallel Logic Language, Ph.D. thesis, Imperial College of Science and Technology, University of London, 1985.
10. Gupta, G., Hermenegildo, M. V., Pontelli, E., and Santos Costa, V., ACE: And/or-parallel copying-based execution of logic programs, in: Logic Programming: Proc. Eleventh Conf. MIT Press, June 1994, pp. 93-110.
11. 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, 1986.
12. Hermenegildo, M. V. and Greene, K., The &-Prolog system: Exploiting independent and-parallelism, New Gen. Comput. 9(3,4) :233-257 (1991).
13. Hermenegildo, M. V. and Rossi, F., On the correctness and efficiency of independent and-parallelism in logic programs, in: 1989 North American Conf. on Logic Programming, MIT Press, Oct. 1989.
14. Kowalski, R. A., Algorithm = logic + control, Commun. ACM 22(7):425-436 (1979).
15. Lusk, E. L., Butler, R., Disz, T., Olson, R., Overbeek, R. A., Stevens, R., Warren, D. H. D., Calderwood, A., Szeredi, P., Haridi, S., Brand, P., Carlsson, M., Ciepielewski, A. and Hausman, B., The Aurora or-parallel Prolog system, New Gen. Comput. 7(2,3) (1990).
16. Munaf, D., Workforce management in Andorra-I, Technical Report MAIN-WP 1203. Issue 1, British Telecom Research Laboratory, 1993.
17. Muthukumar, K. and Hermenegildo, M. V., Efficient methods for supporting side effects in independent and-parallelism and their backtracking semantics, in: G. Levi and M. Martelli (eds.), Logic Programming: Proc. Sixth Int. Conf., MIT Press, June 1989, pp. 80-97.
18. Naish, L., Negation and control in prolog, Lecture Notes in Computer Science, Vol. 238, Springer-Verlag, 1986.
19. Naish, L., Parallelizing NU-Prolog, in: Fifth Int. Conf. and Symp. on Logic Programming, University of Washington, MIT Press, August 1988, pp. 1546-1564.
20. O'Keefe, R. A., The Craft of Prolog, MIT Press, 1990.
21. Olthof, I. W., An Optimistic AND-Parallel Prolog Implementation, Master's thesis, Department of Computer Science, University of Calgary, 1991.
22. Santos Costa, V., Warren, D. H. D., and Yang, R., The Andorra-I engine: A parallel implementation of the basic Andorra model, in: Logic Programming: Proc. Eighth Int. Conf., 1991, pp. 825-839.
23. Santos Costa, V., Warren, D. H. D., and Yang, R., The Andorra-I preprocessor: Supporting full Prolog on the basic Andorra model, in: Logic Programming: Proc. Eighth Int. Conf., 1991, pp. 443-456.
24. Shapiro, E., Concurrent Prolog: A progress report, Computer 19(8) (1986).
25. Shen, K., An Investigation of the Argonne Model of Or-Parallel Prolog, Master's thesis, University of Manchester, 1986. Available as University of Manchester Computer Science Technical Report UMCS-87-1-1.
26. Shen, K., Exploiting and-parallelism in Prolog: The dynamic dependent and-parallel scheme (DDAS), in: Logic Programming: Proc. Joint Int. Conf. and Symp. on Logic Programming, MIT Press, 1992, pp. 717-731.
27. Shen, K., Studies of And/Or Parallelism in Prolog, Ph.D. thesis, Computer Laboratory, University of Cambridge, 1992.
28. Shen, K., Implementing dynamic dependent and-parallelism, in: Logic Programming: Proc. Tenth Int. Conf., MIT Press, 1993, pp. 167-183.
29. Shen, K., Improving the execution of the dependent and-parallel Prolog DDAS, in: C Halatis, D. Maritsas, G. Philokyprou, and S. Theodoridis (eds.), PARLE'94 Parallel Architectures and Languages Europe, Springer-Verlag, 1994, pp. 438-452. Published as Lecture Notes in Computer Science 817.
30. Shen, K. and Hermenegildo, M. V., A simulation study of or- and independent and-parallelism, in: V. Saraswat and K. Ueda (eds.), Logic Programming: Proc. 1991 Int. Symp., MIT Press, 1991, pp. 135-151.
31. Shen, K. and Warren, D. H. D., A simulation study of the Argonne model for or-parallel execution of Prolog, in: Proc. Fourth Symp. on Logic Programming, IEEE Computer Society Press, Sept. 1987.
32. Szeredi, P., Performance analysis of the Aurora or-parallel system, in: E. L. Lusk and R. A. Overbeek (eds.), Logic Programming: Proc. North American Conf., 1989, Vol. 2, MIT Press, Oct. 1989, pp. 713-732.
33. Tebra, H., Optimistic And-Parallelism in Prolog, Ph.D. thesis, Vrije Universiteit te Amsterdam, 1989.
34. Tick, E., Memory performance of Lisp and Prolog programs, in: E. Shapiro (ed.), Third Int. Conf. on Logic Programming, Springer-Verlag, 1986, pp. 642-649. Published as Lecture Notes in Computer Science 225.
35. Ueda, K., Guarded Horn Clauses, Ph.D. thesis, University of Tokyo, 1986.
36. Ullman, J. D., Principles of Database and Knowledge-Base Systems, Vol. II, Computer Science Press, Rockville, MD, 1989.
37. Warren, D. H. D., An Abstract Prolog Instruction Set, Technical Note 309, SRI International, Menlo Park, CA, 1983.
38. Warren, D. S., Efficient Prolog management for flexible control strategies, in: Proc. Second Symp. on Logic Programming, 1984.