Bit decision table for hypercube decomposition

A new algorithm for subcube assignment and decomposition is introduced to solve the fragmentation problem in hypercube (n-cube) processor allocation. The sharing density vector introduced in the prime cube graph strategy is used as a vehicle to develop the new algorithm. A bit decision table is devised to provide the key parameters for determining the decomposition. It is proven that the result of the algorithm is at least 22% better than the sharing density vector approach.