Towards a High-Level Implementation of Execution Primitives for Unrestricted, Independent And-Parallelism

Casas, Amadeo and Carro Liñares, Manuel and Hermenegildo, Manuel V. (2008). Towards a High-Level Implementation of Execution Primitives for Unrestricted, Independent And-Parallelism. In: "10th International Symposium on Practical Aspects of Declarative Languages, PADL'08", 07/01/2008-08/01/2008, San Francisco, USA. ISBN 978-3-540-77441-9.

Description

Title: Towards a High-Level Implementation of Execution Primitives for Unrestricted, Independent And-Parallelism
Author/s:
  • Casas, Amadeo
  • Carro Liñares, Manuel
  • Hermenegildo, Manuel V.
Item Type: Presentation at Congress or Conference (Article)
Event Title: 10th International Symposium on Practical Aspects of Declarative Languages, PADL'08
Event Dates: 07/01/2008-08/01/2008
Event Location: San Francisco, USA
Title of Book: Proceedings of 10th International Symposium on Practical Aspects of Declarative Languages, Practical aspects of declarative languages, PADL'08
Date: 7 January 2008
ISBN: 978-3-540-77441-9
Subjects:
Freetext Keywords: Parallelism, Virtual Machines, High-level Implementation.
Faculty: Facultad de Informática (UPM)
Department: Lenguajes y Sistemas Informáticos e Ingeniería del Software
Creative Commons Licenses: Recognition - No derivative works - Non commercial

Full text

[img]
Preview
PDF - Requires a PDF viewer, such as GSview, Xpdf or Adobe Acrobat Reader
Download (206kB) | Preview

Abstract

Most efficient implementations of parallel logic programming rely on complex low-level machinery which is arguably difficult to implement and modify. We explore an alternative approach aimed at taming that complexity by raising core parts of the implementation to the source language level for the particular case of and-parallellism. We handle a significant portion of the parallel implementation at the Prolog level with the help of a comparatively small number of concurrency.related primitives which take case of lower-level tasks such as locking, thread management, stack set management, etc. The approach does not eliminate altogether modifications to the abstract machine, but it does greatly simplify them and it also facilitates experimenting with different alternatives. We show how this approach allows implementing both restricted and unrestricted (i.e., non fork-join) parallelism. Preliminary esperiments show thay the performance safcrifieced is reasonable, although granularity of unrestricted parallelism contributes to better observed speedups.

More information

Item ID: 4369
DC Identifier: http://oa.upm.es/4369/
OAI Identifier: oai:oa.upm.es:4369
Official URL: http://www.ist.unomaha.edu/padl2008/
Deposited by: Memoria Investigacion
Deposited on: 30 Sep 2010 08:55
Last Modified: 20 Apr 2016 13:37
  • Logo InvestigaM (UPM)
  • Logo GEOUP4
  • Logo Open Access
  • Open Access
  • Logo Sherpa/Romeo
    Check whether the anglo-saxon journal in which you have published an article allows you to also publish it under open access.
  • Logo Dulcinea
    Check whether the spanish journal in which you have published an article allows you to also publish it under open access.
  • Logo de Recolecta
  • Logo del Observatorio I+D+i UPM
  • Logo de OpenCourseWare UPM