clarke@csri.toronto.edu (Jim Clarke) (04/14/89)
(GB = Galbraith Building, 35 St. George Street)
(SF = Sandford Fleming Building, 10 King's College Road)
SUMMARY:
SYSTEMS SEMINAR - Tues., May 2, 2 p.m. in GB 244 -- F.N. Parr
"Issues in Parallel Transaction Processing Systems"
COMBINATORICS SEMINAR - Wed., May 3, 3 p.m. in SF 1101 -- Reinhard Poschel
"Graphs and Algebras"
--------------
SYSTEMS SEMINAR - Tuesday, May 2, 2 p.m. in Room GB 244
F.N. Parr
IBM T.J. Watson Research Center
"Issues in Parallel Transaction Processing Systems"
This presentation reviews some of the problems inherent in high
performance transaction systems, and characterizes the approach
taken by current IBM transaction processing products.
Parallelism offers promise as a technique for achieving
significantly more powerful transaction and data base systems in
the future. Two approaches applying parallelism are discussed
and key research questions are identified.
COMBINATORICS SEMINAR - Wednesday, May 3, 3 p.m. in Room SF 1101
Reinhard Poschel
Academy of Sciences of GDR, Berlin
"Graphs and Algebras"
To every (directed) graph one can associate a so-called graph
algebra. These algebras allow us to describe and characterize
classes of graphs which can be defined by identities (equations).
A corresponding structure theorem will be given and some
applications will be discussed. For instance, every finite
undirected graph without loops is isomorphic to an induced
subgraph of a suitable finite direct power Go^m of the
undirected graph Go with two adjacent vertices 0, 1 and
one loop at vertex 1. The least m such that a graph can be
represented in this way is called its G-dimension.
Some upper and lower bounds for the G-dimension of a graph are
discussed.
(Remarks: The problem of determining the G-dimension of a graph
is NP-complete.)
--
Jim Clarke -- Dept. of Computer Science, Univ. of Toronto, Canada M5S 1A4
(416) 978-4058
clarke@csri.toronto.edu or clarke@csri.utoronto.ca
or ...!{uunet, pyramid, watmath, ubc-cs}!utai!utcsri!clarke