A comparative study of methods for automatic compile-time parallelization of logic programs


Autoria(s): Bueno Carrillo, Francisco; García de la Banda, M.; Hermenegildo, Manuel V.
Data(s)

1994

Resumo

This paper presents a study of the effectiveness of three different algorithms for the parallelization of logic programs based on compile-time detection of independence among goals. The algorithms are embedded in a complete parallelizing compiler, which incorporates different abstract interpretation-based program analyses. The complete system shows the task of automatic program parallelization to be practical. The trade-offs involved in using each of the algorithms in this task are studied experimentally, weaknesses of these identified, and possible improvements discussed.

Formato

application/pdf

Identificador

http://oa.upm.es/14431/

Idioma(s)

eng

Publicador

Facultad de Informática (UPM)

Relação

http://oa.upm.es/14431/1/HERME_ARC_1994-3.pdf

Direitos

http://creativecommons.org/licenses/by-nc-nd/3.0/es/

info:eu-repo/semantics/openAccess

Fonte

Parallel Symbolic Computation | First International Symposium Parallel Symbolic Computation | September 26 -- 28, 1994 | Linz - Austria

Palavras-Chave #Informática
Tipo

info:eu-repo/semantics/conferenceObject

Ponencia en Congreso o Jornada

PeerReviewed