The basic idea of this strategy lies in collapsing the binary tree representations of a hypercube successively so that the nodes which form a subcube but are ...
Abstract: Recognizing various subcubes in a hypercube computer fully and efficiently is nontrivial because of the specific structure of the hypercube.
scholar.google.com › citations
The basic idea of this strategy lies in collapsing the binary tree representations of a hypercube successively so that the nodes which form a subcube but are ...
One important variation considered is where each processor can contain at most one resource unit, as opposed to arbitrarily many units. It is shown that this ...
The goal is to have different recognized subcubes at each processor to maximize the total number of recognized subcubes. Given a number of processors we ...
A processor allocation policy for hypercube computers is presented. The allocation policy is called free list since it maintains a list of free subcubes ...
We propose a fast processor allocation strategy for hypercube computers called modified gray code (MGC). The MGC strategy achieves full subcube recognition with ...
People also ask
What is a hypercube system in computer architecture?
What is processor allocation in distributed system?
In this paper, we study the problem of allocating processors to application tasks for massively parallel processors (MPPs). Tasks are assumed to arrive ...
CHUANG AND TZENG: RECOGNITION-COMPLETE PROCESSOR ALLOCATION STRATEGY FOR HYPERCUBE COMPUTERS ... Tzeng, "Dynamic processor allocation in hyper- cube computers,” ...
ABSTRACT. In this journal, we present a method called “AI Game Playing Approach for Fast Processor Allocation in. Hypercube Systems using Veitch diagram ...