Issue No. 02 - February (1995 vol. 6)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/71.342130
<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 <math><tmath>$n$</tmath></math>-cubes, <math><tmath>$k$</tmath></math>-ary <math><tmath>$n$</tmath></math>-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>
V. V. Dimakopoulos and N. J. Dimopoulos, "Optimal and Suboptimal Processor Allocation for Hypercycle-based Multiprocessors," in IEEE Transactions on Parallel & Distributed Systems, vol. 6, no. , pp. 175-185, 1995.