Relating goal scheduling, precedence, and memory management in and-parallel execution of logic programs

Hermenegildo, Manuel V. (1987). Relating goal scheduling, precedence, and memory management in and-parallel execution of logic programs. En: "Fourth International Conference on Logis Programming", May 25-29, 1987, Melbourne, Victoria, Australia. ISBN 0262121255.

Descripción

Título: Relating goal scheduling, precedence, and memory management in and-parallel execution of logic programs
Autor/es:
  • Hermenegildo, Manuel V.
Tipo de Documento: Ponencia en Congreso o Jornada (Artículo)
Título del Evento: Fourth International Conference on Logis Programming
Fechas del Evento: May 25-29, 1987
Lugar del Evento: Melbourne, Victoria, Australia
Título del Libro: Logic programming, Proceedings of the Fourth International Conference
Fecha: Mayo 1987
ISBN: 0262121255
Materias:
Palabras Clave Informales: Logic programming, parallel processing, and-paralelism, Scheduling, Memory management, Coroutining, Prolog, Programación lógica, procesamiento paralelo, Programación, Gestión de la memoria.
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 (809kB) | Vista Previa

Resumen

The interactions among three important issues involved in the implementation of logic programs in parallel (goal scheduling, precedence, and memory management) are discussed. A simplified, parallel memory management model and an efficient, load-balancing goal scheduling strategy are presented. It is shown how, for systems which support "don't know" non-determinism, special care has to be taken during goal scheduling if the space recovery characteristics of sequential systems are to be preserved. A solution based on selecting only "newer" goals for execution is described, and an algorithm is proposed for efficiently maintaining and determining precedence relationships and variable ages across parallel goals. It is argued that the proposed schemes and algorithms make it possible to extend the storage performance of sequential systems to parallel execution without the considerable overhead previously associated with it. The results are applicable to a wide class of parallel and coroutining systems, and they represent an efficient alternative to "all heap" or "spaghetti stack" allocation models.

Más información

ID de Registro: 14531
Identificador DC: http://oa.upm.es/14531/
Identificador OAI: oai:oa.upm.es:14531
Depositado por: Biblioteca Facultad de Informatica
Depositado el: 21 Feb 2013 08:14
Ultima Modificación: 21 Abr 2016 14:14
  • 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