This application contains subject matter that is related to the subject matter of the following co-pending applications, each of which is assigned to the same assignee as this application, International Business Machines Corporation of Armonk, N.Y. Each of the below listed applications is hereby incorporated herein by reference in its entirety: Late Data Launch for a Double Data Rate Elastic Interface, Ser. No. 11/426,671; Programmable Bus Driver Launch Delay/Cycle Delay to Reduce EI Elasticity Requirements, Ser. No. 11/426,666; Mechanism for Windaging of a Double Rate Driver, Ser. No. 11/426,648; Early Directory Access of a Double Rate Elastic Interface, Ser. No. 11/426,675.
This invention relates to a system and method for moving data among daisy chained chips over a double data rate synchronous interface between the chips, and more particularly to a system and method to remove added latency introduced by serialization of data on a chip in the chain where the local clock of a chip in the chain is the same as the synchronous interface clock frequency.
In digital data systems in general and in computer and telecommunications systems in particular, there is an ever-increasing drive for larger bandwidth and higher performance. These systems are comprised of discreet integrated circuit chips that are interconnected. Data moves through a chip and between chips in response to clock pulses, which, among other things, maintain synchronization of the data in parallel paths. At the extremely high data rates in today's systems, variations in the propagation of data over a bus along one path as compared to another path on the bus (i.e. skew) can exceed one clock cycle. U.S. Pat. No. 6,334,163, which is assigned to the assignee of this application and is incorporated herein by reference, discloses a so called Elastic Interface (EI) that can compensate for bus skew greater than one clock cycle without a performance penalty. However, packaging technology has not been able scale up to match the performance and bandwidth of the chip and interface technologies. In order to reduce the number I/O terminals on a chip and the number of conductive paths in a bus between chips, the prior art transfers data at a so called Double Data Rate (DDR), in which data is launched onto the bus at both the rising and falling edges of the clock. This allows the same amount of data to be transferred (i.e. bandwidth) with only half the number of bus conductors and half the number of chip I/O ports, as compared with a system where data is transferred only on a rising or a falling clock edge. Here it should be noted, that only half the data as compared to bus with twice the conductors is sent on each edge, referred to as the odd and the even half for convenience.
Often a double data rate bus is used between one chip and a next chip and another double data rate bus is used between that next chip and a still another chip. This so called daisy chain of chips with double data rate interfaces, typically includes a chip or chips with a local clock frequency that is the same as the double data rate synchronous interface clock frequency. In the prior art as illustrated in
An object of this invention is the provision of an improved system and method that moves data through a daisy chain of chips with a double data rate bus input and output.
Briefly, this invention contemplates a system and method in which the receiving chip separately latches each half of the data received from the double data rate bus. Each half is launched as soon as it is available; one on the normal chip cycle time and the other is launched from a Master (L1) latch a half cycle into the normal chip cycle time. The first launched half of the data proceeds through the chip along its standard design chip path to be captured by the chips driving interface latch and launched again after one cycle of latency on the chip. The second half of the data proceeds through the chip one half cycle behind the first half, and is latched a half clock cycle later part way through the path into a Slave (L2) latch. On the next edge of the local clock, the data then continues from the L2 latch to the driving double data rate interface. This allows a half cycle set up time for the second half of the data so that it can be launched again, maintaining a one-cycle time on the chip. The present invention reduces the on-chip latency from the DDR data received from one or more chips to sending the processed data to other chips (back to the same chips or to different chips). The invention takes advantage of the early availability and late launch capability provided by the DDR interface to move data through the daisy-chained chip in a way to remove the added latency of serialization. This invention eliminates the DDR receiver and driver extra cycle delays and provides flexibility on latch physical placement in the chip internal data path. The shortcomings of the prior art are overcome and additional advantages are provided through the provision of a Master latch output port for the DDR receiver Odd data path, and using “alternating” Master-Slave latches in the Odd data path pipelining the Odd data through to the DDR driver sending data off chip again. The present invention reduces the on-chip latency from the DDR data received from one or more chips to sending the processed data to other chips (back to the same chips or to different chips). The invention takes advantage of the early availability and late launch capability provided by the DDR interface to move data through the daisy-chained chip in a way to remove the added latency of serialization. This invention eliminates the DDR receiver and driver extra cycle delays and provides flexibility on latch physical placement in the chip internal data path. The shortcomings of the prior art are overcome and additional advantages are provided through the provision of a Master latch output port for the DDR receiver Odd data path, and using “alternating” Master-Slave latches in the Odd data path pipelining the Odd data through to the DDR driver sending data off chip again. The present invention is a method to reduce the on-chip latency from the DDR data received from one or more chips to sending the processed data to other chips (back to the same chips or to different chips). The invention takes advantage of the early availability and late launch capability provided by the DDR interface to move data through the daisy-chained chip in a way to remove the added latency of serialization. This invention eliminates the DDR receiver and driver extra cycle delays and provides flexibility on latch physical placement in the chip internal data path. The shortcomings of the prior art are overcome and additional advantages are provided through the provision of a Master latch output port for the DDR receiver Odd data path, and using “alternating” Master-Slave latches in the Odd data path pipelining the Odd data through to the DDR driver sending data off chip again. The invention works by having the data on the DDR bus split into 2 parts, the first and second half. Each half is launched as soon as they are available, one on the normal chip cycle time (Master-Slave latch or Flip-Flop clocking), the other is launched to the chip (internal logic) from a Master latch a half cycle into the normal chip cycle time. The first data proceeds through the chip as a normal chip path to be captured by the driving interface's latch and launched again after only one cycle of latency on the chip. The second data goes through the chip a half cycle late, reaching a Slave latch part way through the path. The data then continues into the DDR driving interface having to meet a half cycle setup time to be launched again, also maintaining 1-cycle latency on the chip.
The DDR receiver delay is reduced by using the Master latch output port of the Odd data path instead of its Slave latch output port. At the last stage of the Odd data path, data are fed to the Slave latch input port directly. This invention allows the physical placement of the last stage Odd data Slave latch to be further away from the DDR driver Master latch it feeds. The implementation choices can be Master-Slave latches and/or individual transparent latches.
The subject matter that is regarded as the invention is particularly pointed out and distinctly claimed in the claims at the conclusion of the specification. The foregoing and other objects, features, and advantages of the invention are apparent from the following detailed description taken in conjunction with the accompanying drawings in which:
Referring now to
Referring now to
One half of the local clock cycle after the even half of the data on the double data rate bus is latched, the corresponding odd half (1, 3, 5 . . . ) of the data is latched by the slave side of master/slave latch 220 and the master side master/slave latch 222 so that it is immediately available as an input 209 to the chip's standard design path 206. After having been processed by the logic in path 206, the data is latched in the slave side of master/slave latch 230 and the master side of master/slave latch 232 where it is immediately available as an input 215 to the multiplexer 206. Since the odd data is available at the multiplexer one half cycle after the even data, it can be outputted by the SELECT input to multiplexer 206 to the double data rate bus on the clock edge following the clock edge that outputted the even data, resulting in only an N plus one local clock cycle latency on the chip, where in this case N is zero since neither the even nor the odd data teaches a full latch during the on chip portion. The second half of the data proceeds through the chip one half cycle behind the first half, and is latched a half clock cycle later part way through the path into a Slave (L2) latch. On the next edge of the local clock, the data then continues from the L2 latch to the driving double data rate interface. The invention takes advantage of the early availability and late launch capability provided by the DDR interface to move data through the daisy-chained chip in a way to remove the added latency of serialization and provides flexibility on latch physical placement in the chip internal data path. Additional advantages are provided through the provision of a Master latch output port for the DDR receiver Odd data path, and using “alternating” Master-Slave latches in the Odd data path.
The capabilities of the present invention can be implemented in software, firmware, hardware or some combination thereof.
As one example, one or more aspects of the present invention can be included in an article of manufacture (e.g., one or more computer program products) having, for instance, computer usable media. The media has embodied therein, for instance, computer readable program code means for providing and facilitating the capabilities of the present invention. The article of manufacture can be included as a part of a computer system or sold separately.
Additionally, at least one program storage device readable by a machine, tangibly embodying at least one program of instructions executable by the machine to perform the capabilities of the present invention can be provided.
The flow diagrams depicted herein are just examples. There may be many variations to these diagrams or the steps (or operations) described therein without departing from the spirit of the invention. For instance, the steps may be performed in a differing order, or steps may be added, deleted or modified. All of these variations are considered a part of the claimed invention.
While the preferred embodiment to the invention has been described, it will be understood that those skilled in the art, both now and in the future, may make various improvements and enhancements which fall within the scope of the claims which follow. These claims should be construed to maintain the proper protection for the invention first described.
| Number | Name | Date | Kind |
|---|---|---|---|
| 5805872 | Bannon | Sep 1998 | A |
| 5867541 | Tanaka | Feb 1999 | A |
| 5971889 | Ohashi et al. | Oct 1999 | A |
| 6114886 | Seo | Sep 2000 | A |
| 6144886 | Lee | Nov 2000 | A |
| 6166563 | Volk | Dec 2000 | A |
| 6170506 | Butwin et al. | Jan 2001 | B1 |
| 6202128 | Chan | Mar 2001 | B1 |
| 6442102 | Borkenhagen et al. | Apr 2001 | B1 |
| 6263463 | Hashimoto | Jul 2001 | B1 |
| 6279073 | McCracken | Aug 2001 | B1 |
| 6282128 | Lee | Aug 2001 | B1 |
| 6315692 | Takahashi et al. | Nov 2001 | B1 |
| 6335955 | Knotts | Jan 2002 | B1 |
| 6373289 | Martin | Apr 2002 | B1 |
| 6396322 | Kim et al. | May 2002 | B1 |
| 6424198 | Wolford | Jul 2002 | B1 |
| 6452865 | Wolford | Sep 2002 | B1 |
| 6473838 | Bass et al. | Oct 2002 | B1 |
| 6477592 | Chen et al. | Nov 2002 | B1 |
| 6493285 | Wolford | Dec 2002 | B1 |
| 6510503 | Gillingham | Jan 2003 | B2 |
| 6560669 | Ryan | May 2003 | B1 |
| 6584578 | Faue | Jun 2003 | B1 |
| 6603706 | Nystuen | Aug 2003 | B1 |
| 6671753 | Dreps et al. | Dec 2003 | B2 |
| 6715096 | Kuge | Mar 2004 | B2 |
| 6760856 | Borkenhagen | Jul 2004 | B1 |
| 6826113 | Ellis | Nov 2004 | B2 |
| 6832294 | Wicki | Dec 2004 | B2 |
| 6838712 | Stubbs | Jan 2005 | B2 |
| 6874097 | Aliahmad et al | Mar 2005 | B1 |
| 6907493 | Ryan | Jun 2005 | B2 |
| 6912628 | Wicki | Jun 2005 | B2 |
| 6914829 | Lee | Jul 2005 | B2 |
| 6920576 | Ehmann | Jul 2005 | B2 |
| 7017067 | Zielbauer | Mar 2006 | B2 |
| 7089440 | Wu | Aug 2006 | B2 |
| 7132854 | Chen et al. | Nov 2006 | B1 |
| 7135854 | Brian et al. | Nov 2006 | B2 |
| 7138844 | Lee | Nov 2006 | B2 |
| 7225354 | Tseng | May 2007 | B2 |
| 7295489 | Yoon et al. | Nov 2007 | B2 |
| 7376021 | Heo | May 2008 | B2 |
| 7412618 | Ferraiolo et al. | Aug 2008 | B2 |
| 7440531 | Dreps et al. | Oct 2008 | B2 |
| 20010046163 | Yanagawa | Nov 2001 | A1 |
| 20020018395 | McLaury | Feb 2002 | A1 |
| 20020130795 | Moon | Sep 2002 | A1 |
| 20030001651 | Rosa | Jan 2003 | A1 |
| 20030043926 | Terashima | Mar 2003 | A1 |
| 20030065908 | Patel | Apr 2003 | A1 |
| 20030085734 | Nguyen | May 2003 | A1 |
| 20030217214 | Calvignac et al. | Nov 2003 | A1 |
| 20040008069 | Welker | Jan 2004 | A1 |
| 20040089069 | Weber et al. | Mar 2004 | A1 |
| 20040071171 | Ghiasi | Apr 2004 | A1 |
| 20040098551 | Heo et al. | May 2004 | A1 |
| 20040117742 | Emberling | Jun 2004 | A1 |
| 20040123173 | Emberling | Jun 2004 | A1 |
| 20040148538 | Li | Jul 2004 | A1 |
| 20040174765 | Seo | Sep 2004 | A1 |
| 20040239288 | Harrison et al. | Dec 2004 | A1 |
| 20040260962 | Suen | Dec 2004 | A1 |
| 20050001655 | Takeda | Jan 2005 | A1 |
| 20050050289 | Raad | Mar 2005 | A1 |
| 20050105349 | Dahlberg | May 2005 | A1 |
| 20050114724 | Wu | May 2005 | A1 |
| 20050141331 | Che | Jun 2005 | A1 |
| 20050157827 | Yoon | Jul 2005 | A1 |
| 20050162187 | Nguyen | Jul 2005 | A1 |
| 20050174145 | Dosho | Aug 2005 | A1 |
| 20050195928 | Yamazaki | Sep 2005 | A1 |
| 20070300095 | Fee | Dec 2007 | A1 |
| 20070300098 | Chen | Dec 2007 | A1 |
| 20070300099 | Chen | Dec 2007 | A1 |
| Number | Date | Country | |
|---|---|---|---|
| 20070300095 A1 | Dec 2007 | US |