Binary tree layouts with adequate I/O support

The binary tree-based parallel system is suitable for VLSI/WSI implementation due to its simple and regular interconnection pattern among processors. The support of adequate I/O bandwidth in a large parallel system is essential because, otherwise, the system speed gets limited eventually by the I/O operations. In a tree-based system, I/O operations are efficiently carried out through the root and the leaf nodes. A way is presented to systematically generate a tree layout with a sufficient number of leaf nodes on the boundary to support required I/O bandwidth, while maintaining a low area increase and moderate growth in maximum link length. This technique is particularly useful for large-sized binary tree layouts.<>