Abstract:
A system and method to organize and use data sent over a double data rate interface so that the system operation does not experience a time penalty. The first cycle of data is used independently of the second cycle so that latency is not jeopardized. There are many applications. In a preferred embodiment for an L2 cache, the system transmits congruence class data in the first half and can start to access the L2 cache directory with the congruence class data.

Description:
CROSS-REFERENCE TO RELATED APPLICATIONS 
       [0001]    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, Attorney Docket Number POU920060023; Programmable Bus Driver Launch Delay/Cycle Delay to Reduce EI Elasticity Requirements, Attorney Docket Number POU920060021; Mechanism for Windaging of a Double Rate Driver, Attorney Docket Number POU920060012; Double Data Rate chaining on Elastic Interfaces, Attorney Docket Number POU920060022 
       FIELD OF THE INVENTION 
       [0002]    This invention relates to a system and method for organizing and using data sent and received over a double data rate bus, and more particularly to an improved system and method to organize and use control data. 
       BACKGROUND OF THE INVENTION 
       [0003]    In digital data systems in general and in computer 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 by a bus. Data moves through a chip and between chips in response to clock pulses, which are intended to maintain synchronization of the data in parallel paths. At the extremely high data rates in today&#39;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 I/O ports, as compared with a system where data is transferred only on a rising or a falling edge. 
         [0004]    In certain control paths where the control data word is wider than the physical double data rate buss, the ability to transmit only a portion of the control data on one edge of the clock may introduce a latency of a half cycle while waiting for the remainder of the control data, which is transferred on the next clock edge. For example, in a control/address path from a CPU to an L2 cache, if only the first shot of address information can be sent on the first one half bus cycle, the full address takes another one half cycle to get to the destination. This extra latency in prior art organization and use of data in systems using double data rate interfaces introduces a latency that could degrade overall performance. 
         [0005]      FIG. 1  illustrates a typical prior art interface between a central processor chip CP and a system controller chip SC for a set associative cache. In this illustrative example of the prior art, the bus is 40 bits wide and has a data rate of x, with data transferred on to the bus on one edge of the CP driver clock signal.  FIG. 2  illustrates a prior art interface with the same data transfer rate as the interface of  FIG. 1 , but operating at a double data rate, that is with data transferred on both edges of the chip clock. Although the overall data rate is the same as in  FIG. 1 , here the bus is only 20 bits wide, but the data rate is 2×. 
         [0006]      FIGS. 3 and 6  illustrate the number of local clock cycles required for a set associative cache access using the single data rate bus of  FIG. 1 . In this comparative illustration, 5 local clock cycles are used. The first clock cycle is used to latch the entire address data in the interface register CO. The second clock cycle determines on-chip priority arbitration (assumes more than one potential requester for directory access). The third clock cycle stores the address data in the address register (C 1 ) and accesses the cache directory with the congruent segment of the cache address. The fourth local clock stores the directory (Dir) output in register Dir C 2  and the cache data address in register Pipe (C 2 ) and compares the address in the Compare Hit step. The fifth local clock cycle stores a directory hit data in register Pipe C 3 . 
         [0007]      FIGS. 4 and 7  illustrates the prior art steps using a double data rate bus of  FIG. 2 . Here 5½ cycles are required because the first 20 bits sent over the interface are stored and wait one half cycle until the second 20 bits are transmitted, losing one half cycle of latency. The steps here are essentially the same as those explained in connection with  FIGS. 3 and 6 , except that the first 20-bits of the address are stored in a staging register Stg for one half cycle waiting for receipt of the second 20-bits of the address. At the end of the half cycle, the first 20-bits are transferred to the register Interface CO where the second 20-bits are stored. From this point on the steps are as described in connection with  FIGS. 3 and 6 . 
       SUMMARY OF THE INVENTION 
       [0008]    An object of this invention is the provision of a system and method to organize and use data sent over a double data rate interface so that the system operation does not experience a time penalty. 
         [0009]    Briefly, this invention contemplates a system and method of organizing and using the first cycle of data independently of the second cycle so that latency is not jeopardized. There are many applications. In a preferred embodiment for an L2 cache, the system transmits congruence class data in the first half cycle and a ‘fast-path’ F etch bit to allow fast access to the L2 pipeline. If the fast access is requested, the operation can in most cases get prioritized for immediate execution (subject to contention with other resources) and can start to access the L2 cache directory with the congruence class data. Command/mode/tag information that is critical for a directory look-up arrives on the first half cycle, while the compare address and other tags can come on the next half cycle. This way, the directory look-up part of the critical path does not have to incur a penalty of waiting for the second half of the control data. 
     
     
       BRIEF DESCRIPTION OF THE DRAWINGS 
         [0010]    The subject matter, which 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: 
           [0011]      FIG. 1  is a simplified block diagram of a prior art elastic interface between two chips operating to transfer data on a single clock edge, that is, at a single data rate. 
           [0012]      FIG. 2  is a block diagram similar to  FIG. 1  illustrating a comparable double data rate bus. 
           [0013]      FIG. 3  is a block diagram showing the stages of a prior art directory access in which the directory address is received from a single data rate bus. 
           [0014]      FIG. 4  is a block diagram similar to  FIG. 3  showing the stages of a prior art directory access in which the directory address is received from a double data rate bus. 
           [0015]      FIG. 5  is a block diagram similar to  FIG. 4  showing the stages of a directory access in accordance with the teachings of this invention. 
           [0016]      FIG. 6  illustrates the local clock cycles in the operation of the prior art directory access illustrated in  FIG. 3 . 
           [0017]      FIG. 7  illustrates the local clock cycles in the operation of the prior art directory access illustrated in  FIG. 4 . 
           [0018]      FIG. 8  illustrates the local clock cycles in the operation of a directory access in accordance with the teachings of the invention illustrated in  FIG. 5 . 
       
    
    
     DETAILED DESCRIPTION OF THE INVENTION 
       [0019]    Referring now to  FIGS. 5 and 8  along with  FIG. 2  of the drawings, in accordance with the teaching of this invention, in addressing an L2 cache over a double data rate bus with a 40-bit address as in the above prior art examples, on the first clock edge of the computer processor chip CP driver transmits 20-bits of the 40-bit address, as explained above in connection with  FIG. 2 . Included in this first 20-bits of the address, in accordance with the teachings of the invention, is the congruence class data necessary for a directory look up. Command and tag information necessary for a directory look-up may also be included in this first 20 bits of the address. As illustrated in  FIG. 8 , by the end of the first clock cycle the first transmitted 20 bits of the address, which includes the congruent address data, is latched in interface register CO. One half clock cycle later, the second half of the address is latched in compare address register C 1 . In the second clock cycle, on-chip priority arbitration takes place (assuming more than one potential requestor for directory access) based on the data in register CO. The data in interface register CO is latched in directory address register C 1 , the directory Dir is address, and the addressed contents of the directory are latched in register Dir C 2  in the third clock cycle. The second half of the address in register Compare C 1  Address is latched in register Pipe C 2  in the third clock cycle. The contents of the registers Pipe C 2  and Dir C 2  are compared in the fourth clock cycle, and, in the event of a hit, the directory data is latched in register Pipe C 3  in the fifth clock cycle. 
         [0020]    The second first half of the address data is stored in two registers on the system controller chip SC; register Stg 1  and Stg 2 . The storage controller priority step starts at the beginning of the next clock cycle, even though the second half of the address is not latched into the address interface register CO until one half clock cycle later. The first half of the address data stored in register Stg  1  is latched into the address interface register CO on the edge of this half clock cycle along with the second half of the address. The cache directory Dir input in accordance with the invention includes a multiplexer MUX with two select inputs, FAST and NORMAL. The fast bit stored in register Stg  2  activates the FAST select input. When the FAST input is activated, the MUX couples the congruence class data (i.e. command/mode/tag information required for a directory look-up) stored in register Stg  2  to the input of the cache directory DIR. The directory access extends over one clock cycle C 1   a  starting at the end of the priority cycle COa. If there is a hit in the cache directory, the data is transferred from the directory Dir to the directory register Dir C 2  during this directory access clock cycle C 1   a . The fill address in register CO is transferred to register Pipe C 1  in clock cycle COb and to register Pipe C 2  in clock cycle C 1   b . The directory compare step extends over clock cycle C 2   a  where the content of the directory register Dir C 2  is compared to the content of the address register Pipe C 2 . If there is a hit, the contents of the directory register Dir C 2  are outputted in clock cycle C 3   a . Here it should be noted that the NORMAL select input to the multiplixer MUX the multiplexer couples the input of register Pipe C 1  to the input of the cache directory Dir. 
         [0021]    The capabilities of the present invention can be implemented in software, firmware, hardware or some combination thereof. 
         [0022]    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. 
         [0023]    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. 
         [0024]    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. 
         [0025]    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.