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 11 of 11 for “"Hypercube networks (Computer networks)"”.

  1. Mapping hierarchical structures onto hypercubes

    … 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 algorithms and their cost may become prohibitively high. In contrast, hypercube …

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

  2. Efficient hypercube communications

    <p>Hypercube algorithms may be developed for a variety of communication-intensive tasks such as sending a message from one node to another, broadcasting a message from one node to all others, broadcasting a message from each node to all others, all-to-all personalized communication, one-to-all …

    njit Repository record for Efficient hypercube communications (opens in a new tab)

  3. A Theoretical Network Model and the Incremental Hypercube-Based Networks

    The study of multicomputer interconnection networks is an important area of research in parallel processing. We introduce vertex-symmetric Hamming-group graphs as a model to design a wide variety of network topologies including the hypercube network.

    unt Repository record for A Theoretical Network Model and the Incremental Hypercube-Based Networks (opens in a new tab)

  4. Performance analysis of partitioned multistage cube network and adaptive routed single-stage cube network

    Parallel processing has emerged to meet today's high demand of computationally intensive applications. In a parallel processing machine, the interconnection network is a major factor affecting the machine’s overall performance in terms of speed and versatility. This research presents an analysis of …

    vt Repository record for Performance analysis of partitioned multistage cube network and adaptive routed single-stage cube network (opens in a new tab)

  5. Performance analysis of pyramid mapping algorithms for the hypercube

    … map pyramids and multilevel structures onto the hypercube are presented. The pyramid structure is appropriate for low-level and intermediate-level computer vision algorithms. It is not only efficient for the support of both local and global operations but also capable of supporting the …

    njit Repository record for Performance analysis of pyramid mapping algorithms for the hypercube (opens in a new tab)

  6. Processor allocation for partitionable multiprocessor systems

    … processor allocation problem in an n-dimensional hypercube multipro-cessor is similar to the conventional memory allocation problem. The main objective is to maximize the utilization of available resources as well as minimize the inherent system fragmentation. In this thesis, a new processor …

    njit Repository record for Processor allocation for partitionable multiprocessor systems (opens in a new tab)

  7. Multilevel embeddings for massively-parallel hypercubes

    … 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 algorithms. Multilevel systems keep all the advantages of the pyramid structure …

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

  8. Data broadcasting and reduction, prefix computation, and sorting on reduced hypercube (RH) parallel computers

    The binary hypercube parallel computer has been very popular due to its rich interconnection structure and small average internode distance which allow the efficient embedding of frequently used topologies. Communication patterns of many parallel algorithms also match the hypercube topology. The …

    njit Repository record for Data broadcasting and reduction, prefix computation, and sorting on reduced hypercube (RH) parallel computers (opens in a new tab)

  9. Processor allocation strategies for modified hypercubes

    … parallel architectures proposed/implemented, the hypercube has shown a lot of promise because of its poweful properties, like regular topology, fault tolerance, low diameter, simple routing, and ability to efficiently emulate other architectures. The major drawback of the hypercube network is that …

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

  10. Deflection routing in buffered binary hypercube switches

    … candidate for future B- switches. Binary hypercubes have regular topology, are highly fault and have multiple paths for routing cells which help avoid performance penalties due to congestion and faults. In addition, these switches can adopt the novel, distributed, and adaptive routing …

    sask Repository record for Deflection routing in buffered binary hypercube switches (opens in a new tab)