A Fast Algorithm for Complete Subcube Recognition

Authors:
Hal Burch;Fikret Ercal
Affiliations:
-;-
Venue:
ISPAN '97 Proceedings of the 1997 International Symposium on Parallel Architectures, Algorithms and Networks
Year:
1997

Citing 0
Cited 2

A new "dual-view" diagram of array structure

Proceedings of the 2003 conference on APL: stretching the mind
A generating function that counts the combinatorial full-span sub array structure of a regular array with some applications to APL

Proceedings of the 2003 conference on APL: stretching the mind

Quantified Score

Hi-index	0.00

Visualization

Abstract

The complete subcube recognition problem is defined as, given a collection of available processors on an n-dimensional hypercube, locate a subcube of dimension k that consists entirely of available processors, if one exists. Despite many algorithms proposed so far on this subject, improving the time complexity of this problem remains a challenge. Efficiency limits that can be reached have not been exhausted yet. This paper proposes a novel algorithm to recognize all the overlapping subcubes available on an n-dimensional hypercube whose processors are partially allocated. Given P=2^n, as the total number of processors in the hypercube, the new algorithm runs in O(3^n), or O(P^(log 3) log P) time which is an improvement over previously proposed strategies, such as multiple-graycode, missing combination, maximal set of subcubes, and tree collapsing.