Parallelizing irregular and pointer-based computations automatically: perspectives from logic and constraint programming

Hermenegildo, Manuel V. (2000). Parallelizing irregular and pointer-based computations automatically: perspectives from logic and constraint programming. "Parallel computing", v. 26 (n. 13-14); pp. 1685-1708. ISSN 0167-8191. https://doi.org/10.1016/S0167-8191(00)00051-X.

Descripción

Título: Parallelizing irregular and pointer-based computations automatically: perspectives from logic and constraint programming
Autor/es:
  • Hermenegildo, Manuel V.
Tipo de Documento: Artículo
Título de Revista/Publicación: Parallel computing
Fecha: 2000
Volumen: 26
Materias:
Palabras Clave Informales: Cost analysis, Pointer aliasing analysis, Granularity control, Irregular computations, Automatic parallelization
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

Irregular computations pose sorne of the most interesting and challenging problems in automatic parallelization. Irregularity appears in certain kinds of numerical problems and is pervasive in symbolic applications. Such computations often use dynamic data structures, which make heavy use of pointers. This complicates all the steps of a parallelizing compiler, from independence detection to task partitioning and placement. Starting in the mid 80s there has been significant progress in the development of parallelizing compilers for logic pro­gramming (and more recently, constraint programming) resulting in quite capable paralle­lizers. The typical applications of these paradigms frequently involve irregular computations, and make heavy use of dynamic data structures with pointers, since logical variables represent in practice a well-behaved form of pointers. This arguably makes the techniques used in these compilers potentially interesting. In this paper, we introduce in a tutoríal way, sorne of the problems faced by parallelizing compilers for logic and constraint programs and provide pointers to sorne of the significant progress made in the area. In particular, this work has resulted in a series of achievements in the areas of inter-procedural pointer aliasing analysis for independence detection, cost models and cost analysis, cactus-stack memory management, techniques for managing speculative and irregular computations through task granularity control and dynamic task allocation such as work-stealing schedulers), etc.

Más información

ID de Registro: 13286
Identificador DC: http://oa.upm.es/13286/
Identificador OAI: oai:oa.upm.es:13286
Identificador DOI: 10.1016/S0167-8191(00)00051-X
URL Oficial: http://www.sciencedirect.com/science/article/pii/S016781910000051X
Depositado por: Biblioteca Facultad de Informatica
Depositado el: 25 Sep 2012 06:54
Ultima Modificación: 21 Abr 2016 12:36
  • 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