Workshop on Compilation of (Symbolic) Languages for Parallel Computers

tick@cs.uoregon.edu (evan tick)
Wed, 16 Oct 1991 21:36:38 GMT

          From comp.compilers

Related articles
Workshop on Compilation of (Symbolic) Languages for Parallel Computers tick@cs.uoregon.edu (1991-10-16)
| List of all articles for this month |

Newsgroups: comp.compilers,comp.lang.functional,comp.lang.prolog,comp.parallel
From: tick@cs.uoregon.edu (evan tick)
Keywords: conference, parallel
Organization: Department of Computer Science, University of Oregon
Date: Wed, 16 Oct 1991 21:36:38 GMT

Workshop on Compilation of (Symbolic) Languages for Parallel Computers
San Diego, October 31st -- November 1st, 1991.


Ian Foster and Evan Tick (Organizers)
           (foster@mcs.anl.gov and tick@cs.uoregon.edu)




Thursday, Oct 31st


1:20 Welcome and Introductions


1:30 Interfacing Performance Measurement Capabilities into
          a Parallel Language Compiler
          Carl Kesselman


2:00 Message-Oriented Parallel Implementation of Flat GHC
          Kazunori Ueda


2:30 An Overview of the Fortran D Programming System
          Charles Koelbel


3:00 Break


3:30 OSCAR Fortran Compiler
          Hironori Kasahara


4:00 Coordination Language Design and Implementation Issues
          Steve Lucco


4:30 Break


5:00 Designing Imperative Programming Languages for
          Analyzability: Parallelism and Pointer Structures
          Laurie Hendren


5:30 Compile-Time Parallelization of Prolog
          Hakan Millroth


Friday, November 1st


  8:30 A New Method for Compile-Time Granularity Analysis
            Evan Tick


  9:00 GST: Grain-Size Transformations for Efficient
            Execution of Symbolic Programs
            Andrew Chien


  9:30 Break


10:00 Using Domain-Specific, Abstract Parallelism
            Ira Baxter


10:30 Applying Abstract Interpretation to Identify
            Vectorizable Numerical Code in Logic Programs
            Arvind Bansal


11:00 Break


11:30 Data Locality
            Monica Lam


12:00 Compiling FP for Data-Parallel Systems
            Clifford Walinsky


12:30 Lunch


  1:30 Improving Compilation of Implicit Parallel Programs by
            using Runtime Information
            John Sargeant


  2:00 Generalized Iteration Space and the Parallelization of
            Symbolic Programs
            Luddy Harrison


  2:30 Break


  3:00 Dataflow Analysis of Concurrent Logic Languages
            Will Winsborough


  3:30 Compiler Support for the Refinement and Composition of
            Process Structures
            Ian Foster


  4:00 General Discussion


  4:00 Finish
--


Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.