The Experts below are selected from a list of 36 Experts worldwide ranked by ideXlab platform

José Duato - One of the best experts on this subject based on the ideXlab platform.

  • UPR: deadlock-free dynamic network reconfiguration by exploiting Channel Dependency Graph compatibility
    The Journal of Supercomputing, 2021
    Co-Authors: Juan-josé Crespo, José L. Sánchez, Francisco J. Alfaro-cortés, José Flich, José Duato
    Abstract:

    Deadlock-free dynamic network reconfiguration process is usually studied from the routing algorithm restrictions and resource reservation perspective. The dynamic nature yielded by the transition process from one routing function to another is often managed by restricting resource usage in a static predefined manner, which often limits the supported routing algorithms and/or inactive link patterns, or either requires additional resources such as virtual Channels. Exploiting compatibility between routing functions by exploring their associated Channel Dependency Graphs (CDG) leads to a better reconfiguration process given its dynamic nature. In this paper, we propose a new dynamic reconfiguration process called Upstream Progressive Reconfiguration (UPR). Our algorithm progressively performs Dependency addition/removal in a per Channel basis relying on the information provided by the CDG, while the reconfiguration process takes place. This gives us the opportunity to foresee compatible scenarios where both routing functions coexist, reducing the needed amount of resource drainage as well as packet injection halting.

  • a new theory of deadlock free adaptive routing in wormhole networks
    IEEE Transactions on Parallel and Distributed Systems, 1993
    Co-Authors: José Duato
    Abstract:

    The theoretical background for the design of deadlock-free adaptive routing algorithms for wormhole networks is developed. The author proposes some basic definitions and two theorems. These create the conditions to verify that an adaptive algorithm is deadlock-free, even when there are cycles in the Channel Dependency Graph. Two design methodologies are also proposed. The first supplies algorithms with a high degree of freedom, without increasing the number of physical Channels. The second methodology is intended for the design of fault-tolerant algorithms. Some examples are given to show the application of the methodologies. Simulations show the performance improvement that can be achieved by designing the routing algorithms with the new theory. >

H. Aoki - One of the best experts on this subject based on the ideXlab platform.

  • Deadlock-free adaptive routing in multicomputer networks using virtual Channels
    IEEE Transactions on Parallel and Distributed Systems, 1993
    Co-Authors: William J. Dally, H. Aoki
    Abstract:

    The use of adaptive routing in a multicomputer interconnection network improves network performance by using all available paths and provides fault tolerance by allowing messages to be routed around failed Channels and nodes. Two deadlock-free adaptive routing algorithms are described. Both algorithms allocate virtual Channels using a count of the number of dimension reversals a packet has performed to eliminate cycles in resource Dependency Graphs. The static algorithm eliminates cycles in the network Channel Dependency Graph. The dynamic algorithm improves virtual Channel utilization by permitting Dependency cycles and instead eliminating cycles in the packet wait-for Graph. It is proved that these algorithms are deadlock-free. Experimental measurements of their performance are presented. >

William J. Dally - One of the best experts on this subject based on the ideXlab platform.

  • deadlock free message routing in multiprocessor interconnection networks
    Interconnection networks for high-performance parallel computers, 1994
    Co-Authors: William J. Dally, Charles L Seitz
    Abstract:

    A deadlock-free routing algorithm can be generated for arbitrary interconnection networks using the concept of virtual Channels. A necessary and sufficient condition for deadlockfree routing is the absence of cycles in the Channel Dependency Graph. Given an arbitrary network and a routing function, the cycles of the Channel Dependency Graph can be removed by splitting physical Channels into groups of virtual Channels. This method is used to develop deadlock-free routing algorithms for k-ary n-cubes, for cube connected cycles, and for shuffle? exchange networks. (This is a revised version of 5206-tr-86)

  • Deadlock-free adaptive routing in multicomputer networks using virtual Channels
    IEEE Transactions on Parallel and Distributed Systems, 1993
    Co-Authors: William J. Dally, H. Aoki
    Abstract:

    The use of adaptive routing in a multicomputer interconnection network improves network performance by using all available paths and provides fault tolerance by allowing messages to be routed around failed Channels and nodes. Two deadlock-free adaptive routing algorithms are described. Both algorithms allocate virtual Channels using a count of the number of dimension reversals a packet has performed to eliminate cycles in resource Dependency Graphs. The static algorithm eliminates cycles in the network Channel Dependency Graph. The dynamic algorithm improves virtual Channel utilization by permitting Dependency cycles and instead eliminating cycles in the packet wait-for Graph. It is proved that these algorithms are deadlock-free. Experimental measurements of their performance are presented. >

Duato José - One of the best experts on this subject based on the ideXlab platform.

  • UPR: Deadlock-Free Dynamic Network Reconfiguration by Exploiting Channel Dependency Graph Compatibility
    2021
    Co-Authors: Crespo Juan-josé, Sánchez, José L., Alfaro-cortés, Francisco J., Flich José, Duato José
    Abstract:

    Deadlock-free dynamic network reconfiguration process is usually studied from the routing algorithm restrictions and resource reservation perspective. The dynamic nature yielded by the transition process from one routing function to another is often managed by restricting resource usage in a static predefined manner, which often limits the supported routing algorithms and/or inactive link patterns, or either requires additional resources such as virtual Channels. Exploiting compatibility between routing functions by exploring their associated Channel Dependency Graphs (CDG) can take a great benefit from the dynamic nature of the reconfiguration process. In this paper, we propose a new dynamic reconfiguration process called Upstream Progressive Reconfiguration (UPR). Our algorithm progressively performs Dependency addition/removal in a per Channel basis relying on the information provided by the CDG while the reconfiguration process takes place. This gives us the opportunity to foresee compatible scenarios where both routing functions coexist, reducing the amount of resource drainage as well as packet injection halting

Crespo Juan-josé - One of the best experts on this subject based on the ideXlab platform.

  • UPR: Deadlock-Free Dynamic Network Reconfiguration by Exploiting Channel Dependency Graph Compatibility
    2021
    Co-Authors: Crespo Juan-josé, Sánchez, José L., Alfaro-cortés, Francisco J., Flich José, Duato José
    Abstract:

    Deadlock-free dynamic network reconfiguration process is usually studied from the routing algorithm restrictions and resource reservation perspective. The dynamic nature yielded by the transition process from one routing function to another is often managed by restricting resource usage in a static predefined manner, which often limits the supported routing algorithms and/or inactive link patterns, or either requires additional resources such as virtual Channels. Exploiting compatibility between routing functions by exploring their associated Channel Dependency Graphs (CDG) can take a great benefit from the dynamic nature of the reconfiguration process. In this paper, we propose a new dynamic reconfiguration process called Upstream Progressive Reconfiguration (UPR). Our algorithm progressively performs Dependency addition/removal in a per Channel basis relying on the information provided by the CDG while the reconfiguration process takes place. This gives us the opportunity to foresee compatible scenarios where both routing functions coexist, reducing the amount of resource drainage as well as packet injection halting