Felix P. Muga II
Department of Mathematics
Ateneo de Manila University
http://doi.org/10.57043/transnastphl.1999.5775
Abstract
A fundamental consideration in the design of massively parallel and distributed computer systems is the topology of the processors (or the vertices, in graph theory). Well accepted designs are those that can be recursively decomposed, providing a way for the implementation of recursive algorithms. Hierarchical networks are recursively decomposable. In this paper, we examined the conditions for a network to be hierarchical. We limited our study to undirected and connected circulant networks.