Dilation two embedding one-by-one particular sub-quadtree into M-dimentional crossed cubes

TL;DR

This paper explores a novel embedding method for sub-quadtree graphs into m-dimensional crossed cubes, aiming to improve parallel processing efficiency by leveraging the properties of crossed cubes.

Contribution

It introduces a specific dilation two embedding technique for sub-quadtree graphs into crossed cubes, enhancing graph simulation capabilities in parallel architectures.

Findings

Embedding reduces interconnection complexity

Improves simulation of spatial data structures

Enhances parallel processing efficiency

Abstract

In the parallel processing field, graph embedding is motivated by simulation interconnection networks to another. The quadtree is an important technique used to present spatial data and is used in many application domains, especially computer vision and image processing. Researchers are interested in the construction and manipulation of quadtrees on parallel machines. The crossed cubes consider an alternative to the ordinary hypercube. It offers many attractive properties. Significantly, it reduces diameter by a factor of 2 that of the ordinary cubes. Moreover, the crossed cubes have a great capacity to simulate other architectures. This paper is interested in the one-by-one dilation two embedding of a particular sub-quadtree graph into m-dimensional crossed cubes.