Search

In this paper we study the square grid area required for laying out H[sub l], the Boolean hypercube of N=2[sup l] vertices. It is shown that this area is [formula]. We describe a layout which occupies this much area and prove that no layout of less area exists. [ABSTRACT FROM AUTHOR]

In this paper, we consider the problem of constructing a multicast tree in star interconnection networks under the single-port communication model. Unlike previous schemes for constructing space-efficient multicast trees, we adopt the completion time of each multicast as the objective function to be minimized. In particular, we study a special case of the problem in which all destination vertices are immediate neighbors of the source vertex, and propose a multicast scheme of [formula] time units for the star graph of dimension n. [ABSTRACT FROM AUTHOR]