TY  - CONF
N2  - This paper presents a study of the effectiveness of global analysis in the parallelization of logic programs using strict independence. A number of well-known approximation domains are selected and tlieir usefulness for the application in hand is explained. Also, methods for using the information provided by such domains to improve parallelization are proposed. Local and global analyses are built using these domains and such analyses are embedded in a complete parallelizing compiler. Then, the performance of the domains (and the system in general) is assessed for this application through a number of experiments. We argüe that the results offer significant insight into the characteristics of these domains, the demands of the application, and the tradeoffs involved.
TI  - Effectiveness of global analysis in strict independence-based automatic program parallelization
M2  - Ithaca, New York
PB  - MIT Press
ID  - upm14428
EP  - 686
T2  - 1994 International Symposium on Logic programming
CY  - Cambridge, MA, USA
SN  - 0262521911
Y1  - 1994///
AV  - public
A1  - Bueno Carrillo, Francisco
A1  - García de la Banda, M.
A1  - Hermenegildo, Manuel V.
UR  - https://oa.upm.es/14428/
ER  -