This is joint work with Bella Bose, School of EECS, OSU.
Because of physical limitations on the processing speed of sequential computers, high-performance systems increasingly rely on parallel machines. Consequently, the study of interconnection networks and their underlying topologies has become an integral part of the design of computer architectures.
An interconnection network is modeled by a simple connected graph whose nodes are the processors and edges are the system links. In this talk we concentrate on two kinds of networks developed in the 1990s by Klaus Huber, a researcher at Deutsche Bundespost Telekom. We will explain how mathematics can be used to obtain answers to some design questions, among them: optimal placement of scarce resources, efficient routing and communication algorithms.