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 21 for “"WORMHOLE ROUTING"”.

  1. Self-stabilizing wormhole routing

    … processors must cooperate to ensure proper routing; Wormhole routing is most common in parallel architectures in which messages are sent in small fragments called flits. We assume that each processor will contain a single fixed-size flit buffer for each incoming link. A processor must …

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

  2. Self-stabilizing wormhole routing in hypercubes

    Wormhole routing is an efficient technique used to communicate message packets between processors when they are not completely connected. To the best of our knowledge, this is the first attempt at designing a self-stabilizing wormhole routing algorithm for hypercubes. Our first algorithm handles …

    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. Performance analysis of wormhole routing in multicomputer interconnection networks

    … factors of which topology, switching method, routing algorithm and traffic load are the most significant. In this context, the present study focuses on a performance analysis of k-ary n-cube networks employing wormhole switching, virtual channels and adaptive routing, a scenario of especial …

    glasgow Download PDF for Performance analysis of wormhole routing in multicomputer interconnection networks (opens in a new tab)

  4. Adaptive Wormhole Routing in Mesh-connected Bidirectional K-ary 2-Cubes

    An algorithm that extends the Minimum-hop routing algorithm as presented in Garcia-Luna-Aceves 1989 to adaptively route messages around congested areas of a mesh-connected bidirectional K-ary 2-cube is presented. According to the enhancement, information describing the degree of congestion is …

    ucf Repository record for Adaptive Wormhole Routing in Mesh-connected Bidirectional K-ary 2-Cubes (opens in a new tab)

  5. Analysis of wormhole routings in cayley graphs of permutation groups.

    … a new class of switching technology, called wormhole routing, has been investigated in the multicomputer interconnection network field. Several classes of wormhole routing algorithms have been proposed. Most of the algorithms have been centered on the traditional binary hypercube, k-ary …

    oklahoma-thes Repository record for Analysis of wormhole routings in cayley graphs of permutation groups. (opens in a new tab)

  6. Efficient simulation of interconnection networks

    … simulating complex switching schemes like wormhole routing efficiently. A detailed model for wormhole routing is implemented using two different techniques, and their relative advantages are evaluated. The thesis also presents four approximate models for simulating wormhole routing and …

    rice Repository record for Efficient simulation of interconnection networks (opens in a new tab)

  7. Interprocessor communication in wormhole-switched multicomputers

    … Most of the contemporary multicomputers use wormhole routing mechanism to support their interprocess communication. This dissertation reports techniques for improving performance of wormhole-switched multicomputers. We have developed hardware algorithms to support both unicast and multicast …

    iastate Repository record for Interprocessor communication in wormhole-switched multicomputers (opens in a new tab)

  8. Deterministic and adaptive routing algorithms for mesh-connected computers

    … multicomputer uses a switching technique called wormhole routing. The essential idea of wormhole routing is to advance a packet directly from incoming to outgoing channel without sorting it, as soon as enough information has been received in the packet header to select the outgoing channel. It …

    njit Repository record for Deterministic and adaptive routing algorithms for mesh-connected computers (opens in a new tab)

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

    Wormhole routing has been accepted as an efficient switching mechanism in point-to-point interconnection networks. Here the network resource, i.e. node buffers and communication channels, are effectively utilized to deliver message across the network; We consider the problem of broadcasting a …

    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)

  10. Parameterizable network-on-chip emulation framework

    … algorithms, evaluation of switching, topology or routing algorithm for efficient execution of application and optimizing communication cost, area, energy etc Solution to solve the above problem calls for the development of synthesizable, parameterizable NoC Framework that would evaluate and …

    unlv Repository record for Parameterizable network-on-chip emulation framework (opens in a new tab) Download PDF for Parameterizable network-on-chip emulation framework (opens in a new tab)

  11. The communication network simulator for Concordia parallel programming environment

    … release of the network module, four types of routing techniques are implemented. They are Shortest Path, Simulated Packet, Packet Switch and Wormhole Routing.

    concordia Download PDF for The communication network simulator for Concordia parallel programming environment (opens in a new tab)

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

    … 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 capability …

    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)

  13. CPSS : a flexible and efficient simulator for wormhole-routed multicomputers

    … Systems Simulator (CPSS), a simulator for wormhole-routed multicomputers. The ultimate purpose of the CPSS is to provide a parallel programming environment which allows users to study impacts of system and software factors on program performance and to locate performance bottlenecks in …

    concordia Download PDF for CPSS : a flexible and efficient simulator for wormhole-routed multicomputers (opens in a new tab)

  14. Hypergraph-Based Interconnection Networks for Large Multicomputers

    … topology, technology, switching method, and routing algorithm. It argues that a new class of regular low-dimensional hypergraph networks, the distributed crossbar switch hypermesh (DCSH), represents a promising alternative high-performance interconnection network for future large …

    glasgow Download PDF for Hypergraph-Based Interconnection Networks for Large Multicomputers (opens in a new tab)

  15. Quality of service for high-speed interconnection networks onboard spacecraft

    … Due to these limitations SpaceWire uses wormhole routing which has many benefits but makes it more challenging to obtain timing guarantees and to achieve a deterministic behaviour.<br/><br/>These challenges are addressed in this work with a careful analysis of existing Quality of Service …

    dundee Repository record for Quality of service for high-speed interconnection networks onboard spacecraft (opens in a new tab) Download PDF for Quality of service for high-speed interconnection networks onboard spacecraft (opens in a new tab)

  16. Mapping of Real-time Applications on Network-on-Chip based MPSOCS.

    … run on network on chip platforms using wormhole routing, this analysis is used as a ranking function in a genetic algorithm that is able to evolve task mappings which allow all tasks and communication flows to meet their deadlines in all possible scenarios.

    whiterose Download PDF for Mapping of Real-time Applications on Network-on-Chip based MPSOCS. (opens in a new tab)

  17. Modeling, Design And Evaluation Of Networking Systems And Protocols Through Simulation

    … Simulator, simulates an ad-hoc wireless routing protocol that uses a data distribution methodology based on the GPS-QHRA routing protocol. CLL algorithm can realize a maximum of 45% power savings and maximum 25% reduced queuing delay compared to GPS-QHRA. The third simulator simulates a …

    ucf Repository record for Modeling, Design And Evaluation Of Networking Systems And Protocols Through Simulation (opens in a new tab)

Page 1 of 2