Embodiments of the present disclosure relate to buffers in general, and more specifically, to a buffer manager and methods for managing memories.
Unless otherwise indicated herein, the approaches described in this section are not prior art to the claims in the present disclosure and are not admitted to be prior art by inclusion in this section.
In a conventional computing system, buffer management is generally performed by a processing core. For example, the processing core allocates buffers for buffering data, and releases buffers when the buffered data is emptied from the buffers. These operations consume considerable resources of the processing core.
In various embodiments, the present disclosure provides a method comprising managing a plurality of buffer addresses in a system-on-chip (SOC); and if a number of available buffer addresses in the SOC falls below a low threshold value, obtaining one or more buffer addresses from a memory, which is external to the SOC, to the SOC. Furthermore, if the number of available buffer addresses in the SOC exceeds a high threshold value, another one or more buffer addresses is allocated from the SOC to the memory. There is also provided a system-on-chip (SOC) comprising a client component; and a buffer management unit (BMU) comprising an internal buffer pointer pool (IBPP); and a controller configured to monitor a number of unassigned buffer pointers in the IBPP, and if the number of unassigned buffer pointers in the IBPP falls below a threshold value, allocate one or more buffer pointers from an external buffer pointer pool (EBPP) to the IBPP. There is also provided a method comprising maintaining a plurality of buffer pointer pools (BPPs), wherein each BPP is logically sectioned in an internal buffer pointer pool (IBPP) and an external buffer pointer pool (EBPP); and for each BPP, dynamically allocating a plurality of buffer pointers to the corresponding IBPP and dynamically allocating another plurality of buffer pointers to the corresponding EBPP.
In the following detailed description, reference is made to the accompanying drawings which form a part hereof wherein like numerals designate like parts throughout, and in which is shown by way of embodiments that illustrate principles of the present disclosure. It is to be understood that other embodiments may be utilized and structural or logical changes may be made without departing from the scope of the present disclosure. Therefore, the following detailed description is not to be taken in a limiting sense, and the scope of embodiments in accordance with the present disclosure is defined by the appended claims and their equivalents.
The system 100 includes one or more network interfaces, e.g., network interface 16a, network interface 16b, . . . , network interface 16P, where P is an appropriate positive integer. One or more of the network interfaces (e.g., network interface 16b) are external to the SOC 10, while one or more of the remaining network interfaces (e.g., network interface 16a, network interface 16c, . . . , network interface 16P) are internal to the SOC 10, as illustrated in
In an embodiment, the SOC 10 also includes a shared bus 20 that is configured to be operatively coupled to the network interfaces 16a, . . . , 16P, processing cores 12a, . . . , 12M, BMU 24, and a memory controller 40. In various other embodiments and although not illustrated in
Although the SOC 10 typically includes several other components (e.g., one or more peripherals, interfaces, and/or the like), these components are not illustrated in
In an embodiment, the memory 44 includes a plurality of buffer locations, e.g., buffer locations 50_a1, . . . , 50_aR, 50_b1, . . . , 50_bS, . . . , 50_N1, . . . , 50_NT, where R, S, T and N are appropriate positive integers. Each of the buffer locations included in the memory 44 are configured to buffer one or more bytes of data. As an example, each of the buffer locations 50_a1, . . . , 50_aR is configured to store 32 bytes of data, each of the buffer locations 50_b1, . . . , 50_bS is configured to store 256 bytes of data, each of the buffer locations 50_N1, . . . , 50_NT is configured to store 1056 bytes of data, and so on. In an embodiment, one or more of the illustrated buffer locations are contiguous buffer locations in the memory 44.
The processing core 12a, . . . , processing core 12M, network interface 16a, . . . , and/or network interface 16P (and/or one or more other components of the SOC 10, e.g., a interface controller in the SOC 10, an engine in the SOC 10, etc., not illustrated in
In an embodiment, the BMU 24 is associated with a plurality of buffer pointer pools (BPPs), where each BPP comprises a list of buffer pointers, and where a buffer pointer is an address or a pointer of a corresponding buffer location in the memory 44. For example, although not illustrated in
As will be discussed in more detail herein later, in an embodiment, the BMU 24 includes a BMU controller 28 that is configured to monitor, for each IBPP, a number of unassigned buffer pointers (e.g., not assigned to any client component, and is readily available for assignment to a client component) in the IBPP (e.g., IBPP 32a). For example, an unassigned buffer pointer includes a corresponding buffer address that is available for allocation. Although not illustrated in
Although not illustrated in
As previously discussed, each BPP comprises a list of buffer pointers, where a buffer pointer is an address or a pointer of a corresponding buffer location. For example, BPP_a comprises R number of buffer pointers corresponding to buffer locations 50_a1, 50_a2, . . . , 50_aR, BPP_b comprises S number of buffer pointers corresponding to buffer locations 50_b1, 50_b2, . . . , 50_bS, BPP_N comprises T number of buffer pointers corresponding to buffer locations 50_N1, 50_N2, . . . , 50_NT, and so on.
The BMU 24 includes the BMU controller 28, which is configured to dynamically allocate buffer pointers associated with a BPP from the EBPP to the IBPP and/or from the IBPP to the EBPP. In an embodiment, the BMU controller 28 stores, corresponding to each IBPP, a count M. For example, the BMU controller 28 stores counts Ma, . . . , MN corresponding to IBPPa, . . . , IBPPN. In an embodiment and as will be discussed in more detail herein later, a count corresponding to an IBPP (e.g., count Ma corresponding to IBPPa) keeps a count of unassigned buffer pointers (e.g., number of unassigned buffer pointers) in the IBPP. The BMU 24 also includes one or more other components (e.g., a transmit port, a receive port, a transmit queue, etc.), which are not illustrated in
For each BPP, the BMU 24 (and/or the processing core 12a, processing core 12b, and/or by any other appropriate component of the system 100) initially (e.g., during a startup of the system 100) allocates some of the buffer pointers of the BPP to the corresponding IBPP, and the remaining buffer pointers of the BPP to the corresponding EBPP. For example, of the R buffer pointers included in the BPP_a, R1 buffer pointers are dynamically allocated to IBPP 32a, and remaining R2 buffer pointers are allocated to the EBPP 36a.
When a client component (e.g., one of the processing cores and/or the network interfaces of
Individual buffer pointers allocated to an IBPP are added to the IBPP list. They are unassigned (e.g., not assigned to any client, and is readily available for assignment to a client component). When an unassigned buffer pointer from an IBPP (e.g., a buffer pointer from the IBPP 32a, corresponding to the buffer location 50_a2) is assigned to a client component, the buffer pointer is removed from the IBPP list, and a number of unassigned buffer pointers in the IBPP is decreased by one. Once the buffer pointer is assigned to the client component, the client component may store or write the data packet in the corresponding buffer location (e.g., in the buffer location 50_a2).
On the other hand, when contents of a buffer location (e.g., buffer location 50_a2) are read by a client component, the buffer location becomes free, i.e., available for future storage. Accordingly, the corresponding buffer pointer (which was earlier assigned to the client component) is released by the BMU 24 (i.e., the buffer pointer is added to IBPP and marked as unassigned), so that the buffer pointer is available for future assignment. That is, based on reading from a buffer location, the corresponding buffer pointer is released, which results in an increase (e.g., an increase of one) in the number of unassigned buffer pointers in the corresponding IBPP.
As previously discussed, a count corresponding to an IBPP (e.g., count Ma corresponding to IBPPa) keeps a count of unassigned buffer pointers in the IBPP. In an embodiment, when a number of unassigned buffer pointers in an IBPP decreases (e.g., decreases due to assignment of buffer pointers from the IBPP to one or more client components) beyond the corresponding low threshold value, the BMU 24 re-allocates one or more buffer pointers from the corresponding EBPP to the IBPP. For example, due to assignment of buffer pointers from the IBPP 32a to one or more client components, the number of unassigned buffer pointers in the IBPP 32a can decrease below the low threshold value. If the number of unassigned buffer pointers in the IBPP 32a decreases beyond the low threshold value, a plurality of buffer pointers is re-allocated from the corresponding EBPP (i.e., EBPP 36a) to the IBPP 32a. The plurality of re-allocated buffer pointers (e.g., 32 buffer pointers) are transmitted from the EBPP 36a to the IBPP 32a, and are stored in the IBPP 32a for possible future allocation to one or more client components. Such re-allocation of buffer pointers, from an EBPP to a corresponding IBPP, ensures that at least a few buffer pointers are always readily available in the IBPP for allocation to one or more client components (i.e., few unassigned buffer pointers are always available in the IBPP). In other words at least a few buffers that are managed locally on the SoC are always readily available for allocation to a client component.
On the other hand, due to release of buffer pointers by one or more client components, the number of unassigned buffer pointers in an IBPP can increase beyond the corresponding high threshold value. If the number of unassigned buffer pointers in an IBPP increases beyond the high threshold value, a plurality of buffer pointers is re-allocated from the IBPP to the corresponding EBPP. Such re-allocation of buffer pointers ensures that an IBPP is not overflowed with unassigned buffer pointers, and that the storage space required by all the IBPPs in the BMU 24 is relatively limited. In other words, the number of buffers that is managed locally on the SoC is limited so as to maintain ease of manageability on the SoC.
In an embodiment, the low threshold value and the high threshold value are configurable. For example, the low threshold and the high threshold values can be configured to ensure that unassigned buffer pointers are always available in the IBPPs, and to also ensure a relatively small storage space required in the SOC 10 to store the buffer pointers of the IBPPs.
Transmission of buffer pointers between an IBPP and a corresponding EBPP (e.g., during re-allocation of buffer pointers) can take place in batches of buffer pointers. For example, 32 buffer pointers are re-allocated and transmitted as a single batch from EBPP 36a to IBPP32a, or vice versa (e.g., the 32 buffer pointers are transmitted in a single transaction or as a single transmission, from the EBPP 36a to the IBPP 32a, or vice versa). In an embodiment, such batch transmission of buffer pointers (e.g., instead of separately transmitting the 32 buffer pointers) reduces the number of transactions to the memory 44, the load on bus20, the load on memory controller 40, and/or bandwidth requirement for the transmission.
In an embodiment, in some situations, one or more buffer pointers can also be assigned to one or more client components directly from an EBPP. For example, if unassigned buffer pointers in an IBPP are exhausted (e.g., exhausted rapidly due to rapid assignment of several buffer pointers to client components) before re-allocation and transmission of a batch of buffer pointers from the corresponding EBPP to the IBPP, then one or more buffer pointers can be assigned to one or more client components directly from the EBPP.
In an embodiment, the SOC 10 processes data packets received from, for example, a plurality of traffic flows originating from outside the SOC 10. Sizes of data packets, which are processed by the SOC 10, can vary considerably. In an embodiment, selection of an IBPP for assigning a buffer pointer is based at least in part on a size of a data packet that is to be buffered. For example, individual buffer locations associated with a single BPP are of similar sizes, while buffer locations associated with different BPPs are of different sizes. For example, each of the buffer locations 50_a1, . . . , 50_aR, associated with BPP_a, has 32 bytes storage capacity. On the other hand, each of the buffer locations 50_b1, . . . , 50_bS, associated with BPP_b, has 256 bytes storage capacity. Accordingly, when a client component (e.g., network interface 16a) wants to buffer a 16 byte data packet, the BMU 24 assigns a buffer pointer from IBBP 32a (i.e., assigns one of the buffer locations 50_a1, . . . , 50_aR) to the client component. However, when the client component wants to buffer a 128 byte data packet, the BMU 24 assigns a buffer pointer from IBBP 32b (i.e., assigns one of the buffer locations 50_b1, . . . , 50_bS) to the client component.
In an embodiment, for a multi-core system (such as the SOC 10), each BPP is associated with a corresponding processing core. For example, processing core 12a is assigned BPP_a (i.e., IBPP 32a assigns buffer pointers to the processing core 12a), processing core 12b is assigned BPP_b (i.e., IBPP 32b assigns buffer pointers to the processing core 12b), and so on. That is, each processing core has its own buffer area. Thus, in an embodiment, buffer pointer pool allocation is based on an origin of the data packets that are to be buffered (e.g., whether the data packets are originated from processing core 12a, processing core 12b, and/or the like).
In an embodiment, selection of an IBPP for assigning a buffer pointer can be based on any other appropriate criterion.
In an embodiment, management and/or assignment of buffer pointers by the BMU 24 requires minimal or no supervision by the processing cores 12a, . . . , 12M. That is, the use of BMU 24 relieves the processing cores from buffer management and/or assignment duties, thereby considerably saving processing power of the processing cores. In contrast, in a conventional buffer management system, generally a processing core is involved in buffer management and/or assignment.
Maintaining an IBPP and a corresponding EBPP, and assigning buffer pointers from the IBPP (e.g., instead of assigning from the EBPP) has several advantages. For example, one or more of the client components and the IBPP are all located within the SOC 10. Accordingly, an assignment of a buffer pointer from the IBPP to a client component is relatively faster compared to an assignment of a buffer pointer from the EBPP to the client component. Furthermore, maintaining the EBPP (e.g., instead of storing all the buffer pointers in the IBPPs) ensures a relatively small storage size required for storing the buffer pointers of the IBPPs (as storage in the SOC 10 is relatively limited in comparison to storage in the memory 44, which is external to the SOC 10).
In an embodiment, a descriptor associated with a buffer location includes a physical address and a virtual address of the buffer location. In an embodiment, the BMU24 assigns and/releases buffer pointers by using its physical address. In another embodiment, each buffer location (e.g. buffer location 50_a1) includes both physical and virtual address, so when the BMU24 assigns and/or releases buffer pointer, both physical and virtual address are assigned and/or released.
Another way to handle the virtual address is to write each virtual address to the buffer itself (e.g., written during a system initialization phase). In this way the BMU 24, when allocating buffer pointers, transmits only the physical address of the buffer to the client. Then the client, if it needs the virtual address of the buffer, can read the virtual address of the buffer from the buffer itself (e.g. from the first 4 bytes of the buffer, if the virtual address is 32 bit length). For example,
In a conventional system, a processing core generally manages buffer assignments. As a processing core usually deals with virtual addresses, in such a conventional system, the processing core only keeps track of a virtual address of a buffer location. In contrast, the buffer locations in the system 100 are accessed by the processing cores, network interfaces, BMU 24, and/or by any appropriate client components of the BMU 24. In an example, the network interfaces and/or the BMU 24 access the buffer locations using physical addresses of the buffer locations, and the processing cores access the buffer locations using virtual addresses of the buffer locations. Accordingly, the BMU 24 maintains both the physical and virtual addresses of the buffer locations in the corresponding buffer location descriptors, thereby enabling seamless access of the buffer locations by both the processing cores and the network interfaces (and/or by any other client component of the BMU 24).
The buffer pointers 210c, . . . , 210e, illustrated without any shading, are available for possible re-allocation to the IBPP 32a. The buffer pointers 210a, 210b, 210f, . . . , 210h (e.g., the buffer pointers between the head and the tail addresses) are unavailable for re-allocation (e.g., as they are not part of the buffer pointer list), and are illustrated using grey shading. Although
In an embodiment, the buffer pointers included in the EBPP 36a have sequential addresses. For example, an address of the buffer pointer 210b can be generated by incrementing an address of the buffer pointer 210a, an address of the buffer pointer 210c can be generated by incrementing an address of the buffer pointer 210b, and so on. A start address associated with the EBPP 36a refers to an address (e.g., a virtual address and/or a physical address) of a first buffer pointer (e.g., buffer pointer 210a) of the EBPP 36a. A stop address associated with the EBPP 36a refers to an address (e.g., a virtual address and/or a physical address) of a last buffer pointer (e.g., buffer pointer 210h) of the EBPP 36a. As buffer pointers are re-allocated from the EBPP 36a to the IBPP 32a (or vice versa) in a batch, in an embodiment, contiguous buffer pointers 210c, . . . , 210e of the EBPP 36a are available for possible re-allocation to the IBPP 32a. A head address associated with the EBPP 36a refers to an address (e.g., a virtual address and/or a physical address) of a first buffer pointer (e.g., buffer pointer 210c) of a plurality of buffer pointers (e.g., buffer pointers 210c, 210d, 210e), which are available for re-allocation to the IBPP 32a. A tail address associated with the EBPP 36a refers to an address (e.g., a virtual address and/or a physical address) of a last buffer pointer (e.g., buffer pointer 210e) of a plurality of buffer pointers (e.g., buffer pointers 210c, 210d, 210e), which are available for re-allocation to the IBPP 32a. The head and tail addresses of the EBPP 36a dynamically changes with allocation and/or re-allocation of buffer pointers between the IBPP 32a and the EBPP 36a.
In an embodiment, the BMU 24 stores the start and stop addresses, and the current head and tail addresses of the EBPP 36a. Based on these addresses, the BMU 24 is aware of a number of buffer pointers available in the EBPP 36a for possible re-allocation to the IBPP 32a. For example, a difference between a head address and a tail address is an indication of a number of buffer pointers available for re-allocation to the IBPP 32a.
Although not illustrated in
Referring to
Data and/or instructions received in the receive port 304 of the BMU 24 is queued in a receive queue 320 (e.g., a first-in first-out queue), and selectively transmitted to the BMU controller 28, to one of the IBPPs, to the BMU DMA 312, and/or to registers files 316.
The BMU controller 28 includes a buffer pointer address pool 308, which is configured to store start addresses, stop addresses, head addresses and/or tail addresses of various IBPPs and EBPPs. The BMU controller 28 also includes a write logic 348, a read logic 352, and a multiplexer 340.
In an embodiment, the BMU controller 28 keeps track of unassigned buffer pointers in each of the IBPPs and EBPPs, e.g., by monitoring various addresses in the buffer pointer address pool 308. Based on comparing a number of unassigned buffer pointers in an IBPP with the previously discussed high and low thresholds, the BMU controller 28 determines if buffer pointers are to be re-allocated, either from the IBPP to a corresponding EBPP, or from the EBPP to the IBPP. In the case of such re-allocation of the buffer pointers from the EBPP to the IBPP, the BMU DMA 312 transmits a pull request to the EBPP, via the multiplexer 344, the transmit queue 324, and the transmit port 328.
If buffer pointers are to be re-allocated from an IBPP to a corresponding EBPP, the BMU DMA 312 transmits a push request (e.g., to facilitate re-allocation of buffer pointers from an IBPP to a corresponding EBPP) to the IBPP, via the multiplexer 340 and the read logic 352. Based on receiving the push request, the IBPP transmits the re-allocated buffer pointers, via multiplexer 344, transmit queue 324, and the transmit port 328, to the corresponding EBPP in the memory 44. The multiplexer 344 selectively multiplexes inputs from the IBPP storage unit 32, the BMU DMA 312 and the register files 316 based on, for example, when the input from one of these components are enabled.
When the BMU controller 28 receives a buffer allocation request, the BMU controller 28 selects an appropriate BPP based on, for example, a size of a data packet that is to be buffered, the client component from which the request is received, numbers of unassigned buffer pointers available in various IBPPs, and/or the like. The IBPP corresponding to the selected BPP receives the allocation request via the multiplexer 340 and the read logic 352, and transmits the allocated buffer pointer to the client component via multiplexer 344, transmit queue 324, and the transmit port 328.
When the BMU controller 28 receives a buffer release request, the corresponding IBPP (e.g., the IBPP whose buffer pointer is to be released) receives the release request via the write logic 348 (e.g., which transmits the release request to the IBPP storage unit 32), and releases the buffer pointer by writing the buffer pointer to the IBPP list.
The register files 316 are configured to store various configuration information associated with the BMU 24. In an example, the register files 316 communicates with the BMU controller 28, receives information that are received by one or more other components of the BMU 24, and periodically updates various configuration information stored in the register files 316.
Subsequent to such an allocation, the BMU 24 receives either an allocation request at 408, or a release request at 430. For example, at 408, the BMU 24 receives an allocation request for a buffer location from a first component (e.g., from the network interface 16a). At 412, the BMU 24 assigns a first buffer location to the first component by assigning a corresponding first buffer pointer of the first plurality of buffer pointers from the IBPP 32a to the first component. In an embodiment, the BMU 24 deletes the first buffer pointer from the unassigned buffer pointer list, in response to assigning the first buffer location.
At 416, the BMU 24 determines whether a number of unassigned buffer pointers in the IBPP 32a is less than a low threshold value. If the number of unassigned buffer pointers is not less than the low threshold value (i.e., no at 416), the method loops back to one of the operations at 408 or 430. On the other hand, if the number of unassigned buffer pointers is less than the low threshold value (i.e., yes at 416), at 420 the BMU 24 dynamically re-allocates a third plurality of buffer pointers of the second plurality of buffer pointers from the EBPP 36a to the IBPP 32a (e.g., re-allocates a plurality of buffer pointers from the EBPP 36a to the IBPP 32a). Subsequent to 420, the method loops back to one of the operations at 408 or 430.
Referring again to operations at 430, the BMU 24 receives the release request from a second component (e.g., processing core 12a), requesting to release a second buffer location associated with a second buffer pointer of the first plurality of buffer pointers. In an example, the second buffer location was previously assigned by the BMU 24 to the second component. At 434, the BMU 24 releases the second buffer location, and marks the second buffer pointer as unassigned. At 438, the BMU 24 determines whether a number of unassigned buffer pointers in the IBBP 32a is greater than a high threshold value. If the number of unassigned buffer pointers in the IBBP 32a is not greater than the high threshold value (i.e., no at 438), the method loops back to one of the operations at 408 or 430. If, on the other hand, the number of unassigned buffer pointers in the IBBP 32a is greater than the high threshold value (i.e., yes at 438), at 442 the BMU 24 dynamically re-allocates a fourth plurality of buffer pointers of the second plurality of buffer pointers from the IBPP 32a to the EBPP 36a (e.g., re-allocates a plurality of buffer pointers from the IBPP 32a to the EBPP 36a). Subsequent to 442, the method loops back to one of the operations at 408 or 430.
Although specific embodiments have been illustrated and described herein, it is noted that a wide variety of alternate and/or equivalent implementations may be substituted for the specific embodiment shown and described without departing from the scope of the present disclosure. The present disclosure covers all methods, apparatus, and articles of manufacture fairly falling within the scope of the appended claims either literally or under the doctrine of equivalents. This application is intended to cover any adaptations or variations of the embodiment disclosed herein. Therefore, it is manifested and intended that the present disclosure be limited only by the claims and the equivalents thereof.
The present disclosure is a continuation of and claims priority to U.S. patent application Ser. No. 13/038,266, filed Mar. 1, 2011, now U.S. Pat. No. 8,327,047, issued Dec. 4, 2012, which claims priority to U.S. Patent Application No. 61/315,327, filed Mar. 18, 2010, and U.S. Patent Application No. 61/347,947, filed May 25, 2010, which are incorporated herein by reference. The present application is related to U.S. patent application Ser. No. 12/947,678, filed Nov. 16, 2010, to U.S. patent application Ser. No. 13/038,279, filed Mar. 1, 2011, and to U.S. patent application Ser. No. 13/038,258, filed Mar. 1, 2011, the entire specifications of which are hereby incorporated by reference in their entirety for all purposes, except for those sections, if any, that are inconsistent with this specification.
Number | Name | Date | Kind |
---|---|---|---|
4574351 | Dang et al. | Mar 1986 | A |
4612612 | Woffinden et al. | Sep 1986 | A |
4682281 | Woffinden et al. | Jul 1987 | A |
5315707 | Seaman et al. | May 1994 | A |
5657471 | Lary et al. | Aug 1997 | A |
5860149 | Fiacco et al. | Jan 1999 | A |
6009463 | Brandt et al. | Dec 1999 | A |
6078993 | Iwata et al. | Jun 2000 | A |
6112265 | Harriman et al. | Aug 2000 | A |
6282589 | Porterfield et al. | Aug 2001 | B1 |
6343351 | Lackman et al. | Jan 2002 | B1 |
6378052 | Genduso et al. | Apr 2002 | B1 |
6487640 | Lipasti | Nov 2002 | B1 |
6647423 | Regnier et al. | Nov 2003 | B2 |
6654860 | Strongin et al. | Nov 2003 | B1 |
6918005 | Marchant et al. | Jul 2005 | B1 |
6963924 | Huang et al. | Nov 2005 | B1 |
7093094 | Cismas | Aug 2006 | B2 |
7146478 | Herkerdorf et al. | Dec 2006 | B2 |
7430623 | Walls et al. | Sep 2008 | B2 |
7600131 | Krishna et al. | Oct 2009 | B1 |
7664938 | Tripathi et al. | Feb 2010 | B1 |
7813342 | Gadelrab | Oct 2010 | B2 |
7818389 | Chiang et al. | Oct 2010 | B1 |
7877524 | Annem et al. | Jan 2011 | B1 |
7889734 | Hendel et al. | Feb 2011 | B1 |
7930451 | Chen et al. | Apr 2011 | B2 |
8250322 | Huang et al. | Aug 2012 | B2 |
20040184470 | Holden | Sep 2004 | A1 |
20040268044 | Heller, Jr. et al. | Dec 2004 | A1 |
20050021913 | Heller, Jr. | Jan 2005 | A1 |
20050100042 | Illikkal | May 2005 | A1 |
20050193158 | Srinivasan et al. | Sep 2005 | A1 |
20050198464 | Sokolov | Sep 2005 | A1 |
20050256976 | Susairaj et al. | Nov 2005 | A1 |
20050286513 | King | Dec 2005 | A1 |
20060004941 | Shah et al. | Jan 2006 | A1 |
20060026342 | Calvignac et al. | Feb 2006 | A1 |
20060045090 | Ronciak et al. | Mar 2006 | A1 |
20060072564 | Cornett et al. | Apr 2006 | A1 |
20060179333 | Brittain et al. | Aug 2006 | A1 |
20060236063 | Hausauer et al. | Oct 2006 | A1 |
20060288134 | Baker et al. | Dec 2006 | A1 |
20070081538 | Ganji | Apr 2007 | A1 |
20070127485 | Kim et al. | Jun 2007 | A1 |
20080005405 | Innis et al. | Jan 2008 | A1 |
20080109613 | Jarosh et al. | May 2008 | A1 |
20080112415 | Sobaje | May 2008 | A1 |
20080228871 | Sano | Sep 2008 | A1 |
20080232374 | Kopelman et al. | Sep 2008 | A1 |
20080240111 | Gadelrab | Oct 2008 | A1 |
20080279208 | Walls et al. | Nov 2008 | A1 |
20090083392 | Wong et al. | Mar 2009 | A1 |
20090086733 | Barrack et al. | Apr 2009 | A1 |
20100118885 | Congdon | May 2010 | A1 |
20110072162 | Rysavy | Mar 2011 | A1 |
20120218890 | Gerkis | Aug 2012 | A1 |
20120219002 | Sobaje | Aug 2012 | A1 |
20120317360 | Zettler et al. | Dec 2012 | A1 |
20120331227 | Saripalli | Dec 2012 | A1 |
20140153575 | Munoz | Jun 2014 | A1 |
Number | Date | Country |
---|---|---|
1226704 | Aug 1999 | CN |
1534487 | Oct 2004 | CN |
1617107 | May 2005 | CN |
1682502 | Oct 2005 | CN |
1922591 | Feb 2007 | CN |
H05173953 | Jul 1993 | JP |
H07202946 | Aug 1995 | JP |
2002278834 | Sep 2002 | JP |
2005018772 | Jan 2005 | JP |
2006513510 | Apr 2006 | JP |
Entry |
---|
“System-on-Chip Packet Processor for an Experimental Network Services Platform” by David Taylor. Alex Chandra. Yuhua Chen. Sarang Dharmapurikar, John Lockwood. Wenjing Tang. Jonathan Turner; Washington University in Saint Louis; GLOBECOM 2003. |
Number | Date | Country | |
---|---|---|---|
20130088965 A1 | Apr 2013 | US |
Number | Date | Country | |
---|---|---|---|
61315327 | Mar 2010 | US | |
61347947 | May 2010 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 13038266 | Mar 2011 | US |
Child | 13692635 | US |