The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.10 - October (1994 vol.5)
pp: 1009-1017
ABSTRACT
<p>We consider primarily the simulation of large networks by smaller ones-an importantconsideration, because interconnection networks are typically of a fixed size, and yetapplications may employ networks of a larger size. Current research (Dingle andSudborough, 1993) describes methods to simulate common data structures and networkarchitectures on the pyramid. However, these simulations assume that the pyramid growswith the size of the network or data structure. Because unbounded growth is notfeasible, we address the issue of mapping several points of the guest data structure ornetwork to a single host processor. We determine how a small pyramid may efficientlysimulate the computation of a larger pyramid as well as that of tree networks.</p>
INDEX TERMS
Index Termsdata structures; graph theory; resource allocation; multiprocessor interconnectionnetworks; trees (mathematics); optimisation; pyramid network mapping; large networksimulation; small networks; interconnection networks; data structures; networkarchitectures; unbounded growth; single host processor; tree networks; graphembeddings; parallel networks; multiprocessors; communication cost; load balancing;simulation modelling
CITATION
A. Dingle, I.H. Sudborough, "Efficient Mappings of Pyramid Networks", IEEE Transactions on Parallel & Distributed Systems, vol.5, no. 10, pp. 1009-1017, October 1994, doi:10.1109/71.313118
15 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool