Zhu Qiang

The optical transpose interconnection system (OTIS) is a new kind of optoelectronic computer structure, in which processors are divided into several groups, the processors in the same group are connected by electronic interconnects, while the processors in different groups are linked by optical interconnects. This paper considers an OTIS with a connected graph G as a basic module, and show that its diameter is 2d+1 if G has diameter d, and its connectivity is k if G has both minimum degree and connectivity k. Provided that G has a routing (broadcasting) algorithm, we can construct a routing (broadcasting) algorithm of the OTIS-G. And we also show that if the routing (broadcasting) algorithm of G is a shortest routing (an optimum broadcasting) algorithm, then the constructed routing (broadcasting) algorithm is also a shortest routing (an optimum broadcasting) algorithm.