The background description provided herein is for the purpose of generally presenting the context of the disclosure. Work of the presently named inventors, to the extent it is described in this background section, as well as aspects of the description that may not otherwise qualify as prior art at the time of filing, are neither expressly nor impliedly admitted as prior art against the present disclosure.
Memories are used in networks to enable rapid data transfer from one or more data sources to any of a plurality of destinations, oftentimes in switching devices.
Ports 30-37 typically operate at network speeds; e.g., at or about 1 GHz. However, memory array 20 typically operates at a significantly slower speed; e.g., 100-200 MHz. Consequently, the architecture 10 requires FIFO buffers to temporarily store the data that is going into or coming out of memory array 20. However, FIFO buffers 40-47 are typically located close to ports 30-37, which limits the effective operational rate of FIFO buffers 40-47 and memory array 20 due to the loading requirements of busses 50 and 52 (e.g., the current and/or voltage needed to overcome or control the inherent capacitance[s], resistance[s] and/or impedance of busses 50 and 52). Thus, to improve throughput using the architecture of
There are physical limits to the maximum throughput of architecture 10, however. Memory can only go so fast in any given process technology, and increasing the width of the memory limits its speed due to internal loading of the memory's control signals. Increasing the external width of a memory causes increased die area and die cost. In the example of
A need therefore exists to increase the operational speed of multiport memories to keep up with ever-increasing demands for increased network speeds and high network switching flexibility.
Aspects of the present disclosure relate to multiport memory architectures, systems and methods for using the same. The multiport memory architecture generally comprises (a) a memory array; (b) a plurality of ports configured to receive and/or transmit data; and (c) a plurality of port buffers, each of which is configured to transmit the data to and/or receive the data from one or more of the ports, and all of which are configured to (i) transmit the data to the memory array on a first common bus and (ii) receive the data from the memory array on a second common bus. The systems and network switches generally comprise those that include an architecture embodying one or more of the inventive concepts disclosed herein.
The method of writing generally comprises the steps of (1) converting serial data to n-bit-wide parallel data, n bits of data forming a word; (2) buffering a k-word-long block of the n-bit-wide parallel data; and (3) substantially simultaneously writing the k*n bits of data into the memory. Aspects of the disclosure also relate to a method of reading data from a memory, comprising the steps of (1′) substantially simultaneously outputting k*n bits of data from the memory onto a k*n-bit-wide bus; (2′) converting the k*n bits of data into n-bit-wide parallel data; and (3′) converting the n-bit-wide parallel data into serial data to be read externally from the memory. Aspects of the disclosure also concern a method of transferring data in a network, comprising a combination of one or more steps from each of the present methods of writing to and reading from a memory.
Aspects of the present disclosure advantageously reduce latency in data communications, particularly in packet network switches, by tightly coupling the port buffers to the main memory, thereby advantageously enabling (1) use of point-to-point communications over relatively long segments of the memory read and write paths and (2) the elimination of a FIFO memory in the memory read and write paths. Thus, the techniques and apparatuses described herein also provide generally reduced routing congestion and reduced die sizes, particularly when using standard cell-based design techniques. On-chip point-to-point communications from bond pad to port buffers and vice versa further reduces parasitics in the corresponding wires. By tightly coupling port buffers to the main memory array, RC components of the memory read and write busses are reduced, further increasing data transmission rates and throughput. In contrast, the routing of the architecture of
These and other advantages of the present disclosure will become readily apparent from the detailed description of preferred aspects below.
Reference will now be made in detail to various aspects of the disclosure, examples of which are illustrated in the accompanying drawings. While these aspects will be described in conjunction with various implementations, it will be understood that they are not intended to limit the disclosure to these aspects. On the contrary, these aspects are intended to cover alternatives, modifications and equivalents, which may be included within the spirit and scope of the disclosure as defined by the appended claims. Furthermore, in the following detailed description of various aspects, numerous specific details are set forth in order to provide a thorough understanding of the present disclosure. However, it will be readily apparent to one skilled in the art that aspects of the present disclosure may be practiced without these specific details. In other instances, well-known methods, procedures, components, and circuits have not been described in detail so as not to unnecessarily obscure aspects of the present disclosure.
Some portions of the detailed descriptions which follow are presented in terms of processes, procedures, logic blocks, functional blocks, processing, and other symbolic representations of operations on data bits, data streams or waveforms within a computer, processor, controller and/or memory. These descriptions and representations are generally used by those skilled in the data processing arts to effectively convey the substance of their work to others skilled in the art. A process, procedure, logic block, function, process, etc., is herein, and is generally, considered to be a self-consistent sequence of steps or instructions leading to a desired and/or expected result. The steps generally include physical manipulations of physical quantities. Usually, though not necessarily, these quantities take the form of electrical, magnetic, optical, or quantum signals capable of being stored, transferred, combined, compared, and otherwise manipulated in a computer or data processing system. It has proven convenient at times, principally for reasons of common usage, to refer to these signals as bits, waves, waveforms, streams, values, elements, symbols, characters, terms, numbers, or the like.
It should be borne in mind, however, that all of these and similar terms are associated with the appropriate physical quantities and are merely convenient labels applied to these quantities. Unless specifically stated otherwise and/or as is apparent from the following discussions, it is appreciated that throughout the present application, discussions utilizing terms such as “processing,” “operating,” “computing,” “calculating,” “determining,” “manipulating,” “transforming,” “displaying” or the like, refer to the action and processes of a computer or data processing system, or similar processing device (e.g., an electrical, optical, or quantum computing or processing device), that manipulates and transforms data represented as physical (e.g., electronic) quantities. The terms refer to actions and processes of the processing devices that manipulate or transform physical quantities within the component(s) of a system or architecture (e.g., registers, memories, other such information storage, transmission or display devices, etc.) into other data similarly represented as physical quantities within other components of the same or a different system or architecture.
Furthermore, for the sake of convenience and simplicity, the terms “clock,” “time,” “rate,” “period” and “frequency” may be used somewhat interchangeably herein, but are generally given their art-recognized meanings. Also, for convenience and simplicity, the terms “data,” “data stream,” “signal,” “waveform” and “information” may be used interchangeably, as may the terms “connected to,” “coupled with,” “coupled to,” and “in communication with” (which may refer to a direct or indirect link or signal path), but these terms are also generally given their art-recognized meanings.
The present disclosure concerns a multiport memory architecture, and systems comprising and methods of using the same. The multiport memory architecture generally comprises (a) a memory array; (b) a plurality of ports configured to receive and/or transmit data; and (c) a plurality of port buffers, each of which is configured to transmit the data to and/or receive the data from one or more of the ports, and all of which are configured to (i) transmit the data to the memory array on a first common bus and (ii) receive the data from the memory array on a second common bus. A further aspect of the disclosure concerns a network switch, system, and network generally comprising the present architecture and/or embodying one or more of the inventive concepts described herein.
Even further aspects of the disclosure concern methods of reading from and/or writing to a memory. The method of writing generally comprises the steps of (1) converting serial data to n-bit-wide parallel data, n bits of data forming a word; (2) buffering a k-word-long block of the n-bit-wide parallel data; and (3) substantially simultaneously writing the k*n bits of data into the memory. The disclosure also relates to method of reading data from a memory, comprising the steps of (1′) substantially simultaneously outputting k*n bits of data from the memory onto a k*n-bit-wide bus; (2′) converting the k*n bits of data into n-bit-wide parallel data; and (3′) converting the n-bit-wide parallel data into serial data to be read externally from the memory. The disclosure also concerns a method of transferring data in a network, comprising a combination of one or more steps from each of the present methods of writing to and reading from a memory.
The disclosure, in its various aspects, will be explained in greater detail below with regard to exemplary aspects.
An Exemplary Memory Architecture
One aspect relates to a multiport memory architecture generally comprises (a) a memory array; (b) a plurality of ports configured to receive and/or transmit data; and (c) a plurality of port buffers, each of which is configured to transmit data to and/or receive data from one or more of the ports, and all of which are configured to (i) transmit block of the data to the memory array on a first common bus and (ii) receive a block of the data from the memory array on a second common bus.
In the present architecture, the memory array is conventional, and may comprise a plurality of memory sub-arrays. These sub-arrays may comprise one or more rows, columns, blocks or pages of memory, pages being a preferred implementation (a so-called “multiport page mode memory,” or MPPM). Each of the memory rows, columns, blocks and/or pages may be identifiable and/or accessible by a unique memory address corresponding to the row, column, block and/or page. In a preferred implementation, each of the blocks of data transferred between memory array 110 and a port buffer 120-127 comprises a page of data. Typically, the minimum density of the memory array 110 is 256 kb or 1 Mb. While the maximum density of the memory array 110 is not limited, as a practical matter, a typical maximum density is about 32 Mb or 128 Mb.
The nature of the memory elements in memory array 110 is also not particularly limited, and may include latches, static random access memory (SRAM), dynamic random access memory (DRAM), magnetic random access memory (MRAM), electrically erasable and programmable read only memory (EEPROM) and flash memory, although for simplicity, speed and low power considerations, latches are preferred. The memory array 110 may also be synchronous or asynchronous, but for speed and timing considerations, synchronous memory is preferred.
In the present architecture, the port buffers 120-127 may be considered “tightly coupled” to the memory array 110. In essence, “tightly coupled” means that the port buffers 120-127 are in closer proximity to the memory array 110 than they are to ports 130-145, and that the memory busses 150a, 150b, 155a and 155b are designed to reduce or minimize RC components, such as bus length (corresponding to resistance) and/or parasitic capacitance between adjacent metal lines in the bus. While the port buffers 120-127 are shown on different sides of memory array 110, and the ports 130-144 are shown on different sides of port buffers 120-127, and the port buffers 120-127 can be located on one side of array 110 (see, e.g.,
In the present multiport memory architecture, the number of port buffers may be any integer of 2 or more, 3 or more, or 4 or more. In certain implementations, there may be (2x−d) port buffers in the architecture, x being an integer of at least 3, and in various aspects, of from 4 to 8 (e.g., 5 or 6), and d is 0 or an integer of (2x-1−1) or less. The value of d may be determined by the number of parallel registers that accompany the port buffers (e.g., that have a port buffer address), but which provide a different function, such as “snoop” register 140 and/or parallel read and write registers 141-142. Independently, the number of corresponding ports is generally 2 or more, 3 or more, or 4 or more, and in certain implementations, may be (2x−d), where x and d are as described above. In one implementation, there are 10 ports. Preferably, the ports and port buffers are in a 1:1 relationship, although it is not necessarily the case that each port communicates with only a single port buffer (or vice versa; a so-called “dedicated” port or port buffer).
Referring now to
In preferred implementations, the read portion 250i and the write portion 240i each independently comprises a*(2y+b) entries, where a is the number of lines or rows of entries (e.g., write lines 242 and/or 244), 2y is the number of entries in a line or row, y is an integer of at least 3, and b is 0 or an integer of (2y−1) or less. In some aspects, b is 0 and y is an integer of from 4 to 8, and in specific aspects, y is 5 or 6.
Referring back to
Again referring back to
The port buffers in the present architecture may be single buffered (see, e.g.,
The present architecture enables processing and/or transfers of data at a variety of rates and/or across time domains. For example, the memory array may operate at a first frequency, and each of the ports may operate independently at a second frequency greater or less than the first frequency. For example, and referring back to
Continuing to refer to
Read-only “snoop” register 142 (
An Exemplary Packet Network Switch, System, and Network
In a further aspect, the network switch, system, and network generally comprise those that include an architecture embodying one or more of the inventive concepts disclosed herein. For example, the network switch may simply comprise the present multiport memory architecture. In preferred aspects, the network switch is embodied on a single integrated circuit.
As discussed above, one advantage of the aspects described herein is that a FIFO buffer to buffer data between a port and main memory is not necessary, thereby reducing the area of an IC dedicated to FIFO-main memory routing and (ideally) increasing data transmission speeds though the IC. Therefore, the present network switch may comprise a plurality of port buffers that each (i) transmit the data to a corresponding port along a first data path and (ii) receive the data from the corresponding port along a second data path, wherein none of these data paths includes a first-in-first-out (FIFO) memory.
In further aspects, the system may include a port that is configured to convert serial data from the network to parallel data for processing in the network switch, and/or convert parallel data from the network switch to serial data for the network. In most implementations, the system port will be the memory architecture port described above, but in some implementations, the system port can be a separate port configured to transmit data externally to an integrated circuit (IC) that includes the memory architecture and a transmitter. Thus, the system may further include (i) at least one port (and preferably a plurality of ports) comprising a transmitter configured to transmit serial data to an external receiver; and (ii) at least one port (and preferably a plurality of ports) comprising a receiver configured to receive externally-generated serial data (e.g., serial data from an external transmitter).
The aspects further relate to a network, comprising at least one of the present systems, and a plurality of storage or data communications devices, each of the devices being communicatively coupled to the system. In further aspects, the network may comprise (a) a plurality of the present systems, which may be communicatively coupled to each other and/or cascaded with each other; and (b) a plurality of storage or communications devices, wherein each storage or communications device is communicatively coupled to at least one of the systems. In one implementation, each of the devices is communicatively coupled to a unique system. The network may be any kind of known network, such as a packet switching network.
Exemplary Methods
Various aspects described herein relate to method of writing data to a memory, comprising the steps of (a) converting serial data to n-bit-wide parallel data, n bits of data forming a word; (b) buffering a k-word-long block of the n-bit-wide parallel data; and (c) substantially simultaneously writing the k*n bits of data into the memory. The aspects also relate to method of reading data from a memory, comprising the steps of (1) substantially simultaneously outputting k*n bits of data from the memory onto a k*n-bit-wide bus; (2) converting the k*n bits of data into n-bit-wide parallel data; and (3) converting the n-bit-wide parallel data into serial data to be read externally from the memory. The aspects also concern a method of transferring data in a network, comprising combinations of steps in the methods of writing and reading.
In one implementation of the method of writing, buffering may comprise sequentially writing k words of the n-bit-wide parallel data into k data storage elements. In a further aspects of the method(s) of reading and/or writing, the step of converting serial data to n-bit-wide parallel data may be conducted at a first frequency, the buffering step at a second frequency, and the step of substantially simultaneously writing the k*n bits of data at a third frequency, the first frequency being the same as or different from both the second and the third frequencies. As discussed above, the first frequency may be greater or less than the second and third frequencies. However, the third frequency is generally substantially the same as or higher than the second frequency.
The method of writing data may further comprise the step(s) of (i) identifying one of a plurality of buffer addresses for buffering the k-word-long block of the n-bit-wide parallel data, (ii) identifying one of a plurality of memory addresses for substantially simultaneously writing all k*n bits of data into the memory, (iii) receiving the serial data.
The aspects described herein further encompasse a method of transferring data in a network, comprising: the present method of writing data to a memory, and substantially simultaneously reading the k*n bits of data from the memory. As one might expect, in a preferred implementation, the step of substantially simultaneously reading the k*n bits of data comprises buffering the k*n bits of data as k words of n-bit-wide data, and may further comprise converting the n-bit-wide data into serial data to be read externally from the memory.
The method of reading data from a memory generally comprises the steps of (1) substantially simultaneously outputting k*n bits of data from the memory onto a k*n-bit-wide bus; (2) converting the k*n bits of data into n-bit-wide parallel data; and (3) converting the n-bit-wide parallel data into serial data to be read externally from the memory. In preferred aspects, the step of converting the k*n bits of data into n-bit-wide parallel data comprises buffering k words of n-bit-wide data, and the buffering step may comprise storing the k words of n-bit-wide data in k registers, each register having n data storage elements (where k and n are as described above). In other words, in the method of reading, converting k*n bits of data into n-bit-wide parallel data comprise buffering the data as k words of n-bit-wide data. In a preferred implementation, the step of converting the k*n bits of data into n-bit-wide parallel data further comprises sequentially shifting the k words of n-bit-wide data onto an n-bit-wide bus. As described above, the step of converting n-bit-wide parallel data into serial data may be conducted at a first frequency, the step of converting the k*n bits of data into n-bit-wide parallel data may be conducted at a second frequency, and the step of substantially simultaneously outputting the k*n bits of data may be conducted at a third frequency, the first, second and third frequencies being as described above.
The method of reading data from a memory may further comprise (a) identifying one of a plurality of buffer addresses for buffering the k words of the n-bit-wide data, and/or (b) identifying one of a plurality of memory addresses for simultaneously outputting the k*n bits of data from the memory.
An Exemplary Implementation
Referring now to
This memory contains two major functional units: port pages 220a-k and memory block 210. Memory access from a port goes through a port page 220i (the designation “i” refers to any one of a plurality of substantially structurally and/or functionally identical elements), which serves as a bridge between the internal memory block interface (e.g., buffers 230) and the port interface, reconciling the difference between the memory block bandwidth and the bandwidth of an individual port while allowing efficient use of the memory block bandwidth. Since the internal memory block data interface 230 is relatively wide, and the port data interface is relatively narrow, the port pages act as temporary storage as well as parallel to serial and serial to parallel converters.
With the double buffering of port pages for both read and write accesses, the multi-port memory 200 can be used such that sustained concurrent non-blocking accesses between memory 210 and all ports can be maintained indefinitely. For port write accesses, the corresponding page entries are filled sequentially with write data through a dedicated 8-bit port write data bus. Subsequently, at the cue of a memory write signal, the entire contents of a page 220i are written into a selected page in the memory 210.
Through the memory control interface and the page control interface (not shown), the user can control when the page contents are written to the memory 210. Referring now to
Port read accesses are performed by first loading the contents from the desired page in memory 210 (up to 32 bytes) into the read buffer portion 250i of port page 220i. Next, the contents of the port page 220i are clocked out sequentially through the dedicated 8-bit port read bus RD[7:0]. By selecting a line using appropriate states of control signals NRSEi and multiplexer 256, the second read page line 226 is available for the next page of data from memory as soon as it is available, while the port is sending data from the first line 228. As soon as data is exhausted from the first line 228, data can be sent from the second line 226, and the first line 228 is available for the next page of data from memory 210.
The memory block 210 is accessed through memory control signals, a dedicated read bus 212 and a dedicated write bus 214 to the port pages. The width of the data busses is the number of entries 242a-o, 244a-o, 252a-o or 254a-o in a page multiplied by 8. The memory read and write busses 212 and 214 are coupled to the port read and write pages 250i and 240i, respectively. A source addresses and a destination addresses must accompany each memory request. For a write access, the source address is the port page 220i address, and the destination address is the page address in memory 210. For the read access, the source address is the page address in memory 210, and the destination address is the port page 220i address. The user controls the scheduling of the write and read operations to the port pages 220i and memory block 210 according to the temporal validity of the data in the port pages 220i and the memory block 210.
In most cases, operating in the sustained concurrent non-blocking mode will require that the number of entries 242i, 244i, 252i and 254i per page 220i be greater than the number of ports divided by two, and that the memory bandwidth be greater than the required aggregate bandwidth of the port pages 220a-220k.
The port count, memory capacity and memory bandwidth can be increased by using multiple blocks of the multi-port memory system described above. By cascading two multi-port page mode (MPPM) memory architectures 200 by techniques known in the art, sustained concurrent access of up to 2*2z (and in one specific implementation, 8192) pages containing up to 2y (and in one specific implementation, 32) bytes of data per line can be attained by up to 2*2x (and in one specific implementation, 32) read and/or write (R/W) ports. Up to m MPPM memories 200 may be cascaded, enabling sustained concurrent access of up to m*2z (where z is, e.g., from 8 to 15) pages containing 2y (where y is, e.g., from 3 to 8) bytes of data per line by up to m*2x (where x is, e.g., from 2 to 7) R/W ports. The exact number of ports depends on the desired aggregate port bandwidth and the memory operating frequency.
Applications of multi-port page mode memory 200 include those that can use a high port count, high bandwidth switch fabric. Features of memory 200 include support for any number of ports (e.g., in one implementation, 10, and in another, 16), dedicated read and write page blocks for each port, dedicated double buffered read port pages, dedicated double buffered write port pages, any number of entries (e.g., up to 2y, and in one implementation, 32) of any number of bits (e.g., up to (2p+c), and in one implementation, 8) each per page line, any number of pages or memory blocks (e.g., up to 2z, and in one implementation, 4096), port page operational frequencies up to 200 MHz (or faster depending upon the technology used), memory block operational frequencies up to 200 MHz (or faster), a 2-cycle memory read latency, a 2-cycle memory write latency, simple interfaces, a write snoop register 260, a parallel read port register 270, and a parallel write port register 280. Hardware descriptions of the memory 200 exist or can be provided without undue experimentation in 0.13 or 0.15 μm CMOS technology. Approximate dimensions of a 1 Mb 9-port, double buffer configuration are about 1880 μm×2870 μm; approximate dimensions of a 2 Mb, 26-port, single buffer configuration are about 3800 μm×3120 μm (both estimated for 0.15 μm technology). Predicted power dissipation @ 200 MHz (page clock and memory clock frequencies) is less than 1 W.
The following name and usage conventions are used in
Descriptions of the memory interface signals shown in
Functional Description
Referring to
Referring back to
While
Referring now to
As shown in part in
Memory Interface
Referring back to
Writing to Memory
Loading of all entries in a write page must be tracked. This may be done automatically using conventional logic (e.g., an n-bit counter that is reset in response to an appropriate transition or combination of WEPR and/or NWSE). Once all entries in a port page are loaded, the entire contents of this page are written into memory 210 by asserting NWR, de-asserting NRD and specifying the appropriate source and destination addresses. Referring to
Referring back to
On MCK edge 303, data from port 240k, line 1, is written to memory 210, page address Z. As for port clock WPCK[j], the rising edge of port clock WPCK[k] writing data into the last entry in write page 224k, must occur a period of time at least TLEMW before MCK edge 303. Data from port 240j, line 0, is latched in snoop register 260 on MCK edge 303.
On MCK edge 305, data from port 240q, line 0, is written to memory 210, page address X. Thus, the present architecture allows for data in memory 210 to be overwritten as soon as two clock cycles after a first block or page of data is written. Data from port 240k, line 1, is latched in snoop register 260 on MCK edge 305.
The MPPM block 200 may also include a page 280 with N*8 parallel inputs, PWD[N*8−1:0], and N*8 parallel outputs to the memory write bus 214. When present, the parallel write port page register 280 may have a port address of 31. The contents of this register may be written to memory 210 using the memory write command with the parallel write port 280 as the source address and with a page in the memory 210 as the destination address.
Reading from Memory
Referring now to
Referring back to
Referring now to
At MCK edge 335, data is read from memory 210, page X, into port buffer 220q, line 0 in accordance with the memory read operations described above, since the commands and signals 336 on the address/command interface waveform have the values MA[X], PA[q], NRD=0, NWR=1 and RPL=0. As for data 337 from MA[Z] is read onto parallel read port bus PRD two MCK cycles plus a period of time TPRDO after the corresponding read command edge 333. The commands and signals 338 on the address/command interface waveform have the values MA[Y], PA[30], NRD=0 and NWR=1. Therefore, at MCK edge 339, data is read from memory 210, page Y, into parallel read port 270. This data 338 is read onto parallel read port bus PRD two MCK cycles plus a period of time TPRDO after the corresponding read command edge 339.
Although the subject matter has been described in language specific to structural features and/or methodological operations, the subject matter defined in the appended claims is not necessarily limited to the specific features or operations described above, including orders in which the features or operations are shown and/or performed
This present disclosure is a continuation of U.S. application Ser. No. 13/716,481, filed on Dec. 17, 2012 which is a continuation of Ser. No. 12/494,076, now U.S. Pat. No. 8,335,878, filed on Jun. 29, 2009, which is a divisional of and claims priority to U.S. Utility application Ser. No. 10/702,744, now U.S. Pat. No. 7,571,287, filed on Nov. 5, 2003 which in turn claims priority to U.S. Provisional Patent Application Ser. No. 60/454,443, filed on Mar. 13, 2003, the disclosure of which are incorporated by reference herein in their entirety.
Number | Name | Date | Kind |
---|---|---|---|
4611299 | Hori et al. | Sep 1986 | A |
4823340 | Grassman et al. | Apr 1989 | A |
5260905 | Mori | Nov 1993 | A |
5307343 | Bostica et al. | Apr 1994 | A |
5440523 | Joffe | Aug 1995 | A |
5680595 | Thomann et al. | Oct 1997 | A |
5701517 | Carpenter | Dec 1997 | A |
5719890 | Thomman et al. | Feb 1998 | A |
5778007 | Thomann et al. | Jul 1998 | A |
5802131 | Morzano | Sep 1998 | A |
5815447 | Thomann | Sep 1998 | A |
5864504 | Tanzawa et al. | Jan 1999 | A |
5875470 | Dreibelbis et al. | Feb 1999 | A |
5953340 | Scott et al. | Sep 1999 | A |
5996051 | Mergard | Nov 1999 | A |
6000006 | Bruce et al. | Dec 1999 | A |
6016273 | Seki et al. | Jan 2000 | A |
6021086 | Joffe | Feb 2000 | A |
6034957 | Haddock et al. | Mar 2000 | A |
6067301 | Aatresh | May 2000 | A |
6081528 | Thomann | Jun 2000 | A |
6115389 | Mahale et al. | Sep 2000 | A |
6160814 | Ren et al. | Dec 2000 | A |
6167491 | McAlpine | Dec 2000 | A |
6216205 | Chin et al. | Apr 2001 | B1 |
6230191 | Walker | May 2001 | B1 |
6370624 | Ajanovic et al. | Apr 2002 | B1 |
6446173 | Pham | Sep 2002 | B1 |
6487207 | Thomann | Nov 2002 | B1 |
6535939 | Arimilli et al. | Mar 2003 | B1 |
6535963 | Rivers | Mar 2003 | B1 |
6539467 | Anderson et al. | Mar 2003 | B1 |
6539488 | Tota et al. | Mar 2003 | B1 |
6567304 | Kleveland | May 2003 | B1 |
6615324 | Fernald | Sep 2003 | B1 |
6618390 | Erimli et al. | Sep 2003 | B1 |
6712704 | Elliott | Mar 2004 | B2 |
6714643 | Gargeya et al. | Mar 2004 | B1 |
6717847 | Chen | Apr 2004 | B2 |
6732184 | Merchant et al. | May 2004 | B1 |
6735773 | Trinh et al. | May 2004 | B1 |
6741589 | Sang et al. | May 2004 | B1 |
6785272 | Sugihara | Aug 2004 | B1 |
6876702 | Hui et al. | Apr 2005 | B1 |
6886120 | Yamazaki | Apr 2005 | B2 |
7038950 | Hamilton et al. | May 2006 | B1 |
7039781 | Iwata et al. | May 2006 | B2 |
7068651 | Schmidt et al. | Jun 2006 | B2 |
7075827 | Aoyama et al. | Jul 2006 | B2 |
7076631 | Herron | Jul 2006 | B2 |
7099325 | Kaniz et al. | Aug 2006 | B1 |
7130308 | Haddock et al. | Oct 2006 | B2 |
7136953 | Bisson et al. | Nov 2006 | B1 |
7149834 | Peters et al. | Dec 2006 | B2 |
7185132 | Tang | Feb 2007 | B2 |
7197591 | Kwa et al. | Mar 2007 | B2 |
7249270 | Mansell et al. | Jul 2007 | B2 |
7274611 | Roohparvar | Sep 2007 | B2 |
7284106 | Fernald | Oct 2007 | B1 |
7313019 | Giduturi et al. | Dec 2007 | B2 |
7329136 | Su et al. | Feb 2008 | B2 |
7334072 | Wright | Feb 2008 | B1 |
7356676 | Paver et al. | Apr 2008 | B2 |
7359997 | Ishida et al. | Apr 2008 | B2 |
7411830 | Takeuchi et al. | Aug 2008 | B2 |
7447824 | Jabori et al. | Nov 2008 | B2 |
7451280 | Furtek et al. | Nov 2008 | B2 |
7463528 | Mokhlesi et al. | Dec 2008 | B2 |
7467253 | Yero | Dec 2008 | B2 |
7469311 | Tsu et al. | Dec 2008 | B1 |
7478188 | Patton | Jan 2009 | B2 |
7480757 | Atherton et al. | Jan 2009 | B2 |
7480808 | Caruk et al. | Jan 2009 | B2 |
7496707 | Freking et al. | Feb 2009 | B2 |
7499343 | Kang | Mar 2009 | B2 |
7536490 | Mao | May 2009 | B2 |
7539809 | Juenger | May 2009 | B2 |
7542350 | Park et al. | Jun 2009 | B2 |
7571287 | Lee et al. | Aug 2009 | B2 |
7583600 | Schanke et al. | Sep 2009 | B1 |
7599221 | Yamada | Oct 2009 | B2 |
7606960 | Munguia | Oct 2009 | B2 |
7613045 | Murin et al. | Nov 2009 | B2 |
7613871 | Tanaka et al. | Nov 2009 | B2 |
7624221 | Case | Nov 2009 | B1 |
7649539 | Evans et al. | Jan 2010 | B2 |
7660925 | Larson et al. | Feb 2010 | B2 |
7685322 | Bhesania et al. | Mar 2010 | B2 |
7689753 | Kwak et al. | Mar 2010 | B2 |
7734874 | Zhang et al. | Jun 2010 | B2 |
7752342 | Tee et al. | Jul 2010 | B2 |
7822955 | Flynn et al. | Oct 2010 | B2 |
7903462 | Yeung et al. | Mar 2011 | B1 |
7941590 | Yang et al. | May 2011 | B2 |
7945825 | Cohen et al. | May 2011 | B2 |
7949817 | Sakarda | May 2011 | B1 |
8127104 | Shen | Feb 2012 | B1 |
8131915 | Yang | Mar 2012 | B1 |
8154919 | Lee et al. | Apr 2012 | B2 |
8205028 | Sakarda | Jun 2012 | B1 |
8213228 | Yang | Jul 2012 | B1 |
8213236 | Wu | Jul 2012 | B1 |
8234425 | Milner | Jul 2012 | B1 |
8335878 | Lee | Dec 2012 | B2 |
8423710 | Gole | Apr 2013 | B1 |
8533386 | Yang | Sep 2013 | B1 |
8683085 | Castleberry et al. | Mar 2014 | B1 |
8688877 | Lee et al. | Apr 2014 | B1 |
8688922 | Assmann | Apr 2014 | B1 |
8924598 | Castleberry et al. | Dec 2014 | B1 |
20010003198 | Wu | Jun 2001 | A1 |
20010036116 | Kubo et al. | Nov 2001 | A1 |
20020116584 | Wilkerson | Aug 2002 | A1 |
20030154314 | Mason, Jr. et al. | Aug 2003 | A1 |
20040027901 | Shiga et al. | Feb 2004 | A1 |
20040093389 | Mohamed et al. | May 2004 | A1 |
20040098556 | Buxton et al. | May 2004 | A1 |
20040193774 | Iwata et al. | Sep 2004 | A1 |
20040199734 | Rajamani et al. | Oct 2004 | A1 |
20040202192 | Galbi et al. | Oct 2004 | A9 |
20050008011 | Georgiou et al. | Jan 2005 | A1 |
20050268001 | Kimelman et al. | Dec 2005 | A1 |
20060010304 | Homewood et al. | Jan 2006 | A1 |
20060031628 | Sharma | Feb 2006 | A1 |
20060075144 | Challener et al. | Apr 2006 | A1 |
20060106962 | Woodbridge et al. | May 2006 | A1 |
20060288153 | Tanaka et al. | Dec 2006 | A1 |
20060288188 | Ma et al. | Dec 2006 | A1 |
20070002880 | Chien et al. | Jan 2007 | A1 |
20070176939 | Sadowski | Aug 2007 | A1 |
20070229503 | Witzel et al. | Oct 2007 | A1 |
20070271609 | Chen et al. | Nov 2007 | A1 |
20070283086 | Bates | Dec 2007 | A1 |
20080094897 | Chung et al. | Apr 2008 | A1 |
20080126728 | Fernald | May 2008 | A1 |
20080147978 | Pesavento et al. | Jun 2008 | A1 |
20080148083 | Pesavento et al. | Jun 2008 | A1 |
20080175055 | Kim | Jul 2008 | A1 |
20080195801 | Cheon et al. | Aug 2008 | A1 |
20080215773 | Christison et al. | Sep 2008 | A1 |
20080215774 | Kim et al. | Sep 2008 | A1 |
20080256282 | Guo et al. | Oct 2008 | A1 |
20080265838 | Garg et al. | Oct 2008 | A1 |
20080270679 | Joo | Oct 2008 | A1 |
20080294951 | Ahmad et al. | Nov 2008 | A1 |
20080320189 | Arssov | Dec 2008 | A1 |
20090067511 | Wei et al. | Mar 2009 | A1 |
20090113166 | Houston et al. | Apr 2009 | A1 |
20090122610 | Danon et al. | May 2009 | A1 |
20090132770 | Lin | May 2009 | A1 |
20090150599 | Bennett | Jun 2009 | A1 |
20090154000 | Kojima | Jun 2009 | A1 |
20090200982 | Hurtz | Aug 2009 | A1 |
20090228739 | Cohen et al. | Sep 2009 | A1 |
20090273975 | Sarin et al. | Nov 2009 | A1 |
20090300260 | Woo et al. | Dec 2009 | A1 |
20100027350 | Melik-Martirosian et al. | Feb 2010 | A1 |
Number | Date | Country |
---|---|---|
2779843 | Dec 1999 | FR |
1162294 | Jun 1989 | JP |
4061094 | Feb 1992 | JP |
5047174 | Feb 1993 | JP |
10506776 | Jun 1998 | JP |
2004288355 | Oct 2004 | JP |
5107204 | Oct 2012 | JP |
Entry |
---|
“6-Port Fast Ethernet Switch, 88E6060 (Product Overview)”, Link Street; www.marvell.com; Marvell Semiconductor, Inc.; Sunnyvale, CA, 2002, 2 pgs. |
“7-Port Fast Ethernet Switch with 802.1 Q, 88E6063 (Product Overview)”, www.marvell.com; Marvell Semiconductor, Inc.; Sunnyvale, CA, 2002, 2 pgs. |
“Advisory Action”, U.S. Appl. No. 10/702,744, Sep. 11, 2007, 3 pages. |
“Advisory Action”, U.S. Appl. No. 12/163,801, Jan. 24, 2011, 2 pages. |
“Coprocessor”, Retrieved from <http://en.wikipedia.org/wiki/Coprocessor>, Nov. 2006, 1 page. |
“Corrected Notice of Allowance”, U.S. Appl. No. 13/268,183, Nov. 19, 2013, 2 pages. |
“European Communication and Search Report”, Application No. EP04006012; European Patent Office; Munich, Germany, May 30, 2005, 4 pgs. |
“European Search Report”, Application No. EP04006012; Munich, Germany, May 30, 2005, 4 pages. |
“Final Office Action”, U.S. Appl. No. 10/702,744, Jun. 25, 2007, 13 pages. |
“Final Office Action”, U.S. Appl. No. 12/163,801, Oct. 14, 2010, 12 pages. |
“Final Office Action”, U.S. Appl. No. 12/163,801, Nov. 14, 2011, 12 pages. |
“Final Office Action”, U.S. Appl. No. 12/182,014, Oct. 29, 2010, 16 pages. |
“Final Office Action”, U.S. Appl. No. 12/276,084, Oct. 17, 2011, 15 pages. |
“Final Office Action”, U.S. Appl. No. 12/332,870, Sep. 10, 2013, 20 pages. |
“Final Office Action”, U.S. Appl. No. 12/332,870, Oct. 12, 2011, 17 pages. |
“Final Office Action”, U.S. Appl. No. 12/434,000, Apr. 26, 2011, 15 pages. |
“Final Office Action”, U.S. Appl. No. 12/434,000, Sep. 4, 2012, 17 pages. |
“Final Office Action”, U.S. Appl. No. 12/494,076, Mar. 30, 2011, 13 pages. |
“Final Office Action”, U.S. Appl. No. 12/494,076, Oct. 3, 2011, 13 pages. |
“Final Office Action”, U.S. Appl. No. 13/092,734, Dec. 29, 2011, 6 pages. |
“Foreign Notice of Allowance”, JP Application No. 2008-270813, Aug. 31, 2012, 7 pages. |
“Foreign Office Action”, JP Application No. 2004-071574, Feb. 19, 2008, 4 pages. |
“Foreign Office Action”, JP Application No. 2008-270813, Apr. 3, 2012, 6 pages. |
“Foreign Office Action”, JP Application No. 2008-270813, May 26, 2011, 4 pages. |
“Information Technology—Telecommunications and Information Exchange Between Systems—Local and Metropolitan Area Networks—Specific Requirements”, IEEE, Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) Specifications, Aug. 20, 1999, 531 pages. |
“Link Street 88E6063 7-Port Fast Ethernet Switch with QoS, 802.1Q VLAN, and Virtual Cable Tester (VCT) Technology”, Marvell: News; www.marvell.com; Marvell Semiconductor, Inc.; Sunnyvale, CA, Jul. 14, 2003, 1 page. |
“Link Street 88E6181 8-Port Gigabit Ethernet Switch with Four-Level QoS”, Marvell: News; www.marvell.com; Marvell Semiconductor, Inc.; Sunnyvale, CA, Jul. 14, 2003, 1 page. |
“Link Street, Integrated Gateway Router with Multi-Port QoS Switch 88E6218 (Product Overview)”, Gateway Solutions; www.marvell.com; Marvell Semiconductor, Inc.; Sunnyvale, CA, 2003, 2 pgs. |
“Link Street, Integrated Gateway Router with Multi-Port Switch, 88E6208 (Product Overview)”, Gateway Solutions; www.marvell.com; Marvell Semiconductor, Inc.; Sunnyvale, CA, 2003, 2 pgs. |
“Marvell Link Street Gigabit Ethernet Switches Enable the Rapid Deployment of Gigabit Connectivity for the SOHO Market”, Marvell: Press and Investor News; Marvell Semiconductor, Inc.; Sunnyvale, CA; http://www.marvell.com/press/pressNewsDisplay.do?releaseID=347, Apr. 29, 2003, 2 pgs. |
“Method and Circuit for Transferring Data with Dynamic Parity Generation and Checking Scheme in Multi-port DRAM”, esp@cenet; Publication No. JP10506776T (Abstract of Corresponding Document No. US5778007); esp@cenet Database—Worldwide; http://v3.espacenet.com/textdoc?DB=EPODOC&IDX=JP1056776T&F=0, Jun. 30, 1998, 5 pages. |
“Multiport Component Memory Series and Application with a Computer”, Automated Translation; Europaisches Patentamt, European Patent Office, Office Europeen Des Brevets; Description of FR2779843; World Lingo Language Translation Services; www.worldlingo.com, Nov. 19, 2007, 15 pgs. |
“Network Attached Storage (NAS) Advantages”, Retrieved from: <http://www.html.co.uk/86/network-attached-storage-nas-advantages.htm l> on Oct. 7, 2013, Aug. 22, 2008, 4 pages. |
“Non-Final Office Action”, U.S. Appl. No. 12/182,014, Jun. 1, 2010, 13 pages. |
“Non-Final Office Action”, U.S. Appl. No. 10/702,744, Feb. 19, 2009, 5 pages. |
“Non-Final Office Action”, U.S. Appl. No. 10/702,744, Dec. 27, 2006, 10 pages. |
“Non-Final Office Action”, U.S. Appl. No. 12/163,801, Apr. 22, 2010, 10 pages. |
“Non-Final Office Action”, U.S. Appl. No. 12/163,801, Jul. 20, 2011, 11 pages. |
“Non-Final Office Action”, U.S. Appl. No. 12/180,238, Apr. 12, 2011, 7 pages. |
“Non-Final Office Action”, U.S. Appl. No. 12/276,084, Mar. 29, 2013, 7 pages. |
“Non-Final Office Action”, U.S. Appl. No. 12/276,084, Apr. 11, 2011, 12 pages. |
“Non-Final Office Action”, U.S. Appl. No. 12/332,870, Feb. 7, 2014, 19 pages. |
“Non-Final Office Action”, U.S. Appl. No. 12/332,870, Apr. 25, 2011, 15 pages. |
“Non-Final Office Action”, U.S. Appl. No. 12/332,870, May 8, 2013, 19 pages. |
“Non-Final Office Action”, U.S. Appl. No. 12/396,250, Jun. 23, 2011, 6 pages. |
“Non-Final Office Action”, U.S. Appl. No. 12/434,000, Mar. 14, 2013, 18 pages. |
“Non-Final Office Action”, U.S. Appl. No. 12/434,000, Nov. 10, 2010, 9 pages. |
“Non-Final Office Action”, U.S. Appl. No. 12/434,000, May 4, 2012, 15 pages. |
“Non-Final Office Action”, U.S. Appl. No. 12/436,577, Sep. 29, 2010, 6 pages. |
“Non-Final Office Action”, U.S. Appl. No. 12/494,076, 12/22/10, 12 pages. |
“Non-Final Office Action”, U.S. Appl. No. 12/726,310, Aug. 1, 2012, 11 pages. |
“Non-Final Office Action”, U.S. Appl. No. 12/862,600, Oct. 16, 2013, 8 pages. |
“Non-Final Office Action”, U.S. Appl. No. 13/045,186, Aug. 22, 2013, 12 pages. |
“Non-Final Office Action”, U.S. Appl. No. 13/092,734, Aug. 24, 2011, 15 pages. |
“Non-Final Office Action”, U.S. Appl. No. 13/177,965, Jul. 2, 2013, 7 pages. |
“Non-Final Office Action”, U.S. Appl. No. 13/268,183, May 7, 2013, 6 pages. |
“Non-Final Office Action”, U.S. Appl. No. 13/406,756, Nov. 5, 2012, 4 pages. |
“Non-Final Office Action”, U.S. Appl. No. 13/538,827, Feb. 22, 2013, 7 pages. |
“Non-Final Office Action”, U.S. Appl. No. 13/538,827, May 2, 2013, 6 pages. |
“Non-Final Office Action”, U.S. Appl. No. 13/860,394, Oct. 2, 2013, 13 pages. |
“Non-Final Office Action”, U.S. Appl. No. 14/171,491, Apr. 10, 2014, 5 pages. |
“Notice of Allowance”, U.S. Appl. No. 13/716,481, Nov. 14, 2013, 13 pages. |
“Notice of Allowance”, U.S. Appl. No. 10/702,744, Mar. 27, 2009, 7 pages. |
“Notice of Allowance”, U.S. Appl. No. 12/163,801, Mar. 22, 2012, 6 pages. |
“Notice of Allowance”, U.S. Appl. No. 12/180.238, Oct. 25, 2011, 6 pages. |
“Notice of Allowance”, U.S. Appl. No. 12/182,014, Jan. 20, 2011, 6 pages. |
“Notice of Allowance”, U.S. Appl. No. 12/276,084, Oct. 29, 2013, 5 pages. |
“Notice of Allowance”, U.S. Appl. No. 12/396,250, Nov. 16, 2011, 4 pages. |
“Notice of Allowance”, U.S. Appl. No. 12/434,000, Oct. 17, 2013, 9 pages. |
“Notice of Allowance”, U.S. Appl. No. 12/436,577, Apr. 14, 2011, 4 pages. |
“Notice of Allowance”, U.S. Appl. No. 12/494,076, Aug. 2, 2012, 8 pages. |
“Notice of Allowance”, U.S. Appl. No. 12/610,106, Feb. 29, 2012, 11 pages. |
“Notice of Allowance”, U.S. Appl. No. 12/726,310, Dec. 18, 2012, 6 pages. |
“Notice of Allowance”, U.S. Appl. No. 12/762,150, Mar. 19, 2012, 6 pages. |
“Notice of Allowance”, U.S. Appl. No. 13/045,186, Nov. 1, 2013, 9 pages. |
“Notice of Allowance”, U.S. Appl. No. 13/092,734, Feb. 23, 2012, 4 pages. |
“Notice of Allowance”, U.S. Appl. No. 13/177,965, Nov. 20, 2013, 5 pages. |
“Notice of Allowance”, U.S. Appl. No. 13/268,183, Jul. 29, 2013, 5 pages. |
“Notice of Allowance”, U.S. Appl. No. 13/406,756, May 8, 2013, 7 pages. |
“Notice of Allowance”, U.S. Appl. No. 13/538,827, Sep. 17, 2013, 7 pages. |
“Notice of Allowance”, Notice of Allowance U.S. Appl. No. 14/171,491, Aug. 5, 2014, 6 pages. |
“Partial European Search Report”, Application No. EP04006012; European Patent Office, Munich, Germany, Mar. 14, 2005, 2 pgs. |
“Restriction Requirement”, U.S. Appl. No. 10/702,744, Jun. 30, 2006, 5 pages. |
“Restriction Requirement”, U.S. Appl. No. 12/610,106, Dec. 7, 2011, 5 pages. |
“Restriction Requirement”, U.S. Appl. No. 12/862,600, May 24, 2013, 7 pages. |
“Restriction Requirement”, U.S. Appl. No. 13/045,186, Jun. 19, 2013, 5 pages. |
“U.S. Appl. No. 12/726,310”, filed Mar. 17, 2010, 36 pages. |
“U.S. Appl. No. 12/862,600”, filed Aug. 24, 2010, 36 pages. |
Litaize, et al., “Serial Multi Port Memory Component Comprising RAM Memory Bank Assemblies for Use in Computer”, Abstract of FR2779843; Publication No. FR2779843; esp@cenet database; http://v3.espace.com/textdoc?DB=EPODOC&IDX=FR2779843&F=0, Dec. 12, 1999, 1 page. |
Mori, “Multiport Memory”, English Abstract of Japanese Patent Publication No. JP5047174; esp@cenet database—Worldwide, Feb. 26, 1993, 1 page. |
Pallampati, “iSCSI Performance Over RDMA-Enabled Network”, Thesis, Department of Electrical and Computer Engineering, Graduate School of Wichita State University, Jul. 2006, 58 pages. |
Prince, “High Performance Memories, New Architectures DRAMs and SRAMs—Evolution and Function”, John Wiley & Sons, Ltd.; West Sussex, England, 1996, pp. 58-61. |
“Corrected Notice of Allowance”, U.S. Appl. No. 14/171,491, Nov. 21, 2014, 2 pages. |
Number | Date | Country | |
---|---|---|---|
20140215164 A1 | Jul 2014 | US |
Number | Date | Country | |
---|---|---|---|
60454443 | Mar 2003 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 10702744 | Nov 2003 | US |
Child | 12494076 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 13716481 | Dec 2012 | US |
Child | 14230555 | US | |
Parent | 12494076 | Jun 2009 | US |
Child | 13716481 | US |