An algorithm paradigm for incomplete hypercubes

AbstractIn this paper, we suggest an algorithm paradigm for incomplete hypercubes. Using this paradigm, many simple and efficient algorithms can be designed on an incomplete hypercube for many applications such as routing, broadcasting, semigroup computation, prefix sums, alternate direction exchange, total exchange, data gathering, data scattering, and selection of the first k largest processes. The algorithms designed for routing and broadcasting require less computation time than Katseff's