Issue No. 01 - January (1991 vol. 2)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/71.80186
<p>An efficient processor allocation policy is presented for hypercube computers. The allocation policy is called free list since it maintains a list of free subcubes available in the system. An incoming request of dimension k (2/sup k/ nodes) is allocated by finding a free subcube of dimension k or by decomposing an available subcube of dimension greater than k. This free list policy uses a top-down allocation rule in contrast to the bottom-up approach used by the previous bit-map allocation algorithms. This allocation scheme is compared to the buddy, gray code (GC), and modified buddy allocation policies reported for the hypercubes. It is shown that the free list policy is optimal in a static environment, as are the other policies, and it also gives better subcube recognition ability compared to the previous schemes in a dynamic environment. The performance of this policy, in terms of parameters such as average delay, system utilization, and time complexity, is compared to the other schemes to demonstrate its effectiveness. The extension of the algorithm for parallel implementation, noncubic allocation, and inclusion/exclusion allocation is also given.</p>
top-down processor allocation scheme; hypercube computers; free list; bottom-upapproach; gray code; buddy allocation; average delay; system utilization; timecomplexity; parallel implementation; noncubic allocation; inclusion/exclusion allocation;hypercube networks; parallel processing
J. Kim, W. Lin and C. Das, "A Top-Down Processor Allocation Scheme for Hypercube Computers," in IEEE Transactions on Parallel & Distributed Systems, vol. 2, no. , pp. 20-30, 1991.