Collaborative route reservation and ranking in high performance computing fabrics

1. A method for collaborative route reservation comprising:

selecting a target node in a cluster of nodes in an high performance computing (HPC) data processing system to receive a payload from a source node of the cluster over an HPC fabric for the HPC data processing system;

computing a route over the HPC fabric for transferring the payload from the source node to the target node and also a duration of time requisite to transferring the payload from the source node to the target node by determining a selection of routes available to transfer the payload from the source node to the target node and second by selecting a route from amongst the selection of routes that has not already been reserved by another of the nodes of the cluster;

notifying others of the nodes in the cluster of a reservation of the computed route to the exclusion of other payloads of others of the nodes for the duration of time;

utilizing the computed route during the duration of time to transfer the payload from the source node to the target node; and,

responsive to completing transfer of the payload, notifying others of the nodes of the cluster that the computed path is no longer reserved;

wherein the duration of time is computed according to a known historical time required to transfer the payload.

2. The method of claim 1 , wherein the duration of time is computed according to a size of the payload.

3. The method of claim 1 , wherein the duration of time is computed according to a priority assigned to the payload.

4. A high performance computing (HPC) data processing system configured for collaborative route reservation, the system comprising:

a cluster of host computers coupled to one another over a data communications fabric, each of the host computers including memory and at least one processor and acting as a node of the cluster; and,

a route reservation module comprising program code executing in the memory of a corresponding one of the host computers, to select a target node in the cluster for receiving a payload from a source node of the cluster over the fabric, to compute a route over the fabric for transferring the payload from the source node to the target node and also a duration of time requisite to transferring the payload from the source node to the target node by determining a selection of routes available to transfer the payload from the source node to the target node and second by selecting a route from amongst the selection of routes that has not already been reserved by another of the nodes of the cluster, to notify others of the nodes in the cluster of a reservation of the computed route to the exclusion of other payloads of others of the nodes for the duration of time, to utilize the computed route during the duration of time to transfer the payload from the source node to the target node, and to respond to completing transfer of the payload by notifying others of the nodes of the cluster that the computed path is no longer reserved;

wherein the duration of time is computed according to a known historical time required to transfer the payload.

5. The system of claim 4 , wherein the fabric is a mesh network coupling each of the host computers to one another without the benefit of an intelligent switch or router.

6. The system of claim 4 , wherein the duration of time is computed according to a size of the payload.

7. The system of claim 4 , wherein the duration of time is computed according to a priority assigned to the payload.

8. A computer program product for collaborative route reservation comprising:

a non-transitory computer readable storage medium having computer readable program code embodied therewith, the computer readable program code comprising:

computer readable program code for selecting a target node in a cluster of nodes in an high performance computing (HPC) data processing system to receive a payload from a source node of the cluster over an HPC fabric for the HPC data processing system;

computer readable program code for computing a route over the HPC fabric for transferring the payload from the source node to the target node and also a duration of time requisite to transferring the payload from the source node to the target node by determining a selection of routes available to transfer the payload from the source node to the target node and second by selecting a route from amongst the selection of routes that has not already been reserved by another of the nodes of the cluster;

computer readable program code for notifying others of the nodes in the cluster of a reservation of the computed route to the exclusion of other payloads of others of the nodes for the duration of time;

computer readable program code for utilizing the computed route during the duration of time to transfer the payload from the source node to the target node; and,

computer readable program code for responding to completing transfer of the payload by notifying others of the nodes of the cluster that the computed path is no longer reserved;

wherein the duration of time is computed according to a known historical time required to transfer the payload.

9. The computer program product of claim 8 , wherein the duration of time is computed according to a size of the payload.

10. The computer program product of claim 8 , wherein the duration of time is computed according to a priority assigned to the payload.