Patent Application
20050114634
1. Field of the Invention
The present invention relates generally to processing pipelines in a pipeline processor, and more particularly, to methods and systems for more efficiently processing swap operations.
2. Description of the Related Art
Microprocessors have used pipelines to organize processing of multiple instructions simultaneously. A pipeline processor can begin executing a second instruction before the first (preceding) instruction has been completed. Similarly, several instructions can be held in the pipeline simultaneously, each instruction being at a different processing stage (e.g, read, write, compare, calculate, etc.).
The pipeline is typically divided into segments and each segment can execute its operation concurrently with the other segments. Typically, each when a segment completes an operation, it passes the result to the next segment in the pipeline and fetches the next operation from the preceding segment. The final results of each instruction emerge at the end of the pipeline in rapid succession.
The swap requests typically operate in an acceptable manner as long as the swap requests do not occur too often. However, multiple swap requests often occur immediately following one another. As a result, the pipeline can stall. By way of example, if a first swap request (i.e., swap A) is received, then a save A operation occurs, followed by a restore A operation, in the next clock cycle. A second swap request (swap B) is received immediately after the swap A request is received. However, two clock cycles are required to complete the save and restore operations required for the swap A request, therefore the swap B request must be delayed two clock cycles before the swap B request can be acted upon. As a result, the swap B request has a latency of 2 (two clock cycles between when swap B request was received and when restore B operation was completed). If a swap C request immediately followed the swap B request (i.e., during the third clock cycle), then the swap C request would have a latency of 4. Further, for n-subsequent swap requests, each swap request would have a n+1 latency factor. By way of example a tenth consecutive swap request (swap J) would have a latency of 11 (i.e., 11 clock cycles would pass between when the swap J request was received and when the restore J operation was completed). The latencies cause pipeline stalls where processing is delayed for that number of clock cycles.
In view of the foregoing, there is a need for a system and method for minimizing the number of stall cycles caused by multiple, subsequent swap requests.
Broadly speaking, the present invention fills these needs by providing an improved system and method for managing swap requests in a microprocessor pipeline. It should be appreciated that the present invention can be implemented in numerous ways, including as a process, an apparatus, a system, computer readable media, or a device. Several inventive embodiments of the present invention are described below.
One embodiment includes a method of processing multiple swap requests including receiving a first swap request in a pipeline and executing the first swap request. A second swap request is also received in the pipeline immediately following the first swap request. The first swap request and the second swap request are examined to determine if the first swap request and the second swap request swap a same register.
The second swap request can be executed if the first swap request and the second swap request do not swap the same register. The first swap request includes a first save operation and a first restore operation and the second swap request includes a second save operation and a second restore operation. Executing the second swap request if the first swap request and the second swap request do not swap the same register can include executing the first restore operation and the second save operation substantially simultaneously.
The method can also include delaying execution of the second swap request if the first swap request and the second swap request swap the same register and executing the second swap request. The execution of the second swap request can be delayed sufficient to allow the execution of the first swap request to be completed. The execution of the second swap request can be delayed a predetermined number of clock cycles such as one clock cycle.
The pipeline can include more than one processing thread. The same register can include the same register in a same processing thread. The determining if the first swap request and the second swap request swap the same register can occur as the second swap request is received.
Another embodiment includes a method for processing multiple, consecutive swap requests in a multithreaded microprocessor pipeline includes receiving a first swap request in a pipeline and executing the first swap request. A second swap request is received in the pipeline and the first swap request and the second swap request are examined to determine if the first swap request and the second swap request swap a same register in a same processing thread. The second swap request is executed if the first swap request and the second swap request do not swap the same register.
If the first swap request and the second swap request do swap the same register, then the execution of the second swap request is delayed at least one clock cycle and the second swap request is executed.
Another embodiment includes a pipeline architecture for a processing thread. The pipeline architecture includes multiple pipeline registers, at least one of the pipeline registers being capable of comparing a first swap request and a second swap request and multiple active registers.
The multiple pipeline registers includes at least eight pipeline registers. The at least eight pipeline registers are linked to one of the active registers. The multiple pipeline registers includes 32 pipeline registers. The pipeline architecture can also be one of at least two pipeline architectures in a single, multithreaded microprocessor.
Other aspects and advantages of the invention will become apparent from the following detailed description, taken in conjunction with the accompanying drawings, illustrating by way of example the principles of the invention.
The present invention will be readily understood by the following detailed description in conjunction with the accompanying drawings, and like reference numerals designate like structural elements.
Several exemplary embodiments for an improved system and method for managing swap requests in a microprocessor pipeline will now be described. It will be apparent to those skilled in the art that the present invention may be practiced without some or all of the specific details set forth herein.
As described above multiple subsequent swap requests can cause significant pipeline stalls. These pipeline stalls are processing times in which the processor is not processing and therefore directly impacts the processing throughput.
One embodiment substantially eliminates the wait time for all subsequent swap requests. Each swap request needs to be dispatched immediately. In order to dispatch each swap request immediately, an internal pipeline in the decoder is implemented to hold the dispatched request. Subsequent requests are served/dispatched immediately. To avoid conflict back-to-back swap requests cannot address the same register entry. In this manner, the simultaneous swap operation on different register entries. By way of example, while a restore operation is running on register (e.g., r<7>), a save operation is running on another register (e.g., r<8>).
One embodiment compares each subsequent swap request with the preceding swap request. If the subsequent swap request is not the same as the preceding swap request then the subsequent swap request is executed immediately. If the subsequent swap request is the same as the preceding swap request then the subsequent swap request is delayed until the preceding swap request has completed.
In one embodiment, to avoid a potentially lengthy n+1 stall cycles, a single stall cycle is automatically inserted after every swap request respectively. Inserting the single stall cycle after every swap request provides a more predictable delay but the end result of multiple, subsequent swap requests is approximately the same.
In an operation 265, a subsequent swap request (swap B) is received at time T1, at the beginning of the second clock cycle, substantially simultaneously as the restore A is being executed. In an operation 270, the subsequent swap request (swap B) is compared to the first swap request (swap A). The subsequent swap request can be compared to the first swap request as the subsequent swap request is received in operation 265 above.
If in operation 270, the subsequent swap request is not swapping the same register as the first swap request, then the method operations continue in operation 275. If in operation 270, the subsequent swap request is swapping the same register as the first swap request, then the method operations continue in operation 280.
In an operation 275, the subsequent swap request is executed at a time T1. When the second swap request 122 is executed, the save B operation is executed during the second clock cycle and the restore B is executed during the third clock cycle (i.e., between time T2 and time T1). As a result, the save B is executed substantially simultaneously as the restore A is executed. The method operations then end.
In an operation 280, a delay is inserted because both of the first swap and the second swap are attempting to swap the same register (e.g., i<5>). By way of example, a one clock cycle delay is inserted so that the subsequent swap is executed after the first swap instruction is completed such as when swap C 124 is executed as shown in
In one embodiment, the multiple registers include at least eight registers (e.g., 32) or even more. The multiple registers are divided into subsets (e.g. 4 subsets of 8 registers for a total of 32 registers). Each of the subsets of registers are linked to one of the active registers. The processing that occurs is applied to the contents of the active register. The pipeline 306 can also be one thread (e.g., thread(2)) of a single multithreaded 302, 304, 306, 308 microprocessor 300. It should be understood that less or more than 32 registers can also be used.
With the above embodiments in mind, it should be understood that the invention may employ various computer-implemented operations involving data stored in computer systems. These operations are those requiring physical manipulation of physical quantities. Usually, though not necessarily, these quantities take the form of electrical or magnetic signals capable of being stored, transferred, combined, compared, and otherwise manipulated. Further, the manipulations performed are often referred to in terms, such as producing, identifying, determining, or comparing.
Any of the operations described herein that form part of the invention are useful machine operations. The invention also relates to a device or an apparatus for performing these operations. The apparatus may be specially constructed for the required purposes, or it may be a general-purpose computer selectively activated or configured by a computer program stored in the computer. In particular, various general-purpose machines may be used with computer programs written in accordance with the teachings herein, or it may be more convenient to construct a more specialized apparatus to perform the required operations.
The invention can also be embodied as computer readable code on a computer readable medium. The computer readable medium is any data storage device that can store data which can thereafter be read by a computer system. Examples of the computer readable medium include hard drives, network attached storage (NAS), read-only memory, random-access memory, CD-ROMs, CD-Rs, CD-RWs, magnetic tapes, and other optical and non-optical data storage devices. The computer readable medium can also be distributed over a network coupled computer systems so that the computer readable code is stored and executed in a distributed fashion.
It will be further appreciated that the instructions represented by the operations in
Although the foregoing invention has been described in some detail for purposes of clarity of understanding, it will be apparent that certain changes and modifications may be practiced within the scope of the appended claims. Accordingly, the present embodiments are to be considered as illustrative and not restrictive, and the invention is not to be limited to the details given herein, but may be modified within the scope and equivalents of the appended claims.
