The main advantage of this strategy is that the nodes which do not contribute to form a requested subcube can be filtered out by coalescing, and thus the ...

A new approach for dynamic processor allocation in hypercube multicomputers which supports a multi-user environment is proposed.

Geunmo Kim, Hyunsoo Yoon: A Processor Allocation Strategy Using Cube Coalescing in Hypercube Multicomputers. SPDP 1993: 596-605. manage site settings.

A processor allocation strategy using cube coalescing in hypercube multicomputers We propose a new processor allocation strategy for hypercube multicomputers.

A processor allocation strategy using cube coalescing in hypercube multicomputers · Geunmo KimH. Yoon. Computer Science. Proceedings of 1993 5th IEEE Symposium ...

In this paper, two processor allocation strategies are presented in Section 2 and a comparison of their per- formance can be found in Section 3. In Section ...

In this paper, we propose a task migration scheme based on the HAS (Heuristic Subcube Allocation) strategy to solve the fragmentation problem in a hypercube.

A new strategy for processors allocation in an N-cube multiprocessor ... Simulation results comparing several different allocation and coalescing strategies ...

An efficient processor allocation policy is presented for hypercube computers. The allocation policy is called free list since it maintains a list of free ...

In this paper, we investigate a new class of noncontiguous allocation schemes for two-dimensional mesh-connected multicomputers. These schemes are different ...