A survey of wormhole routing techniques in direct networks
- L. Ni, P. McKinley
- Computer ScienceComputer
- 1 February 1993
The properties of direct networks are reviewed, and the operation and characteristics of wormhole routing are discussed in detail, along with a technique that allows multiple virtual channels to share the same physical channel.
Composing adaptive software
- P. McKinley, S. M. Sadjadi, E. Kasten, B. Cheng
- Computer ScienceComputer
- 1 July 2004
A review of current technology compares how, when, and where recomposition occurs.
Deadlock-Free Multicast Wormhole Routing in 2-D Mesh Multicomputers
- X. Lin, P. McKinley, L. Ni
- Computer Science, BusinessIEEE Trans. Parallel Distributed Syst.
- 1 August 1994
These are the first deadlock-free multicast wormhole routing algorithms ever proposed and studied and indicate that a dual-path routing algorithm offers performance advantages over tree-based, multipath, and fixed-path algorithms.
Unicast-Based Multicast Communication in Wormhole-Routed Networks
- P. McKinley, Hong Xu, Abdol-Hossein Esfahanian, L. Ni
- Computer ScienceIEEE Trans. Parallel Distributed Syst.
- 1 December 1994
Minimum-time multicast algorithms are presented for n-dimensional meshes and hypercubes that use deterministic, dimension-ordered routing of unicast messages, and can deliver a multicast message to m-1 destinations in [log/sub 2/ m] message passing steps, while avoiding contention among the constituent Unicast messages.
The Message Flow Model for Routing in Wormhole-Routed Networks
- X. Lin, P. McKinley, L. Ni
- Computer ScienceInternational Conference on Parallel Processing
- 16 August 1993
A new approach to deadlock-free routing in wormhole-routed networks called the message flow model is introduced, which is used to develop new, efficient adaptive routing algorithms for 2D meshes and hypercubes.
Collective Communication in Wormhole-Routed Massively Parallel Computers
- P. McKinley, Y. Tsai, David F. Robinson
- Computer ScienceComputer
- 1 December 1995
This work examines software and hardware approaches to implementing collective communication operations and describes the major classes of algorithms proposed to solve problems arising in this research area.
Optimal Multicast Communication in Wormhole-Routed Torus Networks
- David F. Robinson, P. McKinley, B. Cheng
- Computer ScienceInternational Conference on Parallel Processing…
- 15 August 1994
A minimum-time multicast algorithm is presented for n-dimensional torus networks that use deterministic, dimension-ordered routing of unicasts, and can deliver a multicast message to m - 1 destinations in [log_2 m] message-passing steps, while avoiding contention among the constituent unicast messages.
On the cost-quality tradeoff in topology-aware overlay path probing
- Chiping Tang, P. McKinley
- Computer Science11th IEEE International Conference on Network…
- 4 November 2003
An orthogonal solution is proposed that trades probing overhead for estimation accuracy in sparse networks such as the Internet and can significantly reduce probing overhead while providing hounded quality estimations for all n /spl times/ (n - 1) overlay paths.
Plato: a genetic algorithm approach to run-time reconfiguration in autonomic computing systems
- A. J. RamÃrez, David B. Knoester, B. Cheng, P. McKinley
- Computer ScienceCluster Computing
- 1 September 2011
This paper proposes an approach to leverage genetic algorithms in the decision-making process of an autonomic system that enables a system to dynamically evolve target reconfigurations at run time that balance tradeoffs between functional and non-functional requirements in response to changing requirements and environmental conditions.
Deadlock-free Multicast Wormhole Routing in 2d Mesh Multicomputers Deadlock-free Multicast Wormhole Routing in 2d Mesh Multicomputers
- X. Lin, P. McKinley, Lionel M. NiDepartment
- Computer Science, Business
- 1992
A simulation study has been conducted that compares the performance of these multicast wormhole routing algorithms under dynamic network traac conditions in a 2D mesh and indicates that a dual-path routing algorithm has performance advantages over tree-based, multi-path, and xed-path algorithms.
...
...