An Efficient Processor Allocation Scheme fer Hypercubes


The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 3, No. 4, pp. 781-790, Jul. 1996
10.3745/KIPSTE.1996.3.4.781,   PDF Download:

Abstract

Processors must be allocated to incoming tasks in a way that will maximize the processor utilization and minimize the system fragmentation. Thus, an efficient method of allocating processors in a hypercube is o key to system performance. In order to achive this goal, it is necessary to detect the availability of a subcube of required size and merge the released small cubes to form a lager ones. This paper presents the tree-exchange algorithm which determines the levels and parters of the binary tree representation of a hypercube, and an efficient allocation strategy using the algorithm. The complexity for search time of the algorithm is O[n/2]*2n and it shows good performance in comparison with other strategies.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
S. Y. Ek and N. J. Yeal, "An Efficient Processor Allocation Scheme fer Hypercubes," The Transactions of the Korea Information Processing Society (1994 ~ 2000), vol. 3, no. 4, pp. 781-790, 1996. DOI: 10.3745/KIPSTE.1996.3.4.781.

[ACM Style]
Son Yoo Ek and Nam Jae Yeal. 1996. An Efficient Processor Allocation Scheme fer Hypercubes. The Transactions of the Korea Information Processing Society (1994 ~ 2000), 3, 4, (1996), 781-790. DOI: 10.3745/KIPSTE.1996.3.4.781.