Flexible and hierarchical dynamic buffer allocation
First Claim
1. A method, comprising:
- receiving a first set of inputs indicating a first plurality of entities and a first traffic behavior implemented by each of the first plurality of entities;
determining a first region of a buffer corresponding to the first traffic behavior;
assigning the first plurality of entities to the first region;
determining hierarchical relationships among the first plurality of entities implementing the first traffic behavior, wherein the hierarchical relationships are defined via a tree data structure;
determining a first shared buffer space of the first region;
assigning at least one threshold for each of the first plurality of entities, the threshold comprising a maximum amount of the first shared buffer space that may be allocated to an entity; and
configuring a logic device to allocate the first shared buffer space dynamically according to the hierarchical relationships and the thresholds.
1 Assignment
0 Petitions
Accused Products
Abstract
In one embodiment, a method comprises the following steps: receiving a first set of inputs comprising a first plurality of entities and a first traffic behavior; determining a first region of a buffer corresponding to the first traffic behavior; assigning the first plurality of entities to the first region; determining hierarchical relationships between at least some of the first plurality of entities; determining a first shared buffer space of the first region; and assigning at least one threshold for each of the first plurality of entities. The threshold may comprise a maximum amount of the first shared buffer space that may be allocated to an entity. The method may also involve configuring a logic device to allocate the first shared buffer space dynamically according to the hierarchical relationships and the thresholds.
-
Citations
25 Claims
-
1. A method, comprising:
-
receiving a first set of inputs indicating a first plurality of entities and a first traffic behavior implemented by each of the first plurality of entities; determining a first region of a buffer corresponding to the first traffic behavior; assigning the first plurality of entities to the first region; determining hierarchical relationships among the first plurality of entities implementing the first traffic behavior, wherein the hierarchical relationships are defined via a tree data structure; determining a first shared buffer space of the first region; assigning at least one threshold for each of the first plurality of entities, the threshold comprising a maximum amount of the first shared buffer space that may be allocated to an entity; and configuring a logic device to allocate the first shared buffer space dynamically according to the hierarchical relationships and the thresholds. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16)
-
-
17. An apparatus, comprising:
-
means for receiving a first set of inputs indicating a first plurality of entities and a first traffic behavior implemented by each of the first plurality of entities; means for determining a first region of a buffer corresponding to the first traffic behavior; means for assigning the first plurality of entities to the first region; means for determining hierarchical relationships among the first plurality of entities implementing the first traffic behavior, wherein the hierarchical relationships are defined via a tree data structure; means for determining a first shared buffer space of the first region; means for assigning at least one threshold for each of the first plurality of entities, the threshold comprising a maximum amount of the first shared buffer space that may be allocated to an entity; and means for configuring a logic device to allocate the first shared buffer space dynamically according to the hierarchical relationships and the thresholds. - View Dependent Claims (18, 19)
-
-
20. An apparatus, comprising:
-
a first plurality of ports; a buffer; and a logic device configured to do the following; obtain a first set of inputs indicating a first plurality of entities and a first traffic behavior implemented by each of the first plurality of entities; determine a first region of a buffer corresponding to the first traffic behavior; assign the first plurality of entities to the first region; determine hierarchical relationships among the first plurality of entities implementing the first traffic behavior, wherein the hierarchical relationships are defined via a tree data structure; determine a first shared buffer space of the first region; assign at least one threshold for each of the first plurality of entities, the threshold comprising a maximum amount of the first shared buffer space that may be allocated to an entity; and configure a logic device to allocate the first shared buffer space dynamically according to the hierarchical relationships and the thresholds. - View Dependent Claims (21, 22, 23, 24, 25)
-
Specification