Hypergraph based topological design of large multibus systems

The topological design of multibus systems is considered. The problem consists of finding a system with as many processing elements (PEs) as possible under constraints on the number of PE ports, the number of PEs connected to the same bus and the system diameter. Earlier works on this subject used either combinational structures (e.g., balanced incomplete block designs, or BIBDs), or graph theory. The authors use a very natural approach to this problem, namely hypergraph theory. They present two methods to construct hypergraphs with diameter one and two. Finally, the authors develop a technique, called hypermultiplication, to build up larger hypergraphs from smaller ones, with a small increase of the diameter