System and method for ordering packet transfers in a data processor

• US 9,632,977 B2
• Filed: 03/13/2013
• Issued: 04/25/2017
• Est. Priority Date: 03/13/2013
• Status: Active Grant

• Current Assignee: NXP USA, Inc. (NXP Semiconductors NV)
• Original Assignee: NXP USA, Inc. (NXP Semiconductors NV)
• Inventors: Boland, Timothy G., Harris, Anne C., Millman, Steven D.
• Primary Examiner(s): Bullock, Jr., Lewis A
• Assistant Examiner(s): Lu, Kevin X
• Application Number:
  US13/801,576
• Publication Number:
  US 20140281390A1
• Time in Patent Office: 1,504 Days
• Field of Search: None
• CPC Class Codes: G06F 15/7825 Globally asynchronous, locally synchronous, e.g. network on chip
• CPC Class Codes: G06F 9/466 Transaction processing
• CPC Class Codes: G06F 9/5038 considering the execution order of a plurality of tasks, e.g. taking priority or time dependency constraints into consideration scheduling strategies G06F9/4881 and subgroups

Abstract

A data processor includes a packet selector. The packet selector creates an ordered list of packets, each packet corresponding to a respective communication flow, determines whether each packet in the ordered list of packets is eligible for transfer to a prefetch unit based on whether a preceding packet in the same communication flow has been transferred to the prefetch unit, and sets a selection priority for each packet based on start time constraints for the respective communication flow, and based on a processing status of a preceding packet in the communication flow.

Claims

1. A method of processing a packet within a processor, the method comprising:

creating, by a packet selector, an ordered list of packets, each packet of the ordered list of packets corresponding to a respective communication flow;

determining whether each packet of the ordered list of packets is eligible for transfer to a prefetch unit based on whether a preceding packet in the same communication flow has been transferred to the prefetch unit;

determining whether each packet in the respective communication flow can be processed before processing of the preceding packet in the respective communication flow has finished;

identifying start time constraints for the respective communication flow based upon the determination of whether each packet in the respective communication flow can be processed before processing of the preceding packet in the respective communication flow has finished;

setting, by the packet selector, a selection priority for each packet of the ordered list of packets based on the start time constraints for the respective communication flow of each packet, and based on a processing status of the preceding packet in the respective communication flow; and

sending an oldest packet out of the ordered list of packets having a highest selection priority to the prefetch unit.

2. The method of claim 1, wherein the start time constraints comprise:

processing of the packet must wait for start of processing of the preceding packet, processing of the packet must wait for partial completion of processing of the preceding packet, and processing of the packet must wait for completion of processing of the preceding packet.

3. The method of claim 1, wherein setting the selection priority for each packet of the ordered list of packets includes:

setting the selection priority of a packet to a highest priority of a set of priorities based on processing of the preceding packet at least being started;

setting the selection priority of the packet to a second highest priority of the set of priorities based on the preceding packet being in the prefetch unit, and the start time constraint of the packet allows the packet to start immediately after the start of the processing of the preceding packet;

setting the selection priority of the packet to a third highest priority of the set of priorities based on the preceding packet being in the prefetch unit, and the start time constraint of the packet allows the packet to start after partial completion of processing of the preceding packet; and

setting the selection priority of the packet to not eligible based on the preceding packet being in the prefetch unit, and the start time constraint of the packet requires completion of the processing of the preceding packet.

4. The method of claim 1, further comprising:

processing the oldest packet out of the packets having the highest selection priority.

5. The method of claim 4, wherein processing the oldest packet includes retrieving data used in processing the oldest packet.

6. The method of claim 5, wherein the data includes commands for processing the oldest packet.

7. The method of claim 5, wherein the data includes a security key for processing the oldest packet.

8. A data processor, the data processor comprising:

a packet selector, the packet selector creates an ordered list of packets, each packet of the ordered list of packets corresponding to a respective communication flow, determines whether each packet of the ordered list of packets is eligible for transfer to a prefetch unit based on whether a preceding packet in the same communication flow has been transferred to the prefetch unit, determines whether each packet in the respective communication flow can be processed before processing of the preceding packet in the respective communication flow has finished, identifies start time constraints for the respective communication flow based upon the determination of whether each packet in the respective communication flow can be processed before processing of the preceding packet in the respective communication flow has finished, sets a selection priority for each packet of the ordered list of packets based on the start time constraints for the respective communication flow of each packet, and based on a processing status of the preceding packet in the respective communication flow, and sends an oldest packet out of the ordered list of packets having a highest selection priority to the prefetch unit.

9. The data processor of claim 8, wherein the start time constraints comprise:

processing of the packet must wait for start of processing of the preceding packet, processing of the packet must wait for partial completion of processing of the preceding packet, and processing of the packet must wait for completion of processing of the preceding packet.

10. The data processor of claim 8, wherein the packet selector sets the selection priority, by:

setting the selection priority of a packet to a highest priority of a set of priorities based on processing of the preceding packet being started, setting the selection priority of the packet to a second highest priority of the set of priorities based on the preceding packet being in the prefetch unit, and the start time constraint of the packet allows the packet to start immediately after the start of the processing of the preceding packet, setting the selection priority of the packet to a third highest priority of the set of priorities based on the preceding packet being in the prefetch unit, and the start time constraint of the packet allows the packet to start after partial completion of processing of the preceding packet, and setting the selection priority of the packet to not eligible based on the preceding packet being in the prefetch unit, and the start time constraint of the packet requires completion of the processing of the preceding packet.

11. The data processor of claim 8, further comprising:

multiple processor cores that process the oldest packet out of the packets having the highest selection priority.

12. The data processor of claim 11, wherein the prefetch unit retrieves data used by the multiple processor cores to process the oldest packet in the prefetch unit.

13. The data processor of claim 12, wherein the data includes commands for the multiple processor cores to process the oldest packet.

14. The data processor of claim 13, wherein the data includes a security key for the multiple processor cores to process the oldest packet.

15. A method of processing a packet within a processor, the method comprising:

creating, by a packet selector, an ordered list of packets, each packet corresponding to a respective communication flow;

determining whether each packet in the ordered list of packets is eligible for transfer to a prefetch unit based on whether the packet is a first in order packet, a preceding packet in the same communication flow has been transferred to the prefetch unit, processing of the preceding packet in the same communication flow has started, or the processing of the preceding packet in the same communication flow is complete;

determining whether each packet in the respective communication flow can be processed before processing of the preceding packet in the respective communication flow has finished;

identifying start time constraints for the respective communication flow based upon the determination of whether each packet in the respective communication flow can be processed before processing of the preceding packet in the respective communication flow has finished;

setting, by the packet selector, a selection priority for each packet of the ordered list of packets based on the start time constraints for the respective communication flow of each packet, and based on a processing status of the preceding packet in the respective communication flow; and

sending an oldest packet out of the ordered list of packets having a highest selection priority to the prefetch unit.

16. The method of claim 15, wherein the start time constraints comprise:

processing of the packet must wait for start of processing of the preceding packet, processing of the packet must wait for partial completion of processing of the preceding packet, and processing of the packet must wait for completion of processing of the preceding packet.

17. The method of claim 16, wherein setting the selection priority for each packet of the ordered list of packets includes:

setting the selection priority of a packet to a highest priority of a set of priorities based on one of the following;

the packet being a first in order packet, and processing of the preceding packet at least being started;

setting the selection priority of the packet to a second highest priority of the set of priorities based on the preceding packet being in the prefetch unit, and the start time constraint of the packet allows the packet to start immediately after the start of the processing of the preceding packet;

setting the selection priority of the packet to a third highest priority of the set of priorities based on the preceding packet being in the prefetch unit, and the start time constraint of the packet allows the packet to start after partial completion of processing of the preceding packet; and

setting the selection priority of the packet to not eligible based on the preceding packet being in the prefetch unit, and the start time constraint of the packet requires completion of the processing of the preceding packet.