Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 98 for “"Hypercubes"”.

  1. Mapping hierarchical structures onto hypercubes

    <p>Hierarchically structured arrays of processors are appropriate for low-level and intermediate-level image processing and computer vision. The most widely used structure is the pyramid. Neverthless, pyramid machines do not support the efficient implementation of the majority of scientific …

    njit Repository record for Mapping hierarchical structures onto hypercubes (opens in a new tab)

  2. Self-stabilizing wormhole routing in hypercubes

    … self-stabilizing wormhole routing algorithm for hypercubes. Our first algorithm handles all types of faults except for node/link failures. This algorithm achieves optimality in terms of routing path length by following only the preferred dimensions. In an n-dimensional hypercube, those dimensions …

    unlv Repository record for Self-stabilizing wormhole routing in hypercubes (opens in a new tab) Download PDF for Self-stabilizing wormhole routing in hypercubes (opens in a new tab)

  3. Processor allocation strategies for modified hypercubes

    … a platform for easier expansion.</p><p>Modified hypercubes (MHs) have been proposed as the building blocks of hypercube-based systems supporting incremental growth techniques without introducing extra resources for individual hypercubes.</p><p>However, processor allocation on MHs proves to be a …

    njit Repository record for Processor allocation strategies for modified hypercubes (opens in a new tab)

  4. Multilevel embeddings for massively-parallel hypercubes

    Hierarchically structured arrays of processors have widely been used in the low and intermediate phases of image processing and computer vision. Since the pyramid structure efficiently supports local and global operations extensively required by these phases, it has been widely used for relevant …

    njit Repository record for Multilevel embeddings for massively-parallel hypercubes (opens in a new tab)

  5. (Visible) Tilings of Squares and Hypercubes

    More than eighty years ago, Erdos considered sums of the side lengths of squares packed into a unit square.Here we consider various classes of tilings , this is, packings where there is no empty space inside the unit square. Several types of questions will be explored here. Various construction …

    mississippi Repository record for (Visible) Tilings of Squares and Hypercubes (opens in a new tab)

  6. Algorithms for embedding binary trees into hypercubes

    The problem of embedding a guest graph G into a host graph H arises in the process of mapping a parallel program to a multicomputer. The communication structure of the program is represented by G, the interconnection network of the multicomputer is represented by H and the goal is to embed G into H …

    ubc Repository record for Algorithms for embedding binary trees into hypercubes (opens in a new tab) Download PDF for Algorithms for embedding binary trees into hypercubes (opens in a new tab)

  7. Linearly Ordered Concurrent Data Structures on Hypercubes

    … of linearly ordered data structures on hypercubes. The method is based on the existence of a pruned binomial search tree rooted at any arbitrary node of the binary hypercube. The tree spans any arbitrary sequence of n consecutive nodes containing the root, using a fan-out of at most …

    unt Repository record for Linearly Ordered Concurrent Data Structures on Hypercubes (opens in a new tab)

  8. 2 to 1 embeddings of grids into hypercubes

    We consider two-to-one embeddings of grids into the next smaller Hypercube and derive novel two-to-one embedding techniques that achieve optimal dilation 1 for many grids, where in some cases no previous solutions were known. In particular, dilation 1, two-to-one embeddings into the next smaller …

    uvic Repository record for 2 to 1 embeddings of grids into hypercubes (opens in a new tab)

  9. Subcube embeddability and fault tolerance of augmented hypercubes

    Hypercube networks have received much attention from both parallel processing and communications areas over the years since they offer a rich interconnection structure with high bandwidth, logarithmic diameter, and high degree of fault tolerance. They are easily partitionable and exhibit a high …

    unlv Repository record for Subcube embeddability and fault tolerance of augmented hypercubes (opens in a new tab) Download PDF for Subcube embeddability and fault tolerance of augmented hypercubes (opens in a new tab)

  10. Partition sort: An improved binsort algorithm for hypercubes

    … version of min-max binsort sorting algorithm for hypercubes is introduced. This algorithm, called partition sort, can sort n elements with time complexity O((nlog n)/p) for n ~p2, including communication and computation costs. The algorithm is primarily useful for sorting numerical keys or keys …

    iastate Repository record for Partition sort: An improved binsort algorithm for hypercubes (opens in a new tab)

  11. General broadcasting algorithms in one-port wormhole routed hypercubes

    … of broadcasting in one-port wormhole routed hypercubes. Two methods have been suggested; one is based on utilizing the Gray codes (Gray code path-based routing), while the other is based on the recursive partitioning of the cube (cube-based routing). The number of routing steps in both …

    unlv Repository record for General broadcasting algorithms in one-port wormhole routed hypercubes (opens in a new tab) Download PDF for General broadcasting algorithms in one-port wormhole routed hypercubes (opens in a new tab)

  12. Fault-tolerant ring embeddings in hypercubes -- A reconfigurable approach

    "We investigate the problem of designing reconfigurable embedding schemes for a fixed hypercube (without redundant processors and links). The fundamental idea for these schemes is to embed a basic network on the hypercube without fully utilizing the nodes on the hypercube. The remaining nodes can …

    must-thes Repository record for Fault-tolerant ring embeddings in hypercubes -- A reconfigurable approach (opens in a new tab)

  13. Breaking barriers to design dimensions in nearly orthogonal Latin hypercubes

    … factors. Orthogonal and nearly orthogonal Latin hypercubes are proven techniques for designing simulation experiments. A key property of these efficient, space-filling designs is their ability to explore many factors within a relatively modest number of design points; however, there is a limited …

    nps Repository record for Breaking barriers to design dimensions in nearly orthogonal Latin hypercubes (opens in a new tab)

  14. Persistent homology of products and Gromov-Hausdorff distances between hypercubes and spheres

    … distance between n-spheres and (n + 1)-hypercubes equipped with the geodesic metric and of b) new lower bounds for the coindexes of the Vietoris-Rips complexes of hypercubes equipped with the Hamming metric. In their paper, "Spectral Sequences, Exact Couples, and Persistent Homology of …

    colostate Repository record for Persistent homology of products and Gromov-Hausdorff distances between hypercubes and spheres (opens in a new tab)

  15. Hypercubes, median graphs and products of graphs: some algorithmic and combinatorial results

    <p>We consider hypercubes, median graphs, Cartesian product (sk10-product) of graphs, Kronecker product (x-product) of graphs and Strong product (sk10-product) of graphs from certain algorithmic and combinatorial points of view. Our basic results are the following: (1) We construct certain schemes …

    iastate Repository record for Hypercubes, median graphs and products of graphs: some algorithmic and combinatorial results (opens in a new tab)

  16. Efficient embeddings of meshes and hypercubes on a group of future network architectures.

    Meshes and hypercubes are two most important communication and computation structures used in parallel computing. Network embedding problems for meshes and hypercubes on traditional network architectures have been intensively studied during the past years. With the emergence of new network …

    adelaide Repository record for Efficient embeddings of meshes and hypercubes on a group of future network architectures. (opens in a new tab)

  17. Near-optimal broadcast in all-port wormhole-routed hypercubes using error-correcting codes

    A new broadcasting method is presented for hypercubes with wormhole routing mechanism. The communication model assumed allows an n-dimensional hypercube to have at most n concurrent I/O communication along its ports. It assumes a distance insensitivity of (n + 1) with no intermediate reception …

    unlv Repository record for Near-optimal broadcast in all-port wormhole-routed hypercubes using error-correcting codes (opens in a new tab) Download PDF for Near-optimal broadcast in all-port wormhole-routed hypercubes using error-correcting codes (opens in a new tab)

  18. Optimization of an advanced multi-junction solar-cell design for space environments (AM0) using nearly orthogonal Latin hypercubes

    This thesis focuses on the replacement of a genetic algorithm currently used to optimize multi-junction solar cells with Silvaco Atlas simulation software. It introduces the nearly orthogonal Latin hypercube (NOLH) design of experiments (DoE) as a means for exploring and optimizing solar cell …

    nps Repository record for Optimization of an advanced multi-junction solar-cell design for space environments (AM0) using nearly orthogonal Latin hypercubes (opens in a new tab)

  19. Processor allocation and message broadcasting in hypercycle interconnection networks

    … popular interconnection topologies including hypercubes, k-ary n-cubes and generalized hypercubes. The regular structure of hypercycles allows for sim­ple routing strategies which are responsible for the communication between the processing nodes. Broadcasting a message to all the processors …

    uvic Repository record for Processor allocation and message broadcasting in hypercycle interconnection networks (opens in a new tab)

Page 1 of 5