Advertisement

Parallelism in Logic Programming and Scheduling Issues

  • Cláudio F. R. Geyer
  • Patrícia Kayser Vargas
  • Inês de Castro Dutra
Part of the Applied Optimization book series (APOP, volume 67)

Abstract

This text summarises the main research work being carried out on the implementation of parallel logic programming systems. It concentrates on describing techniques for exploiting AND-parallelism and OR-parallelism while showing important aspects of some systems on shared-memory, distributed-memory and distributed-shared memory architectures. It also presents some important point ers to journals, conferences and sites with related information.

Keywords

Logic programming parallel execution models scheduling 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Special issue: Applications of logic programming. The Journal of Logic Programming, 26(2), February 1996.Google Scholar
  2. [2]
    A. Aggoun et al. ECLiPSe 3.5 User Manual. ECRC, December 1995.Google Scholar
  3. [3]
    H. Ait-Kaci. Warren’s Abstract Machine A Tutorial Reconstruction. MIT Press, 1991.Google Scholar
  4. [4]
    K. A. M. Ali and R. Karlsson. The Muse Or-parallel Prolog Model and its Performance. In Proceedings of the North American Conference on Logic Programming, pages 757–776. MIT Press, October 1990.Google Scholar
  5. [5]
    K. A. M. Ali and R. Karlsson. Performance of Muse on the BBN Butterfly TC2000. In LNCS 605, PARLE’92 Parallel Architectures and Languages Europe, pages 603–616. Springer-Verlag, June 1992.Google Scholar
  6. [6]
    K. A. M. Ali and R. Karlsson. Scheduling speculative work in muse and perfomance results. Internal Report, SICS, 1993.Google Scholar
  7. [7]
    J. Andersson, S. Andersson, K. Boortz, M. Carlsson, H. Nilsson, T. Sjoland, and J Widén. SICStus Prolog User’s Manual. Technical report, Swedish Institute of Computer Science, November 1997. SICS Technical Report.Google Scholar
  8. [8]
    K. R. Apt. From Logic Programming to Prolog. Prentice Hall, 1997.Google Scholar
  9. [9]
    J. L. V. Barbosa. Granlog: Um modelo para análise automática de granulosidade na programação em lógica. Dissertaçâo de mestrado, Universidade Federal do Rio Grande do Sul, 1996.Google Scholar
  10. [10]
    J. L. V. Barbosa, P. K. Vargas, C. F. R. Geyer, and I. C. Dutra. Granlog: an integrated model to granularity analysis in logic programming. In Workshop on Parallelism and Implementation Technologyfor (Constraint) Logic Programming Languages, July 2000. In conjunction with the Intl. Conference on Computational Logic, 2000, London, England.Google Scholar
  11. [11]
    U. Baron, J. C. Kergommeaux, M. Hailperin, M. Ratcliffe, P. Robert, J.-C. Syre, and H. Westphal. The Parallel ECRC Prolog System PEPSys: an Overview and Evaluation Results. In International Conference on Fifth Generation Computer Systems 1988, pages 841–850. ICOT, Tokyo, Japan, November 1988.Google Scholar
  12. [12]
    A. Beaumont. Scheduling in Or-Parallel Prolog Systems. PhD thesis, University of Bristol, Department of Computer Science, 1994.Google Scholar
  13. [13]
    V. Benjumea and J. M. Troya. A Static Implementation of the Basic Andorra Model for Distributed Memory Systems. In Post-JICSLP96 Workshop on Parallelism and Implementation of Logic Programming Systems, 1996. Bonn, Germany.Google Scholar
  14. [14]
    J. Bevemyr, T. Lindgren, and H. Millroth. Reform Prolog: The Language and its Implementation. In Proceedings of the Tenth International Conference on Logic Programming, pages 283–298. MIT Press, June 1993.Google Scholar
  15. [15]
    P. Borgwardt. Parallel prolog using stack segments on shared memory multiprocessors. In International Symposium on Logic Programming, pages 2–12, Silver Spring, MD, February 1984. Atlantic City, IEEE Computer Society.Google Scholar
  16. [16]
    J. Briat, M. Favre, C. F. R. Geyer, and J. C. Kergommeaux. Implementations of Distributed Prolog, chapter OPERA: Or-parallel Prolog System on Supernode, pages 45–63. John Wiley &; Sons Ltda, 1992.Google Scholar
  17. [17]
    Calegario, V. M. and Dutra, I. C. Performance Evaluation of Or-Parallel Logic Programming Systems on Distributed Shared Memory Architectures. In Proceedings of the EUROPAR’99, pages 1484–1491, Aug-Sep 1999.Google Scholar
  18. [18]
    L. F. P. Castro, V. Santos Costa, C. F. R. Geyer, F. Silva, P. K. Vargas, and M. E. Correia. DAOS — Scalable And-Or Parallelism. In Proceedings of the EUROPAR ’99, pages 899–908, 1999.Google Scholar
  19. [19]
    A. P. B. Centeno and C. F. R. Geyer. PENELOPE: Um modelo de Escalonador Hierárquico para o Sistema PLoSys. In X Simpósio Brasileiro de Arquitetura de Computadores e Processamento de Alto Desempenho, 1998. Búizios, RJ.Google Scholar
  20. [20]
    P. Ciancarini. Parallel Programming with Logic Languages: A Survey. Computer Languages, 17(4), October 1992.Google Scholar
  21. [21]
    P. Ciancarini. Blackboard Programming in Shared Prolog. In Languages and Compiler for Parallel Computing. MIT Press, June 1993.Google Scholar
  22. [22]
    A. Ciepielewski, K. A. M. Ali, and P. Biswas. Execution Models and Parallel Implementations of Prolog. unpublished, June 1993.Google Scholar
  23. [23]
    A. Ciepielewski and S. Haridi. A Formal Model for Or-Parallel Execution of Logic Programs. In IFIP 83 Conference, pages 299–305. North Holland, 1983.Google Scholar
  24. [24]
    W. F. Clocksin. Principles of the DelPhi parallel inference machine. Computer Journal, 30(5):386–392, 1987.CrossRefGoogle Scholar
  25. [25]
    J. Cohen. A View of the Origins and Development of Prolog. Communications of the ACM, 31(1):26–36, 1988.CrossRefGoogle Scholar
  26. [26]
    M. E. Correia, F. M. A. Silva, and V. Santos Costa. The SBA: Exploiting orthogonality in OR-AND Parallel Systems. In ILPS’97, Outubro 1997. Also published as Technical Report DCC-97–3, DCC — FC & LIACC, Universidade do Porto, April, 1997.Google Scholar
  27. [27]
    C. A. Costa and C. F. R. Geyer. Uma Proposta de Escalonamento Distribuido para Exploração de Paralelismo na ProgramaÇão em Lógica. In X Simpósio Brasileiro de Arquitetura de Computadores e Processamento de Alto Desempenho, 1998. Búzios, RJ.Google Scholar
  28. [28]
    J. A. Crammond. A Comparative Study of Unification Algorithms for OR-Parallel Execution of Logic Languages. In D. DeGroot, editor, Int. Conf. on Parallel Processing, pages 131–138, St. Charles, Ill., August 1985. IEEE.Google Scholar
  29. [29]
    L. Damas, V. Santos Costa, R. Reis, and R. Azevedo. YAP User’s Guide and Reference Manual, 1989.Google Scholar
  30. [30]
    K. De Bosschere and P. Tarau. Blackboard-based Extensions in Prolog. Software Practice and Experience, 26(1):49–69, January 1996.CrossRefGoogle Scholar
  31. [31]
    S. K. Debray, P. L. Garcia, M. V. Hermenegildo, and N. Lin. Estimating the computacional cost of logic programs. In International Static Analysis Symposium, volume 864 of Lecture Notes in Computer Science, Namur, Belgium, September 1994. Springer-Verlag.Google Scholar
  32. [32]
    S. K. Debray and N. Lin. Cost analysis of logic programs. ACM Transactions on Programming Languages and Systems, 15(5):826–875, November 1993.CrossRefGoogle Scholar
  33. [33]
    Doug DeGroot. A Technique for Compiling Execution Graph Expressions for Restricted And-Parallelism in Logic Programs. In C. Polychronopoulos, editor, Lecture Notes in Computer Science 297, Supercomputing, pages 1074–1093, 1987.Google Scholar
  34. [34]
    P. Deransart, A. Ed-Dbali, L. Cervoni, and A. A. Ed-Ball. Prolog, The Standard: Reference Manual. Springer Verlag, 1996.zbMATHCrossRefGoogle Scholar
  35. [35]
    T. Disz and E. Lusk. A Graphical Tool for Observing the Behavior of Parallel Logic Programs. In Proceedings of the 1987 International Logic Programming Symposium, pages 46–53, 1987.Google Scholar
  36. [36]
    I. C. Dutra. A Flexible Scheduler for Andorra-I. In A Beaumont and G. Gupta, editors, Lecture Notes in Computer Science 569, Parallel Execution of Logic Programs, pages 70–82. Springer-Verlag, June 1991.CrossRefGoogle Scholar
  37. [37]
    I. C. Dutra. Strategies for Scheduling And- and Or-Work in Parallel Logic Programming Systems. In Proceedings of the 1994 International Logic Programming Symposium, pages 289–304. MIT Press, 1994.Google Scholar
  38. [38]
    I. C. Dutra. DistributingAnd- and Or-Work in theAndorra-I Parallel Logic Programming System. PhD thesis, University of Bristol, Department of Computer Science, February 1995. PhD thesis.Google Scholar
  39. [39]
    I. C. Dutra. Distributing And-Work and Or-Work in Parallel Logic Programming Systems. In Proceedings of the 29th Hawaii International Conference on System Sciences, pages 646–655. IEEE, 1996.CrossRefGoogle Scholar
  40. [40]
    I. C. Dutra, V. Santos Costa, J. L. V. BARBOSA, and C. F. R. GEYER. Using Compile-Time Granularity Information to Support Dynamic Work Distribution in Parallel Logic Programming Systems. In X Simpósio Brasileiro de Arquitetura de Computadores, SBAC-PAD, October 1999.Google Scholar
  41. [41]
    D. N Ferrari, P. K. Vargas, J. L. V. Barbosa, and C. F. R. Geyer. Modelo de Integração Plosys-Granlog: Aplicação da Análise de Granulosidade na Exploração do Paralelismo OU. In XXV Conferência Latino Americana de Informática/V Encontro Chileno de Computação da Sociedade Chilena de Computação (CLEI — PANEL’99), September 1999. Assuncion, Paraguay.Google Scholar
  42. [42]
    N. Fonseca, I. C. Dutra, and V. Santos Costa. VisAll: A Universal Tool to Visualise Parallel Execution of Logic Programs. In Joint International Conference and Symposium on Logic Programming, pages 100–114, 1998. Manchester, Inglaterra.Google Scholar
  43. [43]
    Wai-Keong Foong. Or-Parallel Prolog with Heuristic Task Distribution. In Lecture Notes in Artificial Intelligence 592, Logic Programming Russian Conference, pages 193–200, 1991.Google Scholar
  44. [44]
    I. Futó. Prolog with Communicating Processes: From T-Prolog to CSRProlog. In Proceedings of the Tenth International Conference on Logic Programming, pages 3–17, June 1993.Google Scholar
  45. [45]
    Y. Gao et al. Intelligent Scheduling And- and Or- Parallelism in the Parallel Logic Programming System RAP/LOP-PIM. In Proceedings of the 1991 International Conference on Parallel Processing, August 1991.Google Scholar
  46. [46]
    C. F. R. Geyer, J. L. V. Barbosa, I. C. Dutra, V. Santos Costa, and G. Gupta. The APPELO Project — Parallel Environment for Logic Programming. In Protem-CC III, pages 30–55. CNPq, 1998. Available at http://www.inf.ufrgs.br/procpar/opera/APPELO/.Google Scholar
  47. [47]
    L. Gómez, M. Carro, and M. Hermenegildo. Some Paradigms for Visualising Parallel Execution of Logic Programs. In Proceedings of the Tenth International Conference on Logic Programming, pages 184–202, 1993.Google Scholar
  48. [48]
    A. Gonzalez and J. Tubella. The Multipath Parallel Execution Model for Prolog. In Proceedings of PASCO’94 (Parallel Symbolic Computation Conference), pages 426–432. World Scientific Publishing, 1994.Google Scholar
  49. [49]
    S. Gregory. Parallel Logic Programming in PARLOG. Addison—Wesley, 1987.Google Scholar
  50. [50]
    G. Gupta, K. A. M. Ali, M. Carlsson, and M. V. Hermenegildo. Parallel logic programming: a survey. available from ftp://ftp.cs.nmsu.edu/pub/papers/lp/survey.ps.Z, 1997.Google Scholar
  51. [51]
    G. Gupta, M. V. Hermenegildo, E. Pontelli, and V. Santos Costa. ACE: And/Or-parallel Copying-based Execution of Logic Programs. In Proceedings ofthe Eleventh International Conference on Logic Programming, Italy, June 1994.Google Scholar
  52. [52]
    G. Gupta and B. Jayaraman. On Criteria for Or-parallel Execution of Logic Programs. In Proceedings of the 1990 North American Conference on Logic Programming, pages 737–756. MIT Press, October 1990.Google Scholar
  53. [53]
    G. Gupta and E. Pontelli. Stack-Splitting: a Simple Technique for Implementing Or-Parallelism and And-parallelism on Distributed Machines. In Proceedings of the Sixteenth International Conference on Logic Programming, pages 290–304. MIT Press, 1999.Google Scholar
  54. [54]
    G. Gupta, E. Pontelli, and M. V. Hermenegildo. &ACE: A High Performance Parallel Prolog System. In Proceedings of the First International Symposium on Parallel Symbolic Computation, PASCO’94, 1994.Google Scholar
  55. [55]
    G. Gupta and V. Santos Costa. And-Or Parallelism in Full Prolog with Paged Binding Arrays. In LNCS 605, PARLE’92 Parallel Architectures and Languages Europe, pages 617–632. Springer-Verlag, June 1992.CrossRefGoogle Scholar
  56. [56]
    S. Haridi and S. Jansson. Kernel Andorra Prolog and its Computational Model. In D.H.D. Warren and P. Szeredi, editors, Proceedings of the Seventh International Conference on Logic Programming, pages 31–46. MIT Press, 1990.Google Scholar
  57. [57]
    M. V. Hermenegildo. An Abstract Machine for Restricted And-Parallel Execution of Logic Programs. In Ehud Shapiro, editor, Proceedings of the Third International Conference on Logic Programming, pages 25–39. Springer-Verlag, 1986.Google Scholar
  58. [58]
    M. V. Hermenegildo and K. J. Greene. The &-Prolog System: Exploiting Independent And-Parallelism. New Generation Computing, 9(3,4):233–256, 1991.CrossRefGoogle Scholar
  59. [59]
    Z. Huang, C. Sun, A. Sattar, and W-J. Lei. Parallel Logic Programming on Distributed Shared Memory System. In Proceedings of the IEEE International Conference on Intelligent Processing Systems, October 1997.Google Scholar
  60. [60]
    S. Jansson and S. Haridi. Programming Paradigms of the Andorra Kernel Language. In Proceedings of the 1991 International Logic Programming Symposium, pages 167–186. MIT Press, October 1991.Google Scholar
  61. [61]
    R. Karlsson. A High Performance OR-parallel Prolog System. Swedish Institute for Computer Science, SICS Dissertation Series 07, The Royal Institute of Technology, 1992.Google Scholar
  62. [62]
    J. C. Kergommeaux and P Codognet. Parallel logic programming systems. Computing Surveys, 26(3):295–336, September 1994.CrossRefGoogle Scholar
  63. [63]
    J. C. Kergommeaux and P. Robert. An Abstract Machine to Implement Or-And Parallel Prolog Efficiently. The Journal of Logic Programming, 8(3), May 1990.Google Scholar
  64. [64]
    Y. Kimura and T. Chikayama. An Abstract KL1 Machine and its Instruction Set. In International Symposium on Logic Programming, pages 468–477. San Francisco, IEEE Computer Society, August 1987.Google Scholar
  65. [65]
    R. A. Kowalski. Predicate Logic as a Programming Language. In Proceedings IFIPS, pages 569–574, 1974.Google Scholar
  66. [66]
    R. A. Kowalski. Algorithm = logic + control. Communications ACM, 22(7), July 1979.Google Scholar
  67. [67]
    Y J. Lin and V. Kumar. An Execution Model for Exploiting AndParallelism in Logic Programs. New Generation Computing, 5(4):393–425, 1988.CrossRefGoogle Scholar
  68. [68]
    Z. Lin. Self-Organising Task Scheduling for Parallel Execution of Logic Programs. In Proceedings of the 1992 International Conference on Fifth Generation Computer Systems, pages 859–868. ICOT, 1992.Google Scholar
  69. [69]
    G. Lindstrom. Or-Parallelism on Applicative Architectures. In Proceedings of the 1985 International Logic Programming Symposium, pages 159–170, July 1984.Google Scholar
  70. [70]
    R. Lopes and V. Santos Costa. Parallelism and Implementation of Logic and Constraint Logic Programming, chapter The BEAM: Towards a first EAM Implementation. Nova Science, Inc., 1999.Google Scholar
  71. [71]
    R. Lopes, F. Silva, V. Santos Costa, and S. Abreu. The RAINBOW: Towards a Parallel BEAM. In Workshop on Parallelism and Implementation Technology for (Constraint) Logic Programming Languages, July 2000. In conjunction with the Intl. Conference on Computational Logic, 2000, London, England.Google Scholar
  72. [72]
    E. Lusk et al. The Aurora or-parallel Prolog system. New Generation Computing, 7(2,3):243–271, 1990.CrossRefGoogle Scholar
  73. [73]
    J. Montelius. Penny, A Parallel Implementation of AKL. PhD thesis, Swedish Institute for Computer Science, SICS, Sweden, May 1997.Google Scholar
  74. [74]
    J. Montelius and P. Magnusson. Using SIMICS to evaluate the Penny system. In Jan Maluszyrnski, editor, Proceedings of the International Symposium on Logic Programming (ILPS-97), pages 133–148, Cambridge, October 13–16 1997. MIT Press.Google Scholar
  75. [75]
    R. Moolenaar and B. Demoen. A parallel implementation for AKL. In Proceedings of the Programming Language Implementation and Logic Programming: PLILP ’93, Tallin, Estonia, pages 246–261, 1993.Google Scholar
  76. [76]
    E. Morel, J. Briat, J. Chassin de Kergommeaux, and C. Geyer. SideEffects in PloSys OR-parallel Prolog on Distributed Memory Machines. In JICSLP’96 Post-Conference Workshop on Parallelism and Implementation Technology for (Constraint) Logic Programming Languages, Bonn, Germany, September 1996.Google Scholar
  77. [77]
    K. Muthukumar and M. V. Hermenegildo. The CDG, UDG, and MEL Methods for Automatic Compile-time Parallelization of Logic Programs for Independent And-parallelism. In Proceedings of the Seventh International Conference on Logic Programming, pages 221–237. MIT Press, June 1990.Google Scholar
  78. [78]
    L. M. Pereira, L. Monteiro, J. Cunha, and J.N. Aparicio. Delta Prolog: a distributed backtracking extension with events. In Ehud Shapiro, editor, Third International Conference on Logic Programming, LNCS 225, pages 69–83. Springer-Verlag, 1986.Google Scholar
  79. [79]
    E. Pontelli. Adventures in parallel logic programming, 1996. Available at http://www.cs.nmsu.edu/~epontell/adventure/.Google Scholar
  80. [80]
    J. Protic, M. Tomasevic, and V. Milutinovic. Distributed Shared Memory: Concepts and Systems. IEEE Parallel and Distributed Technolog, 4(2), 1996.Google Scholar
  81. [81]
    R. Rocha, F. Silva, and V. Santos Costa. YapOr: an Or-Parallel Prolog System based on Environment Copying. In 9th Portuguese Conference on Artificial Intelligence — EPIA 99, pages 178–192, September 1999.Google Scholar
  82. [82]
    V. Santos Costa. COWL: Copy-On-Write for Logic Programs. In Proceedings of the IPPS/SPDP99, pages 720–727. IEEE Computer Press, May 1999.Google Scholar
  83. [83]
    V. Santos Costa and R. Bianchini. Optimising Parallel Logic Programming Systems for Scalable Machines. In Proceedings of the EUROPAR’98, pages 831–841, Sep 1998.Google Scholar
  84. [84]
    V. Santos Costa, R. Bianchini, and I. C. Dutra. Parallel Logic Programming Systems on Scalable Architectures. Journal of Parallel and Distributed Computing, 60(7):835–852, 2000.CrossRefGoogle Scholar
  85. [85]
    V. Santos Costa, D. H. D. Warren, and R. Yang. Andorra-I: A Parallel Prolog System that Transparently Exploits both And- and Or-Parallelism. In Third ACM SIGPLAN Symposium on Principles & Practice of Parallel Programming, pages 83–93. ACM press, April 1991. SIGPLAN Notices vol 26(7), July 1991.CrossRefGoogle Scholar
  86. [86]
    V. Santos Costa, D. H. D. Warren, and R. Yang. The andorra-i preprocessor: Suporting full prolog on the basic andorra model. In 1991 International Conference on Logic Programming. MIT Press, June 1991.Google Scholar
  87. [87]
    M. Schneider. Links on objects and components/prolog, 1999. Available at http://www.cetus-links.org/oo_prolog.html.Google Scholar
  88. [88]
    E. SHAPIRO, editor. Concurrent Prolog—Collected Papers. MIT Press, 1987.Google Scholar
  89. [89]
    K. Shen. Exploiting And-parallelism in Prolog: the Dynamic Dependent And-parallel Scheme (DDAS). In Proceedings of the 1992 Joint International Conference and Symposium on Logic Programming, 1992.Google Scholar
  90. [90]
    K. Shen. Memory Management and Goal Scheduling for Parallel Execution Revisited. Internal Report, Bristol University, 1993.Google Scholar
  91. [91]
    K. Shen. Overview of DASWAM: Exploitation of Dependent Andparallelism. The Journal of Logic Programming, 29(1–3), 1996.Google Scholar
  92. [92]
    M. G. Silva, I. C. Dutra, R. Bianchini, and V. Santos Costa. The Influence of Computer Architectural Parameters on Parallel Logic Programming Systems. In Gopal Gupta, editor, Workshop on Practical Aspects of Declarative Languages (PADL99), LNCS 1551, pages 122–136, January 1999.Google Scholar
  93. [93]
    R. Y. Sindaha. Branch-Level Scheduling in Aurora: The Dharma Scheduler. PhD thesis, University of Bristol, Department of Computer Science, 1995.Google Scholar
  94. [94]
    D. A. Smith. MultiLog: Data Or-Parallel Logic Programming. In Proceedings of the Tenth International Conference on Logic Programming, pages 314–331. MIT Press, 1993.Google Scholar
  95. [95]
    L. Sterling and E. Shapiro. The Art of Prolog. MIT Press, 1994.zbMATHGoogle Scholar
  96. [96]
    J. Sunberg and C. Svensson. MUSE TRACE: A Graphic Tracer for OrParallel Prolog. Technical report, SICS, 1990.Google Scholar
  97. [97]
    J. Tanaka, K. Ueda, T. Miyazaki, A. Takeuchi, Y. Matsumoto, and K. Furukawa. Guarded Horn Clauses and Experiences with Parallel Programming. In 1986 Proceedings Fall Joint Computer Conference, pages 948–954. IEEE Computer Society Press, November 1986.Google Scholar
  98. [98]
    E. Tick. Compile Time Granularity Analysis for Parallel Logic Programming Systems. New Generation Computing, 7(2,3):325–337, 1990.CrossRefGoogle Scholar
  99. [99]
    K. Ueda and M. Morita. A New Implementation Technique for Flat GHC. In Proceedings of the Seventh International Conference on Logic Programming, pages 3–17. MIT Press, June 1990.Google Scholar
  100. [100]
    P. Van Roy. Can Logic Programming Execute as Fast as Imperative Programming ? PhD thesis, University of California at Berkeley, November 1990.Google Scholar
  101. [101]
    P. K. Vargas. Exploração de Paralelismo OU em uma Linguagem em Lógica com Restrições. Dissertação de mestrado, CPGCC — UFRGS, August 1998.Google Scholar
  102. [102]
    P. K. Vargas, J. L. V. Barbosa, D. N Ferrari, J. C. Kergomeaux, and C. F. R. Geyer. Distributed or scheduling with granularity information. In 12th Symposium on ComputerArchitecture and High Performance Computing, October 2000. to appear.Google Scholar
  103. [103]
    P. K. Vargas and C. F. R. Geyer. Introduzindo o paralelismo ou na programação em lógica com restrições. IX Simpósio Brasileiro de Arquitetura de Computadores e processamento de Alto Desempenho, 1997. Campos do Jordão, SP.Google Scholar
  104. [104]
    P. K. Vargas and C. F. R. Geyer. Uma politica de escalonamento distribuida no modelo pclp(fd) de exploração de paralelismo ou. XXIV Conferência Latino Americana de Informática/V Encontro Chileno de Computarão da Sociedade Chilena de Computação (CLEI — PANEL’98), 1998. Quito, Ecuador.Google Scholar
  105. [105]
    P. K. Vargas, C. F. R. Geyer, and I. C. Dutra. TAMAGOSHI — Plataforma para Avaliação de Escalonamento de Tarefas em Programação em Lógica Paralela. In X Simpósio Brasileiro de Arquitetura de Computadores e Processamento de Alto Desempenho, 1998. Búzios, RJ.Google Scholar
  106. [106]
    R. Vaupel, E. Pontelli, and G. Gupta. Visualization of And/Or-Parallel Execution of Logic Programs. In Proceedings of the Fourteenth International Conference on Logic Programming, pages 271–285, 1997.Google Scholar
  107. [107]
    K. Villaverde, H. Guo, E. Pontelli, and G. Gupta. Incremental stacksplitting. In Workshop on Parallelism and Implementation Technology for (Constraint) Logic Programming Languages, July 2000. In conjunction with the Intl. Conference on Computational Logic, 2000, London, England.Google Scholar
  108. [108]
    M. P. von Lahuizen. Parallel Logic Programming Techniques. Technical report, Deift University of Technology, PDS-1998–003, February 1998. Available at http://pds.twi.tudelft.nl/reports/.Google Scholar
  109. [109]
    D. H. D. Warren. An Abstract Prolog Instruction Set. Technical Note 309, SRI International, 1983.Google Scholar
  110. [110]
    D. H. D. Warren. Or-Parallel Execution Models of Prolog. In TAPSOFT’87, The 1987 International Joint Conference on Theory and Practice of Software Development, Pisa, Italy, pages 243–259. SpringerVerlag, March 1987.Google Scholar
  111. [111]
    D. H. D. Warren. The SRI model for or-parallel execution of Prolog— abstract design and implementation issues. In Proceedings of the 1987 Symposium on Logic Programming, pages 92–102, 1987.Google Scholar
  112. [112]
    D. H. D. Warren. The Extended Andorra Model with Implicit Control. Presented at ICLP’90 Workshop on Parallel Logic Programming, Eilat, Israel, June 1990.Google Scholar
  113. [113]
    R. Yang. P-Prolog a Parallel Logic Programming Language, volume 9. World Scientific, Singapore, 1987. Series in Computer Science.Google Scholar
  114. [114]
    R. Yang, A. Beaumont, I. Dutra, V. Santos Costa, and D. H. D. Warren. Performance of the Compiler-Based Andorra-I System. In Proceedings of the Tenth International Conference on Logic Programming, pages 150–166. MIT Press, June 1993.Google Scholar
  115. [115]
    R. Yang, V. Santos Costa, and D. H. D. Warren. The Andorra-I Engine: A parallel implementation of the Basic Andorra model. In Proceedings ofthe Eighth International Conference on Logic Programming, pages 825–839. MIT Press, 1991.Google Scholar

Copyright information

© Springer Science+Business Media Dordrecht 2002

Authors and Affiliations

  • Cláudio F. R. Geyer
    • 1
  • Patrícia Kayser Vargas
    • 1
  • Inês de Castro Dutra
    • 2
  1. 1.Instituto de Informática/UFRGSPorto AlegreBrasil
  2. 2.Department of Systems Engineering and Computer ScienceCOPPE/UFRJRio De JaneiroBrasil

Personalised recommendations