@device(postscript)
@libraryfile(Mathematics10)
@libraryfile(Accents)
@style(fontfamily=timesroman,fontscale=11)
@pagefooting(immediate, left "@c<Technical Report 1996>",
center "@c<Computer Science>",
right "@c<Carnegie Mellon>")
@heading(Compiling Recurrent and Irregular Serial Code
for High Performance Computers)
@heading(CMU-CS-96-200)
@center(@b(Anwar Mohammed Ghuloum))
@center(November 1996 - Ph.D. Thesis)
@center(FTP: Unavailable)
@blankspace(1)
@begin(text)

This dissertation uses existing models of control and data dependence
and flow as a starting point for investigating one new analysis model.
We focus on an important program in automatically parallelizing serial
code: recurrent and irregular code. Recurrent and irregular code play
an important role in many scientific codes, as well as many sorting,
geometric, and symbolic applications.  No general techniques existed
prior to this dissertation for automatically parallelizing such code.
The extent of current techniques to deal with recurrent loops in
automatic parallelization is to simply search for 'familiar' patterns
of common loops in the source code.  This dissertation will demonstrate,
through a relatively simple semantic interpretation of loop bodies, the
added power of a small amount of higher-level reasoning in an
automatically parallelizating compiler.

@blankspace(2line)
@begin(transparent,size=10)
@b(Keywords:@ )@c<Compilers, parallelization, automatic parallelization,
high performance computing, fortran, recurrence, irregularity>
@end(transparent)
@blankspace(1line)
@end(text)
@flushright(@b[(206 pages)])