Scalable directory based cache coherence protocol

[0002] This application relates to the following commonly assigned co-pending applications entitled:

[0003] “Apparatus And Method For Interfacing A High Speed Scan-Path With Slow-Speed Test Equipment,” Ser. No. 09/653,642, filed Aug. 31, 2000, “Priority Rules For Reducing Network Message Routing Latency” Ser. No. 09/652,322, filed Aug. 31, 2000, “Scalable Efficient I/O Port Protocol,” Ser. No. 09/652,391, filed Aug. 31, 2000, “Efficient Translation Lookaside Buffer Miss Processing In Computer Systems With A Large Range Of Page Sizes,” Ser. No. 09/652,552, filed Aug. 31, 2000, “Fault Containment And Error Recovery Techniques In A Scalable Multiprocessor,” Ser. No. 09/651,949, filed Aug. 31, 2000, “Speculative Directory Writes In A Directory Based Cache Coherent Nonuniform Memory Access Protocol,” Ser. No. 09/652,834, filed Aug. 31, 2000, “Special Encoding Of Known Bad Data,” Ser. No. 09/652,314, Aug. 31, 2000, “Broadcast Invalidate Scheme,” Ser. No. 09/652,165, filed Aug. 31, 2000, “Mechanism To Track All Open Pages In A DRAM Memory System,” Ser. No. 09/652,704, filed Aug. 31, 2000, “Programmable DRAM Address Mapping Mechanism,” Ser. No. 09/653,093, filed Aug. 31, 2000, “Computer Architecture And System For Efficient Management Of Bi-Directional Bus,” Ser. No. 09/652,323, filed Aug. 31, 2000, “An Efficient Address Interleaving With Simultaneous Multiple Locality Options,” Ser. No. 09/652,452, filed Aug. 31, 2000, “A High Performance Way Allocation Strategy For A Multi-Way Associative Cache System,” Ser. No. 09/653,092, filed Aug. 31, 2000, “Method And System For Absorbing Defects In High Performance Microprocessor With A Large N-Way Set Associative Cache,” Ser. No. 09/651,948, filed Aug. 31, 2000, “A Method For Reducing Directory Writes And Latency In A High Performance, Directory-Based, Coherency Protocol,” Ser. No. 09/652,324, filed Aug. 31, 2000, “Mechanism To Reorder Memory Read And Write Transactions For Reduced Latency and Increased Bandwidth,” Ser. No. 09/653,094, filed Aug. 31, 2000, “System For Minimizing Memory Bank Conflicts In A Computer System,” Ser. No. 09/652,325, filed Aug. 31, 2000, “Computer Resource Management And Allocation System,” Ser. No. 09/651,945, filed Aug. 31, 2000, “Input Data Recovery Scheme,” Ser. No. 09/653,643, filed Aug. 31, 2000, “Fast Lane Prefetching,” Ser. No. 09/652,451, filed Aug. 31, 2000, “Mechanism For Synchronizing Multiple Skewed Source-Synchronous Data Channels With Automatic Initialization Feature,” Ser. No. 09/652,480, filed Aug. 31, 2000, and “Mechanism To Control The Allocation Of An N-Source Shared Buffer,” Ser. No. 09/651,924, filed Aug. 31, 2000, and “Chaining Directory Reads And Writes To Reduce DRAM Bandwidth In A Directory Based CC-NUMA Protocol,” Ser. No. 09/652,315, filed Aug. 31, 2000, all of which are incorporated by reference herein.

[0004] Not applicable

[0005] 1. Field of the Invention

[0006] The present invention generally relates to a computer system with multiple processors. More preferably, the present invention generally relates to the sharing of data among processors in a Distributed Shared Memory (“DSM”) computer system. Still, more particularly, the invention relates to a scalable high performance directory based cache coherence protocol that allows data sharing among processors in a DSM computer system.

[0007] 2. Background of the Invention

[0008] Distributed computer systems typically comprise multiple computers connected to each other by a communications network. In some distributed computer systems, the network computers can access shared data. Such systems are sometimes known as parallel computers. If a larger number of computers are networked, the distributed system is considered to be “massively” parallel. One advantage of a massively parallel computer is that it can solve complex computational problems in a reasonable amount of time.

[0009] In such systems, the memories of the computers are collectively known as a Distributed Shared Memory (“DSM”). It is a problem to ensure that the data stored in a DSM is accessed in a coherent manner. Coherency, in part, means that only one processor can modify any part of the data at any one time, otherwise the state of the system would be nondeterministic.

[0010] Recently, DSM systems have been built as a cluster of Symmetric Multiprocessors (“SMP”). In SMP systems, shared memory can be implemented efficiently in hardware since the processors are symmetric (e.g., identical in construction and in operation) and operate on a single, shared processor bus. Symmetric Multiprocessor systems have good price/performance ratios with four or eight processors. However, because of the specially designed bus that makes message passing between the processors a bottleneck, it is difficult to scale the size of an SMP system beyond twelve or sixteen processors.

[0011] It is desired to construct large-scale DSM systems using processors connected by a network. The goal is to allow processors to efficiently share the memories so that data fetched by one program executed on a first processor from memory attached to a second processor is immediately available to all processors.

[0012] Caches connected to each processor of the computer system permit faster access to data from the main memory of each computer system. Caches are useful because they reduce memory latencies on cache hits. However, unique to DSM multiprocessing computer systems, the copies of memory locations stored in each computer system cache allow for inconsistent copies to develop if a coherency protocol that enforces cache consistency is not implemented in the computer system. This coherency protocol must typically be designed in such a manner that it scales to very large processor configurations with maximum memory system performance. Prior art systems suffered from performance bottlenecks due to the bus based cache coherence protocols prevalent in such systems. Bus based coherence protocols limit the number of processors that can be incorporated into such a high performance system. Directory based solutions to the problem of cache and memory coherence scale much better to larger systems because they can be efficiently adapted to more arbitrary and larger numbers of processor interconnects.

[0013] The problems noted above are solved in large part by a distributed multiprocessing computer system that contains a plurality of processors, each connected to RAMbus™ Inline Memory Modules (“RIMM”) main memory. Thus, each processor preferably has an associated main memory constructed of RIMMs. Each RIMM contains data that is shared between the processors. The main memory is subdivided into logical memory blocks indexed by a physical address used by the processor to access the memory block. Each memory block has an associated directory that maintains the coherence of the data in the memory block across all processors that may contain a copy of the memory block in the distributed multiprocessing computer system. Each memory block in main memory and its associated coherence directory has a designated Home processor. The Home processor contains the original memory block-other processors needing access to the memory block only contain copies of the Home processor memory block. An Owner processor is another processor in the multiprocessing computer system that includes a copy of the Home processor memory block in a cache connected to the Owner processor main memory. Whenever an Owner processor is associated with a memory block, it is the only processor in the distributed multiprocessing computer system permitted to contain a copy of the Home processor memory block. The Owner processor has permission to modify the contents of the memory block.

[0014] Each of the processors in the distributed multiprocessing computer system incorporates a coherence controller connected to a RIMM. A coherence controller maintains the coherence of the shared data in the memory module using the coherence directory in the Home processor. If the cache becomes full, a memory block may need to be replaced to make room for a new memory block. Thus, for the case of an Owner that contains a memory block copy, if this memory block copy is replaced from the Owner's cache memory, then the copy of the Owner memory block is written to the Home processor containing the original memory block. In addition, the corresponding directory entry in the Home processor for the memory block is updated. A read of the Home processor directory or modification of other processor cache and main memory RIMMs in the computer system is not required.

[0015] In each processor, the coherence controller sends and receives messages out of order to maintain the coherence of the shared data in the main memory RIMMs. If an out of order message causes an incorrect next program state, the cache and directory coherence controllers restores the prior correct saved program state and resume execution. In the distributed multiprocessing computer system, a processor needing to read or write to a memory block not present in its main memory or cache must then request a copy of the memory block from the Home processor. This processor is referred to as a Requester processor. After the Requester processor by consulting the Home processor has determined the owner of a cache block, Requester and Owner processors communicate directly to maintain cache coherency without routing through the Home processor directory.

[0016] A memory block in the distributed multiprocessing computer system also may be shared by multiple processors that have read only access capabilities to the memory block. These Sharer processors each contain a shared copy of the memory block in a cache connected to the Sharer processor main memory. A coherence controller in the processor maintains the coherence of the shared data in the main memory using the coherence directory for the memory block in the Home processor. Each coherence controller is capable of sending and receiving messages out of order to maintain the coherence of the shared data in the main memory. If out of order messages cause an incorrect next program state, the coherence controller is capable of restoring the prior correct saved program state and resume execution.

[0017] In the distributed multiprocessing computer system, a Requestor processor that encounters a read or write miss of a memory block in its main memory or cache can send and receive messages directly to Sharer processors to maintain cache coherency, without routing the messages through the Home processor directory. Eviction of the shared copy of the memory block in the Sharer processor cache caused by replacement of the memory block from the cache does not have to be communicated to the Home processor directory for the memory block.

[0018] For a detailed description of the preferred embodiments of the invention, reference will now be made to the accompanying drawings in which:

[0019] FIG. 1 shows a system diagram of a plurality of processors coupled together;

[0020] FIGS. 2aand 2bshow a block diagram of the processors of FIG. 1;

[0021] FIG. 3 shows the Zbox memory controller of FIG. 2bin more detail including the coherency hardware;

[0022] FIG. 4 shows a block diagram of main memory partitioned into shared, private, and system space;

[0023] FIG. 5ashows the basic coherence topology with a Requester, Home, and Owner;

[0024] FIG. 5bshows an example of a Requester accessing a local Home for a read;

[0025] FIG. 5cshows an example of a remote read request to remote Home;

[0026] FIG. 5dshows an example of a remote read request with an Owner that is remote from the Home;

[0027] FIG. 5eshows an example of a remote write request with an Owner that is remote from the Home;

[0028] FIG. 5fshows an example of a remote write request with remote sharers that contain a shared copy of the block; and

[0029] FIG. 5gshows an example of a write back from a remote Owner to Home.

[0030] Certain terms are used throughout the following description and claims to refer to particular system components. As one skilled in the art will appreciate, computer companies may refer to a component by different names. This document does not intend to distinguish between components that differ in name but not function. In the following discussion and in the claims, the terms “including” and “comprising” are used in an open-ended fashion, and thus should be interpreted to mean “including, but not limited to . . . ”. Also, the term “couple” or “couples” is intended to mean either an indirect or direct electrical connection. Thus, if a first device couples to a second device, that connection may be through a direct electrical connection, or through an indirect electrical connection via other devices and connections.

[0031] Referring now to FIG. 1, in accordance with the preferred embodiment of the invention, computer system 90 comprises one or more processors 100 coupled to a memory 102 and an input/output (“I/O”) controller 104. As shown, computer system 90 includes twelve processors 100, each processor coupled to a memory and an I/O controller. Each processor preferably includes four ports for connection to adjacent processors. The interprocessor ports are designated “North,” “South,” “East,” and “West” in accordance with the well-known Manhattan grid architecture also known as a crossbar interconnection network architecture. As such, each processor 100 can be connected to four other processors. The processors on both ends of the system layout wrap around and connect to processors on the opposite side to implement a 2D torus-type connection. Although twelve processors 100 are shown in the exemplary embodiment of FIG. 1, any desired number of processors (e.g., 256) can be included. For purposes of the following discussion, the processor in the upper, left-hand comer of FIG. 1 will be discussed with the understanding that the other processors 100 are similarly configured in the preferred embodiment.

[0032] As noted, each processor preferably has an associated I/O controller 104. The I/O controller 104 provides an interface to various input/output devices such as disk drives 105 and 106, as shown in the lower, left-hand corner of FIG. 1. Data from the I/O devices thus enters the 2D torus via the I/O controllers.

[0033] Each processor also, preferably, has an associated memory 102. In accordance with the preferred embodiment, the memory 102 preferably comprises RAMbus™ memory devices, but other types of memory devices can be used, if desired. The capacity of the memory devices 102 can be any suitable size. Further, memory devices 102 preferably are implemented as Rambus Interface Memory Modules (“RIMM”).

[0034] In general, computer system 90 can be configured so that any processor 100 can access its own memory 102 and I/O devices, as well as the memory and I/O devices of all other processors in the system. Preferably, the computer system may have physical connections between each processor resulting in low interprocessor communication times and improved memory and I/O device access reliability. If physical connections are not present between each pair of processors, a pass-through or bypass path is preferably implemented in each processor that permits accesses to a processor's memory and I/O devices by another processor through one or more pass-through processors.

[0035] Referring now to FIGS. 2aand 2b, each processor 100 preferably includes an instruction cache 110, an instruction fetch, issue and retire unit (“Ibox”) 120, an integer execution unit (“Ebox”) 130, a floating-point execution unit (“Fbox”) 140, a memory reference unit (“Mbox”) 150, a data cache 160, an L2 instruction and data cache control unit (“Cbox”) 170, a level L2 cache 180, two memory controllers (“Zbox0” and “Zbox1”) 190, and an interprocessor and I/O router unit (“Rbox”) 200. The following discussion describes each of these units.

[0036] Each of the various functional units 110-200 contains control logic that communicates with the control logic of various other functional units, control logic as shown. The instruction cache control logic 110 communicates with the Ibox 120, Cbox 170, and L2 Cache 180. In addition to the control logic communicating with the instruction cache 110, the Ibox control logic 120 communicates with Ebox 130, Fbox 140 and Cbox 170. The Ebox 130 and Fbox 140 control logic both communicate with the Mbox 150, which in turn communicates with the data cache 160 and Cbox 170. The Cbox control logic also communicates with the L2 cache 180, Zboxes 190, and Rbox 200.

[0037] Referring still to FIGS. 2aand 2b, the Ibox 120 preferably includes a fetch unit 121 which contains a virtual program counter (“VPC”) 122, a branch predictor 123, an instruction-stream translation buffer 124, an instruction predecoder 125, a retire unit 126, decode and rename registers 127, an integer instruction queue 128, and a floating point instruction queue 129. Generally, the VPC 122 maintains virtual addresses for instructions that are in flight. An instruction is said to be “in-flight” from the time it is fetched until it retires or aborts. The Ibox 120 can accommodate as many as 80 instructions, in 20 successive fetch slots, in flight between the decode and rename registers 127 and the end of the pipeline. The VPC preferably includes a 20-entry table to store these fetched VPC addresses.

[0038] With regard to branch instructions, the Ibox 120 uses the branch predictor 123. A branch instruction requires program execution either to continue with the instruction immediately following the branch instruction if a certain condition is met, or branch to a different instruction if the particular condition is not met. Accordingly, the outcome of a branch instruction is not known until the instruction is executed. In a pipelined architecture, a branch instruction (or any instruction for that matter) may not be executed for at least several, and perhaps many, clock cycles after the is desirable for efficient operation, the processor includes branch prediction logic that predicts the outcome of a branch instruction before it is actually executed (also referred to as “speculating”). The branch predictor 123, which receives addresses from the VPC queue 122, preferably bases its speculation on short and long-term history of prior instruction branches. As such, using branch prediction logic, a processor's fetch unit can speculate the outcome of a branch instruction before it is actually executed. The speculation, however, may or may not turn out to be accurate. That is, the branch predictor logic may guess wrong regarding the direction of program execution following a branch instruction. If the speculation proves to have been accurate, which is determined when the processor executes the branch instruction, then the next instructions to be executed have already been fetched and are working their way through the pipeline. If, however, the branch speculation performed by the branch predictor 123 turns out to have been the wrong prediction (referred to as “misprediction” or “misspeculation”), many or all of the instructions behind the branch instruction may have to be flushed from the pipeline (i.e., not executed) because of the incorrect fork taken after the branch instruction. Branch predictor 123 uses any suitable branch prediction algorithm, however, that results in correct speculations more often than misspeculations, and the overall performance of the processor is better (even in the face of some misspeculations) than if speculation was turned off.

[0039] The instruction translation buffer (“ITB”) 124 couples to the instruction cache 110 and the fetch unit 121. The ITB 124 comprises a 128-entry, fully associative instruction-stream translation buffer that is used to store recently used instruction-stream address translations and page protection information. Preferably, each of the entries in the ITB 124 may be 1, 8, 64 or 512 contiguous 8-kilobyte (“KB”) pages or 1, 32, 512, 8192 contiguous 64-kilobyte pages. The allocation scheme used for the ITB 124 is a round-robin scheme, although other schemes can be used as desired.

[0040] The predecoder 125 reads an octaword (16 contiguous bytes) from the instruction cache 110. Each octaword read from instruction cache may contain up to four naturally aligned instructions per cycle. Branch prediction and line prediction bits accompany the four instructions fetched by the predecoder 125. The branch prediction scheme implemented in branch predictor 123 generally works most efficiently when only one branch instruction is contained among the four fetched instructions. The predecoder 125 predicts the instruction cache line that the branch predictor 123 will generate. The predecoder 125 generates fetch requests for additional instruction cache lines and stores the instruction stream data in the instruction cache.

[0041] Referring still to FIGS. 2aand 2b, the retire unit 126 fetches instructions in program order, executes them out of order, and then retires (also called “committing” an instruction) them in order. The Ibox 120 logic maintains the architectural state of the processor by retiring an instruction only if all previous instructions have executed without generating exceptions or branch mispredictions. An exception is any event that causes suspension of normal instruction execution. Retiring an instruction commits the processor to any changes that the instruction may have made to the software accessible registers and memory. The processor 100 preferably includes the following three machine code accessible hardware: integer and floating-point registers, memory, internal processor registers. The retire unit 126 of the preferred embodiment can retire instructions at a sustained rate of eight instructions per cycle, and can retire as many as 11 instructions in a single cycle.

[0042] The decode and rename registers 127 contains logic that forwards instructions to the integer and floating-point instruction queues 128, 129. The decode and rename registers 127 perform preferably the following two functions. First, the decode and rename registers 127 eliminates register write-after-read (“WAR”) and write-after-write (“WAW”) data dependency while preserving true read-after-write (“RAW”) data dependencies. This permits instructions to be dynamically rescheduled. Second, the decode and rename registers 127 permits the processor to speculatively execute instructions before the control flow previous to those instructions is resolved.

[0043] The logic in the decode and rename registers 127 preferably translates each instruction's operand register specifiers from the virtual register numbers in the instruction to the physical register numbers that hold the corresponding architecturally-correct values. The logic also renames each instruction destination register specifier from the virtual number in the instruction to a physical register number chosen from a list of free physical registers, and updates the register maps. The decode and rename register logic can process four instructions per cycle. Preferably, the logic in the decode and rename registers 127 does not return the physical register, which holds the old value of an instruction's virtual destination register, to the free list until the instruction has been retired, indicating that the control flow up to that instruction has been resolved.

[0044] If a branch misprediction or exception occurs, the register logic backs up the contents of the integer and floating-point rename registers to the state associated with the instruction that triggered the condition, and the fetch unit 121 restarts at the appropriate Virtual Program Counter (“VPC”). Preferably, as noted above, twenty valid fetch slots containing up to eighty instructions can be in flight between the registers 127 and the end of the processor's pipeline, where control flow is finally resolved. The register 127 logic is capable of backing up the contents of the registers to the state associated with any of these 80 instructions in a single cycle. The register logic 127 preferably places instructions into the integer or floating-point issue queues 128, 129, from which they are later issued to functional units 130 or 136 for execution.

[0045] The integer instruction queue 128 preferably includes capacity for twenty integer instructions. The integer instruction queue 128 issues instructions at a maximum rate of four instructions per cycle. The specific types of instructions processed through queue 128 include: integer operate commands, integer conditional branches, unconditional branches (both displacement and memory formats), integer and floating-point load and store commands, Privileged Architecture Library (“PAL”) reserved instructions, integer-to-floating-point and floating-point-integer conversion commands.

[0046] Referring still to FIGS. 2aand 2b, the integer execution unit (“Ebox”) 130 includes arithmetic logic units (“ALUs”) 131, 132, 133, and 134 and two integer register files 135. Ebox 130 preferably comprises a 4-path integer execution unit that is implemented as two functional-unit “clusters” labeled 0 and 1. Each cluster contains a copy of an 80-entry, physical-register file and two subclusters, named upper (“U”) and lower (“L”). As such, the subclusters 131-134 are labeled U0, L0, U1, and L1. Bus 137 provides cross-cluster communication for moving integer result values between the clusters.

[0047] The subclusters 131-134 include various components that are not specifically shown in FIG. 2a. For example, the subclusters preferably include four 64-bit adders that are used to calculate results for integer add instructions, logic units, barrel shifters and associated byte logic, conditional branch logic, a pipelined multiplier for integer multiply operations, and other components known to those of ordinary skill in the art.

[0048] Each entry in the integer instruction queue 128 preferably asserts four request signals—one for each of the Ebox 130 subclusters 131, 132, 133, and 134. A queue entry asserts a request when it contains an instruction that can be executed by the subcluster, if the instruction's operand register values are available within the subcluster. The integer instruction queue 128 includes two arbiters—one for the upper subclusters 132 and 133 and another arbiter for the lower subclusters 131 and 134. Each arbiter selects two of the possible twenty requesters for service each cycle. Preferably, the integer instruction queue 128 arbiters choose between simultaneous requesters of a subcluster based on the age of the request—older requests are given priority over newer requests. If a given instruction requests both lower subclusters, and no older instruction requests a lower subcluster, then the arbiter preferably assigns subcluster 131 to the instruction. If a given instruction requests both upper subclusters, and no older instruction requests an upper subcluster, then the arbiter preferably assigns subcluster 133 to the instruction.

[0049] The floating-point instruction queue 129 preferably comprises a 15-entry queue and issues the following types of instructions: floating-point operates, floating-point conditional branches, floating-point stores, and floating-point register to integer register transfers. Each queue entry preferably includes three request lines—one for the add pipeline, one for the multiply pipeline, and one for the two store pipelines. The floating-point instruction queue 129 includes three arbiters—one for each of the add, multiply, and store pipelines. The add and multiply arbiters select one requester per cycle, while the store pipeline arbiter selects two requesters per cycle, one for each store pipeline. As with the integer instruction queue 128 arbiters, the floating-point instruction queue arbiters select between simultaneous requesters of a pipeline based on the age of the request—older request are given priority. Preferably, floating-point store instructions and floating-point register to integer register transfer instructions in even numbered queue entries arbitrate for one store port. Floating-point store instructions and floating-point register to integer register transfer instructions in odd numbered queue entries arbitrate for the second store port.

[0050] Floating-point store instructions and floating-point register-to-integer-register transfer instructions are queued in both the integer and floating-point queues. These instructions wait in the floating-point queue until their operand register values are available from the floating-point execution unit (“Fbox”) registers. The processor executing these instructions subsequently requests service from the store arbiter. Upon being issued from the floating-point queue 129, the processor executing these instructions signal the corresponding entry in the integer queue 128 to request service. Finally, the operation is complete after the instruction is issued from the integer queue 128.

[0051] The integer registers 135, 136 preferably contain storage for the processor's integer registers, results written by instructions that have not yet been retired, and other information as desired. The two register files 135, 136 preferably contain identical values. Each register file preferably includes four read ports and six write ports. The four read ports are used to source operands to each of the two subclusters within a cluster. The six write ports are used to write results generated within the cluster or another cluster and to write results from load instructions.

[0052] The floating-point execution queue (“Fbox”) 129 contains a floating-point add, divide and square-root calculation unit 142, a floating-point multiply unit 144 and a register file 146. Floating-point add, divide and square root operations are handled by the floating-point add, divide and square root calculation unit 142 while floating-point operations are handled by the multiply unit 144.

[0053] The register file 146 preferably provides storage for seventy-two entries including thirty-one floating-point registers and forty-one values written by instructions that have not yet been retired. The Fbox register file 146 contains six read ports and four write ports (not specifically shown). Four read ports are used to source operands to the add and multiply pipelines, and two read ports are used to source data for store instructions. Two write ports are used to write results generated by the add and multiply pipelines, and two write ports are used to write results from floating-point load instructions.

[0054] Referring still to FIG. 2a, the Mbox 150 controls the L1 data cache 160 and ensures architecturally correct behavior for load and store instructions. The Mbox 150 preferably contains a datastream translation buffer (“DTB”) 151, a load queue (“LQ”) 152, a store queue (“SQ”) 153, and a miss address file (“MAF”) 154. The DTB 151 preferably comprises a fully associative translation buffer that is used to store data stream address translations and page protection information. Each of the entries in the DTB 151 can map 1, 8, 64, or 512 contiguous 8-KB pages. The allocation scheme preferably is round robin, although other suitable schemes could also be used. The DTB 151 also supports an 8-bit Address Space Number (“ASN”) and contains an Address Space Match (“ASM”) bit. The ASN is an optionally implemented register used to reduce the need for invalidation of cached address translations for process-specific addresses when a context switch occurs.

[0055] The LQ 152 preferably is a reorder buffer used for load instructions. It preferably contains thirty-two entries and maintains the state associated with load instructions that have been issued to the Mbox 150, but for which results have not been delivered to the processor and the instructions retired. The Mbox 150 assigns load instructions to LQ slots based on the order in which they were fetched from the instruction cache 110, and then places them into the LQ 152 after they are issued by the integer instruction queue 128. The LQ 152 also helps to ensure correct memory reference behavior for the processor.

[0056] The SQ 153 preferably is a reorder buffer and graduation unit for store instructions. It preferably contains thirty-two entries and maintains the state associated with store instructions that have been issued to the Mbox 150, but for which data has not been written to the data cache 160 and the instruction retired. The Mbox 150 assigns store instructions to SQ slots based on the order in which they were fetched from the instruction cache 110 and places them into the SQ 153 after they are issued by the instruction cache 110. The SQ 153 holds data associated with the store instructions issued from the integer instruction unit 128 until they are retired, at which point the store can be allowed to update the data cache 160. The LQ 152 also helps to ensure correct memory reference behavior for the processor. The miss address file (“MAF”) 154 preferably comprises a 16-entry file that holds physical addresses associated with pending instruction cache 110 and data cache 160 fill requests and pending input/output (“I/O”) space read transactions.

[0057] Processor 100 preferably includes two on-chip primary-level (“L1”) instruction and data caches 110 and 160, and a single secondary-level, unified instruction/data (“L2”) cache 180 (FIG. 2b). The L1 instruction cache 110 preferably comprises a 64-KB virtual-addressed, two-way set-associative cache. Prediction of future instruction execution is used to improve the performance of the two-way set-associative cache without slowing the cache access time. Each instruction cache block preferably contains a plurality (preferably 16) instructions, virtual tag bits, an address space number, an address space match bit, a one-bit PALcode bit to indicate physical addressing, a valid bit, data and tag parity bits, four access-check bits, and predecoded information to assist with instruction processing and fetch control.

[0058] The L1 data cache 160 preferably comprises a 64-KB, two-way set associative, virtually indexed, physically tagged, write-back, read/write allocate cache with 64-byte cache blocks. During each cycle the data cache 160 preferably performs one of the following transactions: two quadword (or shorter) read transactions to arbitrary addresses, two quadword write transactions to the same aligned octaword, two non-overlapping less-than quadword writes to the same aligned quadword, one sequential read and write transaction from and to the same aligned octaword. Preferably each data cache block contains 64 data bytes and associated quadword ECC bits, physical tag bits, valid, dirty, shared, and modified bits, tag parity bit calculated across the tag, dirty, shared, and modified bits, and one bit to control round-robin set allocation. The data cache 160 preferably is organized to contain two sets, each with 512 rows containing 64-byte blocks per row (i.e., 32-KB of data per set). The processor 100 uses two additional bits of virtual address beyond the bits that specify an 8-KB page in order to specify the data cache row index. A given virtual address might be found in four unique locations in the data cache 160, depending on the virtual-to-physical translation for those two bits. The processor 100 prevents this aliasing by keeping only one of the four possible translated addresses in the cache at any time.

[0059] As will be understood by one skilled in the art, the L2 cache 180 comprises a secondary cache for the processor 100, which typically is implemented on a separate chip. The L2 cache 180 preferably comprises a 1.75-MB, seven-way set associative write-back mixed instruction and data cache. Preferably, the L2 cache holds physical address data and coherence state bits for each block.

[0060] Referring now to FIG. 2b, the L2 instruction and data cache control unit (“Cbox”) 170 controls the L2 instruction and data cache 190 and system ports. As shown, the Cbox 170 contains a fill buffer 171, a data cache victim buffer 172, a system victim buffer 173, a cache miss address file (“CMAF”) 174, a system victim address file (“SVAF”) 175, a data victim address file (“DVAF”) 176, a probe queue (“PRBQ”) 177, a requester miss-address file (“RMAF”) 178, a store to I/O space (“STIO”) 179, and an arbitration unit 181.

[0061] The fill buffer 171 in the Cbox preferably buffers data received from other functional units outside the Cbox 170. The data and instructions get written into the fill buffer 171 and other logic units in the Cbox 170 process the data and instructions before sending to another functional unit or the L1 cache 110 and 160. The data cache victim buffer (“VDF”) 172 preferably stores data flushed from the L1 cache 110 and 160 or sent to the System Victim Data Buffer 173. The System Victim Data Buffer (“SVDB”) 173 sends data flushed from the L2 cache to other processors in the system and to memory. Cbox Miss-Address File (“CMAF”) 174 preferably holds addresses of L1 cache misses. CMAF 174 updates and maintains the status of these addresses. The System Victim-Address File (“SVAF”) 175 in the Cbox 170 preferably contains the addresses of all SVDB data entries. Data Victim-Address File (“DVAF”) 176 preferably contains the addresses of all data cache victim buffer (“VDF”) 172 data entries.

[0062] The Probe Queue (“PRBQ”) 177 preferably comprises a 18-entry queue that holds pending system port cache probe commands and addresses. The Probe Queue 177 includes 10 remote request entries, 8 forward entries, and lookup L2 tags and requests from the PRBQ content addressable memory (“CAM”) against the RMAF, CMAF and SVAF. Requestor Miss-Address Files (“RMAF”) 178 in the Cbox 170 preferably accepts requests and responds with data or instructions from the L2 cache. Data accesses from other functional units in the processor, other processors in the computer system or any other devices that might need data out of the L2 cache are sent to the RMAF 178 for service. The Store Input/Output (“STIO”) 179 preferably transfer data from the local processor to I/O cards in the computer system. Finally, arbitration unit 181 in the Cbox 170 preferably arbitrates between load and store accesses to the same memory location of the L2 cache and informs other logic blocks in the Cbox and computer system functional units of the conflict.

[0063] Referring still to FIG. 2b, processor 100 preferably includes dual, integrated RAMbus memory controllers 190 (Zbox0 and Zbox1). Each Zbox 190 controls 4 or 5 channels of information flow with the main memory 102 (FIG. 1). Each Zbox 190 preferably includes a front-end directory in flight table (“DIFT”) 191, a middle mapper 192, and a back end 193. The front-end DIFT 191 performs a number of functions such as managing the processor's directory-based memory coherency protocol, processing request commands from the Cbox 170 and Rbox 200, sending forward commands to the Rbox 200, sending response commands to and receiving packets from the Cbox 170 and Rbox 200, and tracking up to thirty-two in-flight transactions. The front-end DIFT 191 also sends directory read and write requests to the Zbox 190 and conditionally updates directory information based on request type, Local Probe Response (“LPR”) status and directory state.

[0064] The middle mapper 192 maps the physical address into RAMbus device format by device, bank, row, and column. The middle mapper 192 also maintains an open-page table to track all open pages and to close pages on demand if bank conflicts arise. The mapper 192 also schedules RAMbus transactions such as timer-base request queues. The Zbox back end 193 preferably packetizes the address, control, and data into RAMbus format and provides the electrical interface to the RAMbus devices themselves.

[0065] The Rbox 200 provides the interfaces to as many as four other processors and one I/O controller 104 (FIG. 1). The inter-processor interfaces are designated as North (“N”), South (“S”), East (“E”), and West (“W”) and provide two-way communication between adjacent processors.

[0066] Referring now to FIG. 3, a more detailed description of the Zbox front end, middle and back end hardware. The front end 318 of the Zbox 190 may receive a physical address 302 from the Cbox 170 or a physical address 304 from the Rbox 200. The front end also generates and transmits Response messages 306 and 310 to the Cbox 170 and Rbox 200. Forward coherence messages 312 are generated by the front end 318 and transmitted to the Rbox 200. The Cbox 170 transmits Local Probe Responses (“LPR”) 308 to the front end. The front end 318 contains a directory in flight table (“DIFT”) 324, Controller (“CTL”) 328 and the cache coherence controller 326 that manages the directory based memory coherence protocol for the cache and main memory.

[0067] The DIFT receives message packets from the Cbox 170 or the Rbox 200. It sends directory read and write requests generated by the coherency controller to the Zbox middle section 320. The DIFT instructs the back end 322 to write memory data and ECC (error correction codes) into a fill buffer 171 in the Cbox 170 to satisfy the request. The directory in flight table also receives local probe responses from the Cbox 170. The coherence controller 326 in conjunction with the directory in flight table conditionally updates the memory coherence directory based on the request type, LPR status, and directory state through the directory out bus 346 to the coherence table 342.

[0068] Zbox middle section 320 consists of a map 330 that maps the Physical Address (“PA”) 356 received from the front end into preferably RAMbus™ device format by device, bank, row and column. The map 330 also maintains an open page table 332 that tracks all open pages up to one kilobyte in size. The map closes pages in the page table 332 on demand if there are bank conflict issues. A slot 334 schedules RAMbus™ transactions by updating request queues PRE, RES and CAS.

[0069] The Zbox back end 322 packetizes address, control and data into RAMbus™ format. The Zbox back end includes registers data out 336, row out 338 and column out 340. The data in buffer 344 takes inbound data from RAMbus™ Inline Memory Modules (“RIMM”) and converts this to the appropriate format accessible to the processor. The back end receives from the Cbox 170 system victim and fill buffer data 350 and outputs fill buffer data 352 to the Cbox. Back end 322 receives row 358 and column 360 address from the middle section and converts these octaword formats to 8-byte RAMbus™ format.

[0070] Referring now to FIG. 4, an allocation of addresses to a block of memory in RAMbus™ DRAM 354 as used in the preferred embodiment of the DSM computer system is shown. Addresses are reserved for stacks 410, program text 420, static private data 430, and dynamic shared data 450. The addresses in the static private data 430 are used to store data that are exclusively used by a single local processor, e.g., the data are not shared. The addresses in this portion of the memory are allocated when a particular program is loaded for execution.

[0071] In the preferred embodiment shown in FIG. 4, the processor generates 72-byte blocks of storage 451 in the shared data area of processor memory as shared memory. Preferably, coherence is maintained by means of the directory scheme noted above. This directory scheme maintains state information with each block of memory. The state indicates the current state of the block as well as the processors in the distributed computer system holding copies of the block. For each 64-bytes in the RAMbus™ DRAM, there are actually 72-bytes of storage, leaving 8 additional bytes, 452. In the preferred embodiment, the processor allocates a 9-bit ECC code on each 16-bytes of data. In addition to being stored with the 16-bytes in the RAMbus™ storage, the 9-bit ECC code is also used by the system caches. The 36-bit (64/16=4, 4*9=36 bits) ECC code leaves an extra 28 bits (8*8=64 bits, 64−36=28 bits) of storage for the directory information with each 72-byte block. Of the available 28 bits, 27 are used so that the directory information can be written independently of the data using the byte write capability of the RAMbus™ (RAMbus™ is capable of writing 9 bit bytes). Of the 27 bits, 6 bits are required for ECC coverage of the directory information and 21 bits of storage are available for the directory information.

[0072] A local reference to a processor's shared data does not update the memory coherence directory since coherence for a local reference is maintained by forcing all remote requests to locally probe the caches, MAF and the VAF before a request can complete. Remote requests must update the directory since that is the means by which knowledge about the use of the block is maintained globally.

[0073] In the preferred embodiment, the supported cache states are listed in Table 1.

[0074] The processor must have a block in the Dirty state in the cache to write to the block in RAMbus memory.

[0075] A directory state stored in the shared data section 450 of RAMbus™ memory is 27-bits encoded as listed in Table 2 below. The least significant bits of any field in the Table are on the right side.

[0076] In the preferred embodiment of the invention, coherence messages are split into three types: REQUEST, FORWARD and RESPONSE. Load data REQUESTs are transferred from the requesting processor to the directory. The directory is examined to determine further action. If the block is local (that is, invalid in remote processors), the directory is updated and a RESPONSE is returned. If the block is in the exclusive state, the request may be FORWARD'ed from the directory to the exclusive owner of the block. A FORWARD'ed request normally results in a RESPONSE sent to both the requestor and to the directory. If the block is in the shared state and the request is to modify the block, invalidations of the shared blocks are FORWARD'ed from the directory to each of the shared copies and a RESPONSE is also sent to the requester. Upon receipt of the FORWARD'ed invalidates, a processor responds with invalidate acknowledge RESPONSEs.

[0077] The physical address space is partitioned into a Directory Processor Identifier (“DPID”) and offset address. The DPID is the processor holding the physical memory and the offset address that selects which address at that processor. The processor of the preferred embodiment has a 43-bit physical address and a 43-bit I/O space address.

[0078] Turning now to FIGS. 5athrough FIGS. 5g, cache and memory coherence is maintained by means of directories. The terminology for this directory-based scheme, and examples of its application, are described in FIGS. 5athrough FIG. 5g. Nodes may be one of four types defined as follows:

[0079] Requestor (Req)—a node encountering and read or write miss.

[0080] Home—a node that contains the memory and directory for the reference block.

[0081] Owner (Own)—a remote node that contains an exclusive copy of the block in its cache.

[0082] Share (S)—a remote node that contains a shared copy of the block in its cache.

[0083] FIG. 5ashows the basic coherence topology with a Requestor 502, Home 504 and Owner 506. The Requestor makes a request for a read or write to the Home that contains the memory and directory for the requested block. If an Owner containing an exclusive copy of the block (as in FIG. 5a) is present, the Home node forwards the read or write request to the Owner.

[0084] FIG. 5bis an example of a read Requestor 508 accessing a local Home (Requestor and Home are the same node). In this scenario the local Home/Memory 510 is at the Requestor node and the directory state is local or shared. The Requestor 508 retrieves the data directly from local memory 510 and does not update the directory because the state of the cache block at the Home 508 is determined by a check of the cache tag. Requests to a local Home are extremely efficient because an update of the directory is not required under these conditions.

[0085] FIG. 5cshows an example of a read request to a remote Home 514. The Home 514 and Memory 516 is remote from the Requestor 512 and the directory state is shared or local. The Requestors request (“READREQ”) is sent to Home 514 which then gets the block from cache/memory, updates the directory state and replies with the block (“BLK”).

[0086] FIG. 5dshows a read request from a Requestor 518 for a memory block present in a remote Owner 522. In this scenario, the Home is remote, and the directory state is exclusive with the cache at the processor in the Owner 522 in a dirty state. The Requestor 518 requests a read (“READREQ”) that is sent to the Home node 520 that contains the memory and directory for the referenced block. The Home 520 forwards the request to the Owner 522 (“READFWD”) and leaves the directory pending in directory in flight table. The Owner 522 sends a read reply (“BLKSHARED”) with the data to the Requestor 518, also writing back the data to Home 520. Owner sends a VICTIMACKSHARED message to Home indicating that the block is shared, with both the prior exclusive Owner and the Requestor in the directory/DIFT sharing list. The Home 520 makes the directory entry not pending in DIFT when VICTIMACKSHARED arrives. The pending state in the DIFT maintains serialization order.

[0087] FIG. 5eshows a write request from a Requestor 524 to a memory block present in a remote Owner 528. In this scenario, the Home 526 is remote, and the directory state is exclusive with the cache at the processor in the Owner 528 in either a clean or dirty state. The Requestor 524 performs a modify request (“READMODREQ”) that is sent to the Home node 526 containing the memory and directory for the referenced block. The Home 526 forwards the modify request to the Owner 528 (“READMODFWD”) and leaves the directory state pending in the directory in flight table. The Owner 528 sends a reply (“BLKEXCLUSIVE”) with the data to the Requestor 524 that modifies the data and stores it in cache in a dirty state. Owner 528 sends a FWDACKEXCL message to the Home 526 making the directory/DIFT state in the Home node indicate that the Requestor is the new exclusive owner. The Home 526 makes the directory entry not pending in DIFT when the FWDACKEXCL arrives. Use of the pending state in the DIFT maintains serialization order.

[0088] FIG. 5fshows a write request from a Requestor 530 to a memory block that is present in remote sharers 534, 536 and 538. In this scenario, the Home 532 is remote, and the directory state for the memory block is shared. The Requestor 530 performs a modify request (“READMOD”) that is sent to the Home node 532 containing the memory and directory for the referenced block. Home 532 sends invalidation requests to sharers 534, 536 and 538 (“SHAREDINV”) and sends data back to the Requestor 530 using a BLKEXCLCNT. The Requestor 530 modifies the data and stores it in cache in a dirty state. BLKEXCLCNT notifies the Requestor of the number of INVALACKS to expect from the Sharers. Each Sharer 534, 536 and 538 reply to the Requestor 530 with invalidation acknowledgments (“INVALACK”). The Requestor proceeds when the data arrives, but must stall incoming requests and potential write backs of memory blocks until all INVALACKs are received.

[0089] FIG. 5gshows an example of a write back in which the Owner 540 contains an exclusive copy of the block in its cache and must replace this block. The Owner 540 sends a VICTIM/VICTIMCLEAN request with the data to Home 542 containing the memory and directory for the referenced block. Home 542 writes data to the local memory block and changes the directory state to local.

[0090] Use of a directory based cache and memory coherence protocol with the features described above has many advantages over prior art coherence protocols. Messages may be sent and received by the Rbox of each processor out of order for cache or memory references because of the VICTIMACKSHARED, FWDACKEXCL and INVALACK implementations used for the present system. Allowing out of order messaging permits the protocol to select any one of multiple paths between source and destination nodes thus making the distributed shared memory computer system more adaptive and efficient. If the out of order message results in an incorrect next program state, the system can restore the prior correct saved program state and continue execution. The coherency controller also restricts the operations that can be performed by any processor on the block of data prior to VICTIMACKSHARED, FWDACKEXCL or INVALACK being received.

[0091] In the cache and memory coherence protocol implemented for the preferred embodiment, communication directly between two nodes transferring the block of data is forced whenever possible. The Requestor when accessing a remote block of memory must go through the Home directory first-however, future communications whenever possible are directly between the Requestor and Owner. This minimizes memory access latency and increases program throughput. Another advantage of the present system is illustrated in FIG. 5gfor cache victim transactions in which the Owner has a block exclusively in memory and must replace the block from the cache. The present system does not require an acknowledgment from the Home 542 to the Owner 540 before allowing the Owner to proceed to the next state of program execution. When a cache victim returns to its Home node, after a check of the directory in flight table to determine if a copy of the Victim memory block is required by any other node, the Victim memory block is written to the memory of the Home node and the directory is updated. Thus, unlike prior art systems, a read of the current directory state followed by modification of nodes based on the current directory state is not required. Under the coherence protocol of the preferred embodiment, if nothing is present in the DIFT, the block can be written to memory and directory updated without a read.

[0092] A fourth advantage of the cache coherence protocol of the preferred embodiment is that eviction of shared cache blocks does not have to be communicated to the directory in the Home node, only exclusive Owners of cache blocks must inform the Home directory.

[0093] A fifth advantage of the present system is that forward progress is guaranteed for all cache block fill requests-thus Negative Acknowledgment (“NACK”) message types, informing the source to try again, that cause livelock problems are not present in the preferred embodiment. Livelock problems occur because of directory buffer overflows and are solved by guaranteeing priority to cache block fill request message types. The cache block request would remain in the network until accepted by the destination node.

[0094] A sixth advantage of the cache and memory coherence protocol implemented for the preferred embodiment is that the protocol supports optimistic invalidations of memory blocks in Sharer processors to allow for the highest possible performance in the common case of the Sharer not requiring immediate access to the memory block, yet supports a more conservative invalidation strategy that eliminates all unnecessary invalidates to guarantee load-lock/store-conditional forward progress. In the preferred embodiment, to make the coherence protocol a 3-hop protocol for most coherence messages, SHAREDINVALs are sent out speculatively by the Home processor before the Home processor can determine whether the request will ultimately succeed or fail. In the case of a fail, these SHAREDINVALs are sent out unnecessarily and a cache block may have been unnecessarily invalidated. For most situations, unnecessary invalidations do not cause any problems.

[0095] However for data synchronization through load-lock/store-conditional message sequences such an invalidation may lead to problems. The basic idea of these message sequences is that the load-lock grabs a copy of the data block. If the data block is still in the cache at the time the store-conditional executes, then the store-conditional succeeds and writes the memory location. Otherwise the store-conditional fails. A store-conditional that finds a shared copy of a data block in the cache will issue a SHAREDTODIRTY or SHAREDTODIRTYSTC request. In that case, the success or failure of the store-conditional is determined by the success or failure of the SHAREDTODIRTY*. If the Home processor is sending out unnecessary invalidates, it is possible to get into a livelock condition where no processors can succeed because all the store-conditionals are being failed because of unnecessary invalidates that are generated by other store-conditionals.

[0096] This problem is solved in the preferred embodiment by dynamically switching between a 3-hop and 5-hop coherence protocol. Under the 5-hop coherence protocol, the Requestor uses a SHAREDTODIRTYSTC when it thinks there is a chance for livelock. In cases where the Home cannot exactly determine success or failure of the SHAREDTODIRTYSTC, it sends a SHAREDTODIRTYPROBCNT (probable success) to the Requestor. The Home node using SHAREDTODIRTYPROBCNT is asking the Requestor whether the request is going to succeed or fail. The Requestor responds with either SHAREDTODIRTYCOMPLETE (success) or SHAREDTODIRTYRELEASE (failure). The Home node only sends out SHAREDINVALs after the Requestor indicates SHAREDTODIRTYCOMPLETE. Thus, under the 5-hop coherence protocol there are no unnecessary invalidates. Thus, the coherence protocol dynamically adapts to a 5-hop protocol when necessary to avoid livelock.

[0097] A seventh advantage of the coherence protocol is that it is flexible enough to allow for two different very simple migratory sharing modes that can improve performance with no changes to the base coherence protocol. Two different migratory sharing modes are available in the preferred embodiment, with the processor uses configuration bits to determine which mode to use. Preferably, the coherence protocol can dynamically flip between the sharing modes for different memory references in order to optimize performance. No change is required in the Zbox memory controller to support these modes. The base coherence protocol supports either.

[0098] An eighth advantage of the coherence protocol is that is flexible enough to allow two different READ* modes for cache block access. READ* misses can either get a shared copy of the cache block or an exclusive-clean copy of a cache block, yet cache blocks will always eventually become shared with enough readers of the same cache block. In the preferred embodiment, the memory controller uses the reference type and configuration bits to determine whether to send out READREQs or READSHAREDREQs. All instruction fetches use READSHAREDREQs and data references select one or the other based on a configuration bit. The protocol is flexible enough so that one of the two modes can be selected dynamically.

[0099] Finally, the coherence protocol has the advantage that all memory cache block transfers (BLK* messages and VICTIM* messages) are RESPONSEs. This property simplifies the network design since fewer large cache block size buffers are needed in the network buffers of the Rbox since both the BLK* and VICTIM* messages can share the same buffers.

[0100] The above discussion is meant to be illustrative of the principles and various embodiments of the present invention. Numerous variations and modifications will become apparent to those skilled in the art once the above disclosure is fully appreciated. For example, the directory states and encodings shown in Table 1, Table 2, and Table 3 may be extended to other encodings and directory states (e.g., a Shared 4 state, sharing with four sharers) in the preferred embodiment of the invention. It is intended that the following claims be interpreted to embrace all such variations and modifications.