This talk will discuss these historical trends and the current situation
and will attempt to extrapolate into the future of document processing
and markup.
DEPARTMENT OF COMPUTER SCIENCE
UNIVERSITY OF WATERLOO
SEMINAR ACTIVITIES
DISTRIBUTED SYSTEMS SEMINAR
-Wednesday, Dec. 3, 1997
Paul A.S. Ward, graduate student, Dept. Comp. Sci.
University of Waterloo, will speak on ``Towards an
Efficient Representation of Partial Orders''.
TIME: 2:30-3:30 p.m.
ROOM: DC 1304
ABSTRACT
Distributed computations can be represented as
partially ordered sets where the elements of the set
represent events in the computation and the partial
order is the transitive closure of communication in
the computation. As such it is extremely important
to be able to manipulate partial orders efficiently.
In particular, it is desirable that each element
in the partial order be rapidly comparable with any
other element in the partial order. Existing
techniques for achieving this require that each element
be timestamped with a logical vector timestamp of
length equal to the number of threads (or other
concurrent entities) in the computation. However, it
is theoretically possible to use timestamp vectors
with length no bigger than the dimension of the
partial order. Although the dimension can, in
theory, be as large as the number of threads the
communication patterns implied by the proof are
unlikely to occur in a distributed computation. We
therefore wished to develop an understanding of
the size of the dimension in typical distributed
computations. We will describe the algorithms that
we have developed to achieve this and some of the
proofs they rest upon. A solid understanding of
partial-order theory is NOT required. All of the
necessary theoretical background will be covered in
the talk.
Friday, December 12, 1997
Ph.D. Oral Defence
``Performance Optimization for Distributed-Shared-Data Systems''
Craig Steven Bruce, CS Grad (Supervisor: D.J. Taylor)
9:30 a.m.; MC6091A