US 2026/0180909 A1 · Stream Replacement Algorithm

Abstract

A system and method are provided that prioritizes activation of network streams providing communications across chips. The method associates a counter with each of the streams. The counter associated with each stream is reset to zero when the stream transitions from an active to an inactive state, and then the counter is incremented when any other of the streams transition from an active to an inactive state such that the inactive streams with the highest count value have been inactive the longest. The inactive streams are assigned to a vector bit indicative of the total streams available within a plurality of buckets based on the counter values assigned to the buckets. Inactive streams are then selected for activation from the buckets, with buckets having streams with higher counter values having higher priority for activation.

Claims20

Dependent claims

A method for prioritizing activation of network streams providing communications across chips, the method comprising:

associating a counter with each of the streams;
resetting the counter associated with each of the streams when the stream transitions from an active to an inactive state;
incrementing the counter associated with each of the streams that are inactive when any other of the streams transitions from an active to an inactive state such that one of the streams with the highest count value has been inactive the longest;
assigning a plurality of buckets for the streams;
providing a vector for each bucket having a total number of bits representing the total streams provided for transmission;
assigning ones of the streams that are inactive to vector bits of each one of the buckets based on values of the counter for the streams and the count values assigned to the bucket;
and
selecting one of the streams for activation based on priority assigned to the bucket, wherein buckets having streams with higher count values have higher priority.

5 more elements

A method for prioritizing activation of network streams providing communications across chips, the method comprising:

receiving a new unmapped logical stream for transmission over one of the network streams from one of the chips;
determining when a maximum number of the network streams are active,
wherein when not, transitioning a given one of the network streams from inactive to active and transmitting the new unmapped network stream to the given network stream, and
wherein when so, (i) stalling a transmitter that transmits a new unmapped logical stream to one of the network streams until one of the network streams goes from active to inactive, (ii) replacing the network stream that goes from active to inactive by a selected one of the network streams that has been inactive for the longest duration, and (iii) transmitting the new unmapped logical stream to the selected network stream when the selected network stream becomes active.

1 more element

Dependencies are inferred from the claim text.

Stream Replacement Algorithm

Life of this patent

Stream Replacement Algorithm

Life of this patent

Abstract

Claims20