Data structures for order-sensitive predicates in parallel nondeterministic systems

Acta Informatica

Volumn 37, Issue 1, 2000, Pages 21-43

  Ranjan, Desh ^a   Pontelli, Enrico ^a   Gupta, Gopal ^a  

^a New Mexico State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0034348607     PISSN: 00015903     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00013301     Document Type: Article

References (49)

1. 1. K.A.M. Ali, R. Karlsson: The Muse Or-parallel Prolog Model and its Performance. In: 1990 N American Conf. on Logic Prog., pp. 757-776. MIT Press, 1990
2. 2. K.A.M. Ali, R. Karlsson: Full Prolog and Scheduling Or-parallelism in Muse. Int Parallel Program. 19(6):445-475 (1991)
3. 3. A.M. Ben-Amram: What is a Pointer Machine? Technical Report, DIKU, University of Copenhagen, 1995
4. 4. N. Blum: On the single-operation worst-case time complexity of the disjoint set union problem. SIAM J Comput, 15(4):1021-1024 (1986)
5. 5. P. Brand: Wavefront Scheduling. Technical report, SICS, Gigalips Project, 1988
6. 6. S.-E. Chang, Y. P. Chiang: Restricted AND-Parallelism Execution Model with Side-Effects. In: Ewing L. Lusk, Ross A. Overbeek, (eds) Proceedings of the North American Conference on Logic Programming, pp. 350-368, 1989
7. 7. W.F. Clocksin, C.S. Mellish: Programming in Prolog. Berlin Heidelberg New York: Springer 1981
8. 8. J. S. Conery: The And/Or Process Model for Parallel Interpretation of Logic Programs. PhD thesis, The University of California At Irvine, 1983 Technical Report 204
9. 9. T.H. Cormen, C.E. Leiserson, R.L. Rivest: Introduction to Algorithms. MIT Press, 1992
10. 10. M.L. Fredman, M.E. Saks: The Cell Probe Complexity of Dynamic Data Structures. In: Procs. of 21st ACM Symposium on Theory of Computing, pp. 345-354, ACM 1989
11. 11. H.N. Gabow: Data structures for weighted matching and nearest common ancestor. In: ACM Symp. on Discrete Algorithms, pp. 434-443, 1990
12. 12. G. Gupta: Multiprocessor Execution of Logic Programs. Dodrecht: Kluwer, 1994
13. 13. G. Gupta, V. Santos Costa: Cuts and Side-effects in And/Or Parallel Prolog. Journal of Logic Programming 27(1):45-71 (1996)
14. 14. G. Gupta, M. Hermenegildo, E. Pontelli, V. Santos Costa: ACE: And/Or-parallel Copying-based Execution of Logic Programs. In: Proc. ICLP'94, pp. 93-109. MIT Press 1994
15. 15. G. Gupta, B. Jayaraman: Analysis of or-parallel execution models. ACM TOPLAS 15(4):659-680 (1993)
16. 16. G. Gupta, E. Pontelli, K.M. Ali, M. Carlsson, M. Hermenegildo: Parallel Execution of Prolog Programs: a Survey. Technical report, New Mexico State University, 1999
17. 17. D. Harel, R.E. Tarjan: Fast Algorithms for Finding Nearest Common Ancestor. SIAM J Comput 13(2):338-355 (1984)
18. 18. S. Haridi, S. Janson: Kernel Andorra Prolog and its Computation Model. In: Proc. 7th International Conf. on Logic Programming, pp. 31-46. MIT Press 1990
19. 19. B. Hausman: Handling speculative work in or-parallel prolog: Evaluation results. In: S. Debray, M. Hermenegildo (eds) North American Conference on Logic Programming, pp. 721-736, Austin, TX, October 1990
20. 20. B. Hausman, A. Ciepielewski, A. Calderwood: Cut and Side-Effects in Or-Parallel Prolog. In: International Conference on Fifth Generation Computer Systems, pp. 831-840. Tokyo, November 1988
21. 21. M. Hermenegildo, K. Greene: &-Prolog and its Performance: Exploiting Independent And-Parallelism. In: 1990 Int'l Conf on Logic Prog., pp. 253-268. MIT Press, June 1990
22. 22. L. V. Kalé, D. A. Padua, D. C. Sehr: OR-Parallel execution of Prolog with Side Effects. J Supercomput 2(2):209-223, (1988)
23. 23. J.C. Kergommeaux, P. Codognet: Parallel logic programming systems. ACM Comput Surv26(3):295-336 (1994)
24. 24. D.E. Knuth: The Art of Computer Programming, Vol 1. Reading, MA: Addison-Wesley 1968
25. 25. R.A. Kowalski: Logic for Problem Solving. Amsterdam: Elsevier North-Holland 1979
26. 26. J. W. Lloyd: Foundations of Logic Programming. Berlin Heidelberg New York: Springer 1987
27. 27. E. Lusk, R. Butler, T. Disz, R. Overbeek, D.H.D. Warren, A. Calderwood, P. Szeredi, S. Haridi, P. Brand, M. Carlsson, A. Ciepielewski, B. Hausman: The Aurora Or-parallel Prolog System. New Generation Computing 7(2/3): 243-271 (1990)
28. 28. K. Marriot, P. Stuckey: Programming with Constraints. MIT Press 1997
29. 29. K. Muthukumar, M. Hermenegildo: Efficient Methods for Supporting Side Effects in Independent And-parallelism and Their Backtracking Semantics. In: 1989 International Conference on Logic Programming. Cambridge, MA: MIT Press, June 1989
30. 30. E. Pontelli, G. Gupta: Implementation Mechanisms for Dependent And-parallelism. In: International Conference on Logic Programming. Cambridge, MA: MIT Press, 1997
31. 31. E. Pontelli, G. Gupta, M. Hermenegildo: &ACE: A High-performance Parallel Prolog System. In: International Parallel Processing Symposium, pp. 564-571. IEEE Computer Society, Santa Barbara, CA, April 1995
32. 32. E. Pontelli, G. Gupta, D. Tang, M. Carro, M. Hermenegildo: Efficient Implementation of Independent And Parallelism. Comput Lang 22(2/3), 1996
33. 33. E. Pontelli, D. Ranjan, G. Gupta: On the Complexity of Parallel Implementation of Logic Programs. In: Proceedings of the International Conference on Foundations of Software Technology and Theoretical Computer Science, pp. 123-137, Berlin Heidelberg New York: Springer, 1997
34. 34. E. Pontelli, D. Ranjan, G. Gupta: The Complexity of Late Binding in Dynamic Object-Oriented Programming Languages. J Funct Logic Program, Special Issue #2, November 1999
35. 35. D. Ranjan, E. Pontelli, G. Gupta: On the Complexity of Or-Parallelism. New Generation Comput 17(3):285-308 (1999)
36. 36. D. Ranjan, E. Pontelli, L. Longpre, G. Gupta: The Temporal Precedence Problem. Algorithmica, 1999
37. 37. J. A. Robinson: A Machine Oriented Logic Based on the Resolution Principle. Journal of the ACM 12(23):23-41 (1965)
38. 38. A. Schönhage: Storage Modification Machines. SIAM J Comput 9(3):490-508 (1980)
39. 39. E.Y. Shapiro, (ed): Concurrent Prolog: Collected Papers. Cambridge MA: MIT Press, 1987
40. 40. K. Shen: Exploiting Dependent And-parallelism in Prolog: The Dynamic Dependent And-parallel Scheme. In: Proc. Joint Int'l Conf. and Symp. on Logic Prog., pp. 717-731. MIT Press 1992
41. 41. K. Shen: Overview of DASWAM: Exploitation of Dependent And-Parallelism. J Logic Program 29(1/3):245-293 (1996)
42. 42. K. Shen, M. Hermenegildo: A Simulation Study of Or-and Independent And-parallelism. In: Proc. 1991 International Logic Programming Symposium. MIT Press 1991
43. 43. R. Sindaha: The Dharma Scheduler - Definitive Scheduling in Aurora on Multiprocessor Architecture. In: Proc. of ILPS'93, 1993
44. 44. D.D. Sleator, R.E. Tarjan: A data structure for dynamic trees. J Comput Sys Sci 26:362-391 (1983)
45. 45. L. Sterling, E.Y. Shapiro: The Art of Prolog. Cambridge MA, MIT Press 1994
46. 46. R.E. Tarjan: A Class of Algorithms which Require Nonlinear Time to Maintain Disjoint Sets. J Comput Syst Sci 2(18):110-127 (1979)
47. 47. H. Tebra: Optimistic And-Parallelism in Prolog. In: PARLE 87. Berlin Heidelberg New York: Springer 1987
48. 48. A.K. Tsakalidis: The Nearest Common Ancestor in a Dynamic Tree. Acta Inf 25(1): 37-54 (1987)
49. 49. D.H.D. Warren, V. Santos Costa, R. Yang: The Andorra-I Engine: a Parallel Implementation of the Basic Andorra Model. In: Procs. of the International Conference on Logic Programming. Cambridge, MA: MIT Press 1991