Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
A Fast Algorithm for Complete Subcube Recognition
ISPAN '97 Proceedings of the 1997 International Symposium on Parallel Architectures, Algorithms and Networks
Regular array expansions in null arrays, with applications: zero is not nothing
Regular array expansions in null arrays, with applications: zero is not nothing
| Hi-index | 0.00 |
First we present a new structural decomposition of regular arrays that is derived elsewhere [4]. Second, we list a few special cases of the decomposition. Finally we give 11 examples of arrays, their decomposition, their egg crate view, and their dual view (which better represents their true structure).We present this graphical presentation form (a diagrammatic notation) for a regular array. The notation is a "dual" of the usual "egg crate" view. This view makes clear and intuitive the otherwise unintuitive results derived from the newly found array expansion in [4]. The array expansion results are all structural therefore so are these pictorial results. They do not use knowledge of the particular data contents of the arrays.