CGL Meeting Agenda

Wednesday, July 26, 1995

Location:: DC 1304
Time:: 1:30 PM
Chair:: Saar Friedman

1. Adoption of the agenda - additions/deletions thereto.

2. Coffee Hour and Next Meeting:

Coffee hour this week:

???

Coffee hour next week:

???

Next Meeting

Date:: August 2, 1995
Time:: 1:30 PM
Location:: DC 1304
Chair:: Wolfgang Heidrich
Tech Presentation:: Don Dragomatz

Forthcoming: (list next 4 and trades)

Chairs:: Wofgang Heidrich; Fabrice Jaubert; Rick Kazman; Nathan Konrad
Tech presentations:: Don Dragomatz; Nicolas Durand; Saar Friedman; Wolfgang Heidrich

3. Technical Presentation:

Presenter:

Ed Dengler

Title:

4. General Discussion Items:

5. Action List (remember to update AL_active)

nothing

6. Directors Meeting:

7. Seminar(s):

DEPARTMENT OF COMPUTER SCIENCE UNIVERSITY OF WATERLOO SEMINAR ACTIVITIES MASTER'S THESIS PRESENTATION -Thursday, July 27, 1995 Liyuan (Lee) Qiao, Department of Computer Science, University of Waterloo will speak on "Performance Visualization Tools for Parallelizing Computer Algebra Algorithms". TIME: 3:30-4:30 p.m. ROOM: DC 1304 ABSTRACT In this thesis we study the use of visualization tools to obtain performance improvements for parallelizing algorithms for computer algebra. We combine a performance visualization system, ParaGraph, with the computer algebra system Sugarbush. The latter is a parallel version of Maple that is built on top of C/Linda. We illustrate our work by parallelizing several time- consuming applications from computer algebra. We show how to use the ParaGraph tools to identify parts of the programs where parallelization can be improved. We conclude that graphical visualization is an excellent way to analyze the performance of parallel programs. DEPARTMENT OF COMPUTER SCIENCE UNIVERSITY OF WATERLOO SEMINAR ACTIVITIES THEORY SEMINAR -Wednesday, July 26, 1995 Xin He, Department of Computer Science, State University of New York at Buffalo, will speak on "Grid Embedding of 4-Connected Plane Graphs". TIME: 2:30 p.m. - 3:30 p.m. ROOM: DC 1302 ABSTRACT A straight line grid embedding of a plane graph G is a - drawing of G such that the vertices are drawn at grid - points and the edges are drawn as non-intersecting straight line segments. It is known that every n-vertex plane graph can be embedded on an (n-1) x (n-1) - -- - -- grid. There exist planar graphs G such that, for every - grid embedding of G, each dimension of the grid is at least 2n/3, even if the other dimension of the grid is -- allowed to be unbounded. It has been conjectured that every n-vertex plane graph can be embedded on a 2n/3 x 2n/3 grid. -- - -- In this talk, we show that, for a 4-connected plane graph G with at least 4 vertices on its exterior face, - G can be embedded on a W x H grid, such that ----- W+H