Routing in Interconnection Networks
OR/Group Theory Seminar
by Alison Thomson
Abstract: This talk is about routing in interconnection networks, which can be
modelled by considering a graph and a set of communication requests.
(Applications include parallel computing and the design of microchips). We
will discuss the parameters of a graph that are desirable for efficient
communication and how they can be calculated. As well as the notion of
diameter and shortest paths, the "load" on vertices and edges is also
crucial to good network design. Many successful interconnection networks
belong to the class of Cayley graphs, which have an underlying group
structure and are hence highly symmetric. We will explore some examples of
"good" interconnection network based on Cayley graphs.
For More Information: Mark Fackrell tel. 8344 8053 email: email@example.com