Mechanism to control resource utilization with adaptive routing

Patent metadata

Field	Value
Publication number	US-9294403-B2
Application number	US-201314125707-A
Country	US
Kind code	B2
Filing date	Jun 28, 2013
Priority date	Jun 28, 2013
Publication date	Mar 22, 2016
Grant date	Mar 22, 2016

Abstract

Methods and apparatus relating to techniques for controlling resource utilization with adaptive routing are described. In one embodiment, an output port for transmission of an incoming message that is to be received at an input port is determined at routing logic. The routing logic selects the output port from a first output port and a second output port based on congestion information that is detected at one or more other routing logic communicatively coupled to the routing logic. The first output port provides a deterministic route for the incoming message and the second output port provides an adaptive route for the incoming message. Other embodiments are also disclosed.

First claim

The invention claimed is:

1. An apparatus comprising:
routing logic to determine an output port for transmission of an incoming message that is to be received at an input port,
wherein the routing logic is to select the output port from a first output port and a second output port based on congestion information to be detected at one or more other routing logic communicatively coupled to the routing logic, wherein the first output port is to provide a deterministic route for the incoming message and the second output port is to provide an adaptive route for the incoming message, wherein the congestion information is to be determined based on one of: a comparison of a number of performance virtual channels and a lower performance virtual channel threshold; or a comparison of a number of shared credits and a lower credit threshold.

2. The apparatus of claim 1 , wherein the deterministic route is capable to choose a same path for a source and destination pair of nodes.

3. The apparatus of claim 1 , wherein the adaptive route is capable to choose a different path for a source and destination pair of nodes based on traffic information.

4. The apparatus of claim 1 , wherein the performance virtual channels are capable to communicate the incoming message.

5. The apparatus of claim 1 , wherein the shared credits correspond to one or more virtual channels capable to communicate the incoming message.

6. The apparatus of claim 1 , wherein the routing logic is to determine the output port in response to detection of a first flit of the incoming message.

7. The apparatus of claim 1 , comprising scheduler logic to match availability of the output port with the incoming message.

8. The apparatus of claim 1 , comprising crossbar logic to communicatively couple the input port and the output port.

9. The apparatus of claim 1 , comprising logic to support deadlock free routing through allocation of one or more buffers, to store data corresponding to the incoming message, on a per flit basis.

10. The apparatus of claim 1 , comprising logic to support deadlock free routing through allocation of one or more virtual channels, to communicate data corresponding to the incoming message, on a packet level basis.

11. The apparatus of claim 10 , wherein the packet is to comprise a plurality of flits.

12. The apparatus of claim 1 , wherein the routing logic is to provide deadlock free routing based a plurality of routing virtual channels.

13. The apparatus of claim 1 , wherein the routing logic is to couple a first agent to a second agent via a link, wherein the link is to comprise a point-to-point interconnect.

14. The apparatus of claim 13 , wherein one or more of the first agent and the second agent are to comprise a plurality of processor cores.

15. The apparatus of claim 13 , wherein one or more of the first agent and the second agent are to comprise a plurality of sockets.

16. The apparatus of claim 13 , wherein one or more of the first agent, the second agent, the routing logic, and memory are on a same integrated circuit die.

17. A method comprising:
determining, at routing logic, an output port for transmission of an incoming message that is to be received at an input port,
wherein the routing logic is to select the output port from a first output port and a second output port based on congestion information to be detected at one or more other routing logic communicatively coupled to the routing logic, wherein the first output port is to provide a deterministic route for the incoming message and the second output port is to provide an adaptive route for the incoming message, wherein the congestion information is determined based on one of: a comparison of a number of performance virtual channels and a lower performance virtual channel threshold; or a comparison of a number of shared credits and a lower credit threshold.

18. The method of claim 17 , further comprising matching availability of the output port with the incoming message.

19. The method of claim 17 , further comprising communicatively coupling the input port and the output port.

20. The method of claim 17 , further comprising supporting deadlock free routing through allocation of one or more buffers, to store data corresponding to the incoming message, on a per flit basis.

21. The method of claim 17 , further comprising supporting deadlock free routing through allocation of one or more virtual channels, to communicate data corresponding to the incoming message, on a packet level basis.

22. A system comprising:
memory to store congestion information; and
routing logic, coupled to the memory, to determine an output port for transmission of an incoming message that is to be received at an input port,
wherein the routing logic is to select the output port from a first output port and a second output port based on the congestion information to be detected at one or more other routing logic communicatively coupled to the routing logic, wherein the first output port is to provide a deterministic route for the incoming message and the second output port is to provide an adaptive route for the incoming message, wherein the congestion information is to be determined based on one of: a comparison of a number of performance virtual channels and a lower performance virtual channel threshold; or a comparison of a number of shared credits and a lower credit threshold.

23. The system of claim 22 , wherein the deterministic route is capable to choose a same path for a source and destination pair of nodes.

24. The system of claim 22 , wherein the adaptive route is capable to choose a different path for a source and destination pair of nodes based on traffic information.

Assignees

• Intel Corp

Inventors

• Mejia Andres
• Dai Donglai
• Porta Gaspar Mora

Classifications

• H04L47/12 Primary

  Avoiding congestion; Recovering from congestion · CPC title

• H04L45/22

  Alternate routing · CPC title

• H04L49/3018

  Input queuing · CPC title

• H04L49/30

  Peripheral units, e.g. input or output ports · CPC title

• H04L47/11

  Identifying congestion · CPC title