🚀 go-pugleaf

DEPARTMENT OF COMPUTER SCIENCE
UNIVERSITY OF WATERLOO
SEMINAR ACTIVITIES

PROGRAMMING LANGUAGES SEMINAR

                    -Thursday, February 15, 1990

Laurie  Hendren, will speak on ``Parallelizing Programs
with Recursive Data Structures.''

TIME:                 3:30  p.m.

ROOM:                 DC 1304

ABSTRACT

Interference  estimation is a useful tool in developing
parallel  programs and is a key aspect of automatically
parallelizing    sequential    programs.   Interference
analysis  and  disambiguation  mechanisms  for programs
with  simple  data  types  and  arrays  have  become  a
standard   part   of   parallelizing   and  vectorizing
compilers.    However,   efficient   and  implementable
techniques for interference analysis in the presence of
dynamic data structures have yet to be developed.

We  have  been  addressing  the  problem  of estimating
interference  and parallelizing programs in the setting
of  an  imperative  language that supports dynamic data
structures.    By  focusing  on  analysis  methods  for
recursively-defined  pointer  data  structures  such as
trees    and   DAGs,   we   developed   efficient   and
implementable    interference    analysis   tools   and
parallelization techniques.

In  this  talk,  I  will  present  an  overview  of the
approach including:
(1)  an  introduction to the problem, 
(2) a description of the interference analysis tools
    of the interference analysis tools and
    parallelization  techniques,  and  
(3) a summary of some results from experiments on
    the BBN Butterfly.