Parallelism Extraction In Acyclic Code
Welcome to the Web pages of the article entitled
Parallelism Extraction In Acyclic Code, presented in the
4'th Euromicro Workshop on Parallel and Distributed
Processing held in Braga, Portugal, January 24-26th 1996.
Table of Contents
The algorithm was actually implemented and integrated into a
prototype parallelizing compiler for the
ANDF program distribution format.
(ANDF stands for Architecture Neutral Distribution
Format, a technology adopted by
OSF
for distributing programs in a binary format.)
The
"Some experimental results"
section is not available in the article due to space limitations.
This work was partially funded by
ESPRIT PROJECT OMI/GLUE 6062,
and by INESC.
This article was written by:
João Paulo Luís
(joao.luis@pdmfc.com)
Carlos Gonçalvez Carvalho
(cgc@inesc.pt)
José Carlos Delgado
(jcd@inesc.pt)
In this article we describe a framework for parallelism extraction and
partitioning in acyclic code regions. This framework is an extension
of Milind Girkar's work on functional parallelism, using a
Petri net
model to represent parallel code, and applying modified optimization
techniques to minimize the overheads of explicit synchronization. The
modifications introduced are directed towards the generation of
efficient multi-threaded code. We also describe a simple partitioning
technique that can be used to artificially increase the granularity of
the extracted parallelism up to a desired level.
Keywords
parallelizing compilers, functional parallelism, partitioning
The complete article (including the abstract) is available
as a PDF file (248KB) /
Compressed
PostScript file (139 KB).
These pages are a backup of the original site available at INESC.
Modified 2023-Jun-22 to repair some broken links.
Modified 2012-Apr-17 to update contact of João Luís.
Modified last on 2000-Oct-28, removing outdated links.
Please contact
joao.luis@pdmfc.com
for more information.