CGL Meeting Agenda

Wednesday, June 10, 1998


Location:
DC 1304
Time:
1:30
Chair:
Dan Milgram

1. Adoption of the Agenda - additions or deletions

2. Coffee Hour

Coffee hour this week:
Any volunteers?
Coffee hour next week:
Any volunteers?

3. Next meeting

Date:
Wednesday, June 17, 1998
Location:
DC 1304
Time:
1:30
Chair:
Liddy Olds (June 17th) :-)
Technical presentation:
Nathan Litke (June 17th) :-(

4. Forthcoming

Chairs:
  1. Mark Riddell (June 24th) :-)
  2. Ian Stewart
  3. Viet Tam Luu ? Clara Tsang
Tech Presenters:
  1. Marryat Ma (June 24th) :-(
  2. Michael McCool (July 1st) :-(
  3. Dan Milgram

5. Technical Presentations

Presenter:
Stephen Mann:-)
Title:
An Improved Parametric Side-Vertex Triangle Mesh Interpolant
Abstract:
There are many schemes for fitting triangular surface patches
to a triangular net of data. In general, local schemes
produce surfaces with poor surface quality. Although variational
techniques construct surfaces of higher quality, such techniques
tend to be computationally expensive. In this paper, I will
present modifications to Nielson's side-vertex method that improve
its surface quality without resorting to variational techniques.

6. General Discussion Items

7. Action List

8. Director's Meeting

9. Seminars

DEPARTMENT OF COMPUTER SCIENCE

UNIVERSITY OF WATERLOO
SEMINAR ACTIVITIES

COMPUTER SCIENCE SEMINAR

-Tuesday, May 12, 1998

Daniela Rosu, Georgia Institute of Technology, will
speak on ``FARA - A Framework for Dynamic Resource
Allocation for Adaptive Real-Time Applications''.

TIME: 10:30-12:00 noon

ROOM: DC 1302

ABSTRACT

Runtime adaptation and resource allocation (ARA)
decisions are required in both embedded and open
systems when a new application arrives into the system
or when a change occurs in the resource availability or
in the resource needs of a currently active
application. Previous research concerning on-line
adaptation for real-time applications has only been
interested in achieving acceptable steady state
performance. We submit that on-line adaptation
decisions must also consider the performance of the
application during its transition to the targeted
steady state. This is because ARA decisions might
result in delays and overheads that can affect the
application performance during transition times.

FARA is a Framework for Adaptation and Resource
Allocation that addresses the overall impact of ARA
decisions on application performance. FARA is designed
to support the development of resource allocation
infrastructures in systems running multiple independent
applications. FARA enables the development of
allocation and adaptation heuristics that result in
steady state improvements while exhibiting low decision
and enactment overheads. This is achieved by using rich
information about the adaptation capabilities of each
application in the system and by using effective
mechanisms for decision support.

The talk will present the models and mechanisms
embedded in FARA and the manner in which they can be
used to reduce the impact of ARA decisions on
application performance during the transition to the
targeted steady state.

-------------------------------------------------------
Unix Tutorial Part II

Unix Shell Basics
Now that you are able to send mail and read news all around the world,
you want to get more from your UNIX account. Let us show you how to get
Unix to do more work for you!
This tutorial is intended for users with some experience with UNIX and
will be held in an X-terminal lab so that participants can immediately
experiment with the material being discussed. Upon your completion of this
tutorial, you will be able to use files, directories, redirection, pipes,
and apply filters. Also, some of the advanced command-line features of tcsh
will be revealed.
Math students should be sure to have their accounts activated in MC3011,
and temporary accounts will be available to non-math students.

Tuesday 9 June and Thursday 11 June, 1998
18:00
MC 3006

All are welcome.

oo$$$$$ooo o$$$$$oo$$$$$oo
o$$"" $$$" o$$"" $$$$$$ ""$$o C O M P U T E R
o$$ $$" $$" o$" "$$ $$o
$$ $$ $$o $$ $$o $$ S C I E N C E
$$o "$$ $$ o$$ $$ $$
$$o "$o $$" o$$ o$$ o$$" C L U B
"$$ooo$$$$$$ooo$$" $$$$ooo$$$

A Student Chapter of the ACM

10. Lab Cleanup