A proposal for a flexible scheduling and memory management scheme for non-deterministic, andparallel execution of logic programs

Shen, Kish y Hermenegildo, Manuel V. (1994). A proposal for a flexible scheduling and memory management scheme for non-deterministic, andparallel execution of logic programs. Monografía (Informe Técnico). Facultad de Informática (UPM) [antigua denominación], Madrid, Spain.

Descripción

Título: A proposal for a flexible scheduling and memory management scheme for non-deterministic, andparallel execution of logic programs
Autor/es:
  • Shen, Kish
  • Hermenegildo, Manuel V.
Tipo de Documento: Monográfico (Informes, Documentos de trabajo, etc.) (Informe Técnico)
Fecha: Junio 1994
Materias:
Escuela: Facultad de Informática (UPM) [antigua denominación]
Departamento: Inteligencia Artificial
Licencias Creative Commons: Reconocimiento - Sin obra derivada - No comercial

Texto completo

[img]
Vista Previa
PDF (Document Portable Format) - Se necesita un visor de ficheros PDF, como GSview, Xpdf o Adobe Acrobat Reader
Descargar (1MB) | Vista Previa

Resumen

In this paper, we examine the issue of memory management in the parallel execution of logic programs. We concentrate on non-deterministic and-parallel schemes which we believe present a relatively general set of problems to be solved, including most of those encountered in the memory management of or-parallel systems. We present a distributed stack memory management model which allows flexible scheduling of goals. Previously proposed models (based on the "Marker model") are lacking in that they impose restrictions on the selection of goals to be executed or they may require consume a large amount of virtual memory. This paper first presents results which imply that the above mentioned shortcomings can have significant performance impacts. An extension of the Marker Model is then proposed which allows flexible scheduling of goals while keeping (virtual) memory consumption down. Measurements are presented which show the advantage of this solution. Methods for handling forward and backward execution, cut and roll back are discussed in the context of the proposed scheme. In addition, the paper shows how the same mechanism for flexible scheduling can be applied to allow the efficient handling of the very general form of suspension that can occur in systems which combine several types of and-parallelism and more sophisticated methods of executing logic programs. We believe that the results are applicable to many and- and or-parallel systems.

Más información

ID de Registro: 15211
Identificador DC: http://oa.upm.es/15211/
Identificador OAI: oai:oa.upm.es:15211
URL Oficial: ftp://clip.dia.fi.upm.es/pub/papers/PARFORCE/first_review/DIRECTORY.html
Depositado por: Biblioteca Facultad de Informatica
Depositado el: 08 May 2013 07:27
Ultima Modificación: 21 Abr 2016 15:12
  • Open Access
  • Open Access
  • Sherpa-Romeo
    Compruebe si la revista anglosajona en la que ha publicado un artículo permite también su publicación en abierto.
  • Dulcinea
    Compruebe si la revista española en la que ha publicado un artículo permite también su publicación en abierto.
  • Recolecta
  • e-ciencia
  • Observatorio I+D+i UPM
  • OpenCourseWare UPM