EFFICIENT MAPPINGS OF PYRAMID NETWORKS

We consider primarily the simulation of large networks by smaller ones -an important consideration, because interconnection networks are typi cally of a fixed size, and yet applications may employ networks of a l arger size. Current research (e.g., Dingle and Sudborough) describes m ethods to simulate common data structures and network architectures on the pyramid. However, these simulations assume that the pyramid grows with the size of the network or data structure. Because unbounded gro wth is not feasible, we address the issue of mapping several points of the guest data structure or network. to a single host processor. We d etermine how a small pyramid may efficiently simulate the computation of a larger pyramid as well as that of tree networks.