Parallel Processing and Program Transformations Division

Brief Description

This division of Phoenix Project work is developing algorithms that search for parallelism in order to reestructure existing code, finding suitable program transformations so that the existing parallelism can be explored. It's also the division that develops algorithms to automate the transformations, in other words, a computer program that aid applying program transformations in existing code. The main goal of this project is to obtain an automatic system for optimizing any given program; finding loop paralellism and maximizing data locality.

The data locality analisis is done by the Data Locality Division.

Parallel processing, basic topics

• Introduction, Portuguese HTML version
• Two Simple Examples, Portuguese HTML version

• Parallelism
  • David A. Bader's List of Parallel Computing Sites
  • The Stanford SUIF Compiler Group: Research Projects
• Unimodular Transformations
  • Implementation of Fourier-Motzkin Elimination

• Um Sistema para Otimização Automática de Paralelismo e Localidade de Dados, Portuguese HTML version, abstract with English version

• Pedro Vaz Artigas, artigas@lsi.usp.br

Laboratory of Integrated Systems

last modified: 25-sep-95