ABSTRACT
<p><it>Abstract—</it>Allocating nodes in a concurrent computer system depends on the topology of the system. In this work, we present a number of processor allocation strategies for Hypercycle based concurrent systems. Hypercycles is a class of multidimensional interconnection networks which includes such widely used networks as the binary $<tmath>n</tmath>$-cubes, $<tmath>k</tmath>$-ary $<tmath>n</tmath>$-cubes, generalized hypercubes etc. The allocation strategies presented include a statically optimal first-fit allocation, a suboptimal-first fit, and strategies with extended search space through the inclusion of additional search lists formed by permuting the base through which a hypercycle is defined. For all these strategies, we examine their optimality and present simulation results characterizing their performance relative to each other.</p>
INDEX TERMS
CITATION
Vassilios V. Dimakopoulos, Nikitas J. Dimopoulos, "Optimal and Suboptimal Processor Allocation for Hypercycle-based Multiprocessors", IEEE Transactions on Parallel & Distributed Systems, vol. 6, no. , pp. 175-185, February 1995, doi:10.1109/71.342130
CITATIONS
SHARE
172 ms
(Ver 3.3 (11022016))