Patent Grant
9632825
Embodiments according to the present invention generally relate to microprocessor architecture and more particularly to the architecture for out-of-order microprocessors.
In an Out-Of-Order (“OOO”) microprocessor, instructions are allowed to issue and execute out of their program order. The scheduler of an OOO microprocessor selects and dispatches ready instructions out of order into execution units. Certain microprocessor architectures have two types of instructions, A and E. Examples of A-type instruction are integer operations such as add and subtract while examples of E-type instructions are floating point operations such as floating point add, floating point subtract, and floating point multiply. However, it should be noted that A and E-type of instructions are not solely limited to the above examples.
Conventional architectures that support two types of instructions, however, do not have execution units that can support both types of instructions. For example, a conventional processor will typically have an exclusive execution unit for executing A-type instructions and an exclusive unit for processing E-type instructions, wherein both types of execution units would be mutually exclusive from each other.
The objective of the scheduler in such an architecture is typically to optimize the dispatch throughput given the non-uniform instruction type and the asymmetric execution units. Further, another objective of the scheduler is to prioritize older instructions over younger ones. And finally, the last objective is to maintain competitive latency in performing the scheduling procedure.
Conventional architectures are limited because they do not successfully accomplish all the aforementioned objectives. For example, as mentioned above, conventional architectures may adopt a primitive policy of selecting A-type instructions for execution in only A-type execution units and picking E-type instructions for execution in only E-type execution units. This allows execution to be conducted in parallel for better latency, but if there are not enough instruction blocks for the specific execution unit types, it will result in unused execution unit ports and less overall dispatch throughput.
For example, if there are 5 A-type instructions and 3 E-type instructions in an architecture with 4 A-type execution units and 4 E-type execution units, at least one of the E-type execution units will be idle because A-type instructions cannot be executed in E-type execution units. Another problem with this scheme is that it is age optimized only within the individual category (A or E) and not optimized for overall age prioritization. In the example above, for instance, only 7 instructions would be dispatched. The fifth A-type instruction would have to wait for the next cycle. As a result, conventional architectures are limited and not designed to accomplish all the aforementioned desired objectives of the scheduler.
Accordingly, a need exists for a method and apparatus wherein an execution unit can execute multiple types of instructions, e.g., both A and E-types of instructions. Further, a need exists for a method and apparatus for more efficient scheduling for asymmetrical execution units, which optimizes dispatch throughput, prioritizes older instruction blocks over younger ones, and maintains a competitive latency.
Embodiments of the present invention support asymmetric execution unit types, A and E, wherein an A-type execution unit can support only A-type instructions, but an E-type execution unit can support both A and E-types of instructions. Accordingly, A-type instructions can be executed in both A and E units, but E instructions can only be executed in E units. Accordingly, A-type execution units can be a subset of E-type execution units.
In one embodiment, in order to perform scheduling for asymmetric execution units, the scheduler fills up the A execution unit ports first and then fills up the E execution unit ports with all the other instruction blocks that are not selected by the A execution units. In one embodiment, the scheduler comprises “Find-8” and “Find-4” logic circuitry. The Find-8 circuitry searches the dispatch range in the scheduler for the first eight oldest instructions that meet the select criteria. The Find-4 circuitry, meanwhile, is employed in parallel with the Find-8 circuitry for searching for the first four oldest A-type instructions blocks. The results of the Find-4 circuitry is used to schedule the A-type execution units. Of the remaining instructions that were not already selected by the Find-4 circuitry, the oldest four are then scheduled for the E-type execution units. For example, if the Find-8 circuitry selects 3 A and 5 E-type instructions and the Find-4 circuitry selects the 3 A-type instructions (the same 3 A-type instructions selected by the Find-8 logic), then the 3 A-type instructions are scheduled for the A ports while the oldest 4 of the remaining 5 E-type instructions can be scheduled for the E ports. The present invention is not restricted to this embodiment, however. If, for example, a scheduler can dispatch 16 instructions in a cycle, then “Find-16” and Find-8” logic circuitry would be employed in parallel, and so forth.
Accordingly, embodiments of the present invention have the advantage of high dispatch efficiency because they will try to fill up both A-type and E-type ports. Additionally, embodiments of the present invention have better overall age prioritization between both types of blocks. Finally, because the Find-8 and Find-4 circuitry are employed in parallel, embodiments of the present invention also maintains competitive latency in performing the scheduling procedure.
In one embodiment, a method for performing instruction scheduling in an out-of-order microprocessor pipeline is disclosed. The method comprises selecting a first set of instructions to dispatch from a scheduler, wherein the scheduler is operable to dispatch two types of instructions, and wherein the execution module comprises two types of execution units. The first type of execution unit executes both a first type of instruction and a second type of instruction and the second type of execution unit executes only the second type of instruction. The method also comprises selecting a second set of instructions to dispatch, wherein the second set is a subset of the first set, and wherein the second set comprises only instructions of the second type. Next, the method comprises determining a third set of instructions, wherein the third set of instructions is a subset of the first set of instructions, and wherein the third set comprises instructions not selected as part of the second set. Finally, the method comprises dispatching the second set of instructions to the execution module for execution using the second type of execution unit and further dispatching the third set of instructions to the execution module for execution using the first type of execution unit.
In another embodiment, a processor unit configured to perform a method for scheduling instructions in an out-of-order microprocessor pipeline is disclosed. The method comprises selecting a first set of instructions to dispatch from a scheduler, wherein the scheduler is operable to dispatch two types of instructions, and wherein the execution module comprises two types of execution units. The first type of execution unit executes both a first type of instruction and a second type of instruction and the second type of execution unit executes only the second type of instruction. The method also comprises selecting a second set of instructions to dispatch, wherein the second set is a subset of the first set, and wherein the second set comprises only instructions of the second type. Next, the method comprises determining a third set of instructions, wherein the third set of instructions is a subset of the first set of instructions, and wherein the third set comprises instructions not selected as part of the second set. Finally, the method comprises dispatching the second set of instructions to the execution module for execution using the second type of execution unit and further dispatching the third set of instructions to the execution module for execution using the first type of execution unit.
In a different embodiment, an apparatus configured to perform a method for scheduling instructions in an out-of-order microprocessor pipeline is disclosed. The apparatus comprises a memory, a processor communicatively coupled to the memory, wherein the processor is configured to process instructions out of order. The processor is further configured to: (a) select a first set of instructions to dispatch from a scheduler to an execution module, wherein the scheduler is operable to dispatch two types of instructions, wherein the execution module comprises two types of execution units, wherein a first type of execution unit executes both a first type of instruction and a second type of instruction and wherein a second type of execution unit executes only the second type of instruction; (b) select a second set of instructions to dispatch from the scheduler, wherein the second set is a subset of the first set, and wherein the second set comprises only instructions of the second type; (c) determine a third set of instructions, wherein the third set of instructions is a subset of the first set of instructions, and wherein the third set comprises instructions not selected as part of the second set; and (d) dispatch the second set of instructions to the execution module for execution using the second type of execution unit and further dispatching the third set of instructions to the execution module for execution using the first type of execution unit.
The following detailed description together with the accompanying drawings will provide a better understanding of the nature and advantages of the present invention.
Embodiments of the present invention are illustrated by way of example, and not by way of limitation, in the figures of the accompanying drawings and in which like reference numerals refer to similar elements.
Reference will now be made in detail to the various embodiments of the present disclosure, examples of which are illustrated in the accompanying drawings. While described in conjunction with these embodiments, it will be understood that they are not intended to limit the disclosure to these embodiments. On the contrary, the disclosure is intended to cover alternatives, modifications and equivalents, which may be included within the spirit and scope of the disclosure as defined by the appended claims. Furthermore, in the following detailed description of the present disclosure, numerous specific details are set forth in order to provide a thorough understanding of the present disclosure. However, it will be understood that the present disclosure may be practiced without these specific details. In other instances, well-known methods, procedures, components, and circuits have not been described in detail so as not to unnecessarily obscure aspects of the present disclosure.
Notation and Nomenclature
Some portions of the detailed descriptions that follow are presented in terms of procedures, logic blocks, processing, and other symbolic representations of operations on data bits within a computer memory. These descriptions and representations are the means used by those skilled in the data processing arts to most effectively convey the substance of their work to others skilled in the art. In the present application, a procedure, logic block, process, or the like, is conceived to be a self-consistent sequence of steps or instructions leading to a desired result. The steps are those utilizing physical manipulations of physical quantities. Usually, although not necessarily, these quantities take the form of electrical or magnetic signals capable of being stored, transferred, combined, compared, and otherwise manipulated in a computer system. It has proven convenient at times, principally for reasons of common usage, to refer to these signals as transactions, bits, values, elements, symbols, characters, samples, pixels, or the like.
It should be borne in mind, however, that all of these and similar terms are to be associated with the appropriate physical quantities and are merely convenient labels applied to these quantities. Unless specifically stated otherwise as apparent from the following discussions, it is appreciated that throughout the present disclosure, discussions utilizing terms such as “selecting,” “dispatching,” determining,” “storing,” “issuing,” “determining,” “validating” or the like, refer to actions and processes (e.g., flowchart 600 of
Embodiments described herein may be discussed in the general context of computer-executable instructions residing on some form of computer-readable storage medium, such as program modules, executed by one or more computers or other devices. By way of example, and not limitation, computer-readable storage media may comprise non-transitory computer-readable storage media and communication media; non-transitory computer-readable media include all computer-readable media except for a transitory, propagating signal. Generally, program modules include routines, programs, objects, components, data structures, etc., that perform particular tasks or implement particular abstract data types. The functionality of the program modules may be combined or distributed as desired in various embodiments.
Computer storage media includes volatile and nonvolatile, removable and non-removable media implemented in any method or technology for storage of information such as computer-readable instructions, data structures, program modules or other data. Computer storage media includes, but is not limited to, random access memory (RAM), read only memory (ROM), electrically erasable programmable ROM (EEPROM), flash memory or other memory technology, compact disk ROM (CD-ROM), digital versatile disks (DVDs) or other optical storage, magnetic cassettes, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other medium that can be used to store the desired information and that can accessed to retrieve that information.
Communication media can embody computer-executable instructions, data structures, and program modules, and includes any information delivery media. By way of example, and not limitation, communication media includes wired media such as a wired network or direct-wired connection, and wireless media such as acoustic, radio frequency (RF), infrared, and other wireless media. Combinations of any of the above can also be included within the scope of computer-readable media.
Processor 114 incorporates embodiments of the present invention and generally represents any type or form of processing unit capable of processing data or interpreting and executing instructions. In certain embodiments, processor 114 may receive instructions from a software application or module. These instructions may cause processor 114 to perform the functions of one or more of the example embodiments described and/or illustrated herein. In one embodiment, processor 114 may be an out of order microprocessor. In a different embodiment, processor 114 may be a superscalar processor. In yet another embodiment, processor 114 may comprise multiple processors operating in parallel.
System memory 116 generally represents any type or form of volatile or non-volatile storage device or medium capable of storing data and/or other computer-readable instructions. Examples of system memory 116 include, without limitation, RAM, ROM, flash memory, or any other suitable memory device. Although not required, in certain embodiments computing system 110 may include both a volatile memory unit (such as, for example, system memory 116) and a non-volatile storage device (such as, for example, primary storage device 132).
Computing system 110 may also include one or more components or elements in addition to processor 114 and system memory 116. For example, in the embodiment of
Memory controller 118 generally represents any type or form of device capable of handling memory or data or controlling communication between one or more components of computing system 110. For example, memory controller 118 may control communication between processor 114, system memory 116, and I/O controller 120 via communication infrastructure 112.
I/O controller 120 generally represents any type or form of module capable of coordinating and/or controlling the input and output functions of a computing device. For example, I/O controller 120 may control or facilitate transfer of data between one or more elements of computing system 110, such as processor 114, system memory 116, communication interface 122, display adapter 126, input interface 130, and storage interface 134.
Communication interface 122 broadly represents any type or form of communication device or adapter capable of facilitating communication between example computing system 110 and one or more additional devices. For example, communication interface 122 may facilitate communication between computing system 110 and a private or public network including additional computing systems. Examples of communication interface 122 include, without limitation, a wired network interface (such as a network interface card), a wireless network interface (such as a wireless network interface card), a modem, and any other suitable interface. In one embodiment, communication interface 122 provides a direct connection to a remote server via a direct link to a network, such as the Internet. Communication interface 122 may also indirectly provide such a connection through any other suitable connection.
Communication interface 122 may also represent a host adapter configured to facilitate communication between computing system 110 and one or more additional network or storage devices via an external bus or communications channel. Examples of host adapters include, without limitation, Small Computer System Interface (SCSI) host adapters, Universal Serial Bus (USB) host adapters, IEEE (Institute of Electrical and Electronics Engineers) 1394 host adapters, Serial Advanced Technology Attachment (SATA) and External SATA (eSATA) host adapters, Advanced Technology Attachment (ATA) and Parallel ATA (PATA) host adapters, Fibre Channel interface adapters, Ethernet adapters, or the like. Communication interface 122 may also allow computing system 110 to engage in distributed or remote computing. For example, communication interface 122 may receive instructions from a remote device or send instructions to a remote device for execution.
As illustrated in
As illustrated in
As illustrated in
In one example, databases 140 may be stored in primary storage device 132. Databases 140 may represent portions of a single database or computing device or it may represent multiple databases or computing devices. For example, databases 140 may represent (be stored on) a portion of computing system 110. Alternatively, databases 140 may represent (be stored on) one or more physically separate devices capable of being accessed by a computing device, such as computing system 110.
Continuing with reference to
Many other devices or subsystems may be connected to computing system 110. Conversely, all of the components and devices illustrated in
The computer-readable medium containing the computer program may be loaded into computing system 110. All or a portion of the computer program stored on the computer-readable medium may then be stored in system memory 116 and/or various portions of storage devices 132 and 133. When executed by processor 114, a computer program loaded into computing system 110 may cause processor 114 to perform and/or be a means for performing the functions of the example embodiments described and/or illustrated herein. Additionally or alternatively, the example embodiments described and/or illustrated herein may be implemented in firmware and/or hardware.
Method and Apparatus for Efficient Scheduling for Asymmetrical Execution Units
Embodiments of the present invention provide a method and apparatus wherein an execution unit can execute multiple types of instructions, e.g., both A and E-types of instructions. Further, embodiments of the present invention provide more efficient scheduling for asymmetrical execution units, which optimizes dispatch throughput, prioritizes older instruction blocks over younger ones, and maintains a competitive latency.
Embodiments of the present invention support asymmetric execution unit types, A and E, wherein an A-type execution unit can support only A-type instructions, but an E-type execution unit can support both A and E-types of instructions. Accordingly, A-type instructions can be executed in both A and E units, but E instructions can only be executed in E units. A-type execution units can, therefore, be considered a subset of E-type execution units.
In one embodiment, the scheduler fills up the A execution unit ports first and then fills up the E execution unit ports with all the other instruction blocks that are not selected by the A execution units. In one embodiment, the scheduler comprises “Find-8” and “Find-4” logic circuitry. The Find-8 circuitry searches the dispatch range in the scheduler for the first eight oldest instructions that meet the select criteria. The Find-4 circuitry, meanwhile, is employed in parallel with the Find-8 circuitry for searching for the first four oldest A-type instructions blocks. The results of the Find-4 circuitry is used to schedule the A-type execution units. Of the remaining instructions that were not already selected by the Find-4 circuitry, the oldest four are then scheduled for the E-type execution units. For example, if the Find-8 circuitry selects 3 A and 5 E-type instructions and the Find-4 circuitry picks the 3 A-type instructions (also selected by the Find-8 logic), then the 3 A-type instructions are scheduled for the A ports while the oldest 4 of the remaining 5 E-type instructions are scheduled for the E ports. The present invention is not restricted to this embodiment, however. If, for example, a scheduler can dispatch 16 instructions in a cycle, then “Find-16” and Find-8″ logic circuitry would be employed in parallel, and so forth.
Accordingly, embodiments of the present invention have the advantage of high dispatch efficiency because they will try to fill up both A-type and E-type ports. Additionally, embodiments of the present invention have better overall age prioritization between both types of blocks. Finally, because the Find-8 and Find-4 circuitry are employed in parallel, embodiments of the present invention also maintains competitive latency in performing the scheduling procedure.
As mentioned above, examples of A-type instruction are integer operations such as add and subtract operations while examples of E-type instructions are floating point operations such as floating point add, floating point subtract, and floating point multiply. Accordingly, E-type execution units can be altered slightly, in accordance with embodiments of the present invention, to support A-type instructions. Doing so makes the E-type execution units slightly more logically complex, however, the penalty paid is minimal and is outweighed by the benefits gained in terms of flexibility and latency.
As illustrated in
As discussed above, in one embodiment of the present invention, the execute module 312 comprises asymmetrical execution units, A and E, wherein an A-type execution unit can support only A-type instructions, but an E-type execution unit can support both A and E-types of instructions. Accordingly, A-type instructions can be executed in both A and E units, but E instructions can only be executed in E units. Accordingly, A-type execution units can be a subset of E-type execution units.
The write back module 314, in one embodiment, can write the resulting values from those instructions back to the temporary registers in ROB 308 first. The ROB 308 keeps track of the program order in which instructions entered the pipeline and for each of these instructions, the ROB maintains temporary register storage in physical register file 380. The physical register file, in one embodiment of the present invention, is allocated dynamically as instructions are dispatched from the scheduler. Because the physical register file is allocated as the instructions are dispatched, it is not in age order. The physical register file stores out of order entries and waits for them to be retired in order to the architectural register file 310.
When the oldest instructions in the ROB produce a valid result, those instructions can be safely committed. That is, the results of those instructions can be made permanent since there is no earlier instruction that can raise a mispredict or exception that may undo the effect of those instructions. When instructions are ready to be committed, the ROB 308 will move the corresponding values in the temporary registers for those instructions to the architectural register file 310. Therefore, through the ROB's in-order commit process, the results in the register file 310 are made permanent and architecturally visible.
The instructions issued out of order from the IQ 306 may also comprise loads and stores. When loads and stores are issued out of order from the IQ 306, there are memory dependencies between them that need to be resolved before those instructions can be committed. Accordingly, the load and stores instructions are stored in a Load Store Queue (LSQ) 316 while the dependencies between them are resolved with the help of ROB 308 before their resulting values can be committed to memory 318.
There are several ways to schedule instructions for asymmetric execution units. One way, discussed above, is to pick A-type instructions for A-type execution units and E-type instructions for E-type execution units. The deficiencies of this type of primitive scheduling scheme were previously discussed.
Another way to schedule instructions would be to select E-type instructions first to fill up the E-type execution units and if there are not enough E-type instruction blocks, select more A-type instruction blocks to fill up the E units and then the A units. The first problem with this scheme is that the two step procedure has to be performed in a serial manner, which means it is not latency friendly. Secondly, this procedure does not have overall age prioritization. For example, in certain cases this procedure would pick younger E instructions to fill up the E execution units over older A instructions.
Finally, a third way to schedule instructions would be to (a) fill up the A execution ports first and, subsequently, (b) fill up the E ports with all the other instruction blocks that were not picked by the earlier step. In other words, this procedure would give priority to the first A-type instruction blocks, e.g., in a scheduler dispatching 8 instructions per cycle and comprising 4 A-type execution units, it would give priority to the first 4 A-type instruction blocks. Because the E execution units can take either A or E-types of instructions, they can be filled after attempting to fill the A-type execution units.
This procedure has high efficiency because it will try to fill up both types of execution ports, A and E. It performs well in terms of overall age prioritization between both types of blocks. Although, it may appear that it is giving A-type blocks too much priority when the A-type blocks are younger than the E-type blocks, however, this is not the case. For example, in a scheduler that can dispatch 8 instructions in a cycle and comprises 4 A-type and 4 E-type execution units, only up to 4 of the E-type instruction blocks can be selected. As a result, it is irrelevant whether the fifth E-type block or beyond have older ages over the A-type blocks. They simply cannot be picked. In other words, since only 4 E-type instructions can be picked in any given cycle, it does not affect the overall age prioritization if the procedure fills up the A execution ports first.
In order to maximize the dispatch opportunity, embodiments of the present invention are, therefore, configured to schedule the A ports first and then the E ports in accordance with the third way detailed above. However, one drawback of this procedure is that it is not timing friendly because of the two-step implementation. This is a problem because the dispatch search logic is latency critical in a higher performance processor. In order to address this issue, embodiments of the present invention parallelize certain steps in the procedure as will be discussed below.
The Find-8 structure 404 searches through the dispatch range in the scheduler for 8 candidates. The criterion used is the ready-bit of the instruction candidates. If the ready bit is set, the instruction is ready to be dispatched. Masking out the E-type instructions, Find-4 structure 406 searches through the dispatch range for 4 A-type blocks. This is performed in parallel with the Find-8 operation. The Find-4 logic is similar to the Find-8 logic, except for the additional criterion that it searches only for the A-type instruction blocks. Both Find-8 and Find-4 logic structures search for the highest priority blocks in the dispatch range. In one embodiment, the logic structures use the Re-Order Buffer ID (ROB IB) of the instructions to determine priority. In another embodiment, an index number may be assigned to each entry in the scheduler that can be used to determine priority as well.
The result from the Find-4 module 406, which masks out the E-type instructions and selects only the A-type instructions, are transmitted over to the A-type execution units 410 in Execute Module 474. In other words, the Find-4 module 406 masks out the E-type instructions and searches through the dispatch range for 4 A-type blocks. Meanwhile, the Find-8 module 404 selects the oldest 8 instructions, both A and E-types, in parallel with the Find-4 module 406. The results from the Find-4 structure 406 are then used by the Find-8 module 404 to dispatch the oldest of the remaining instructions, which were not selected by the Find-4 structure 406, to the E-type execution units 408. In other words, the instructions selected by the Find-4 structure 406 are masked out of the instructions selected by the Find-8 module 404 and the oldest 4 of the remaining instructions are dispatched to the E-type execution units 408. The net effect of this procedure then is to prioritize an older A-type block over an E-type block.
For example, the Find-8 module 404 may select 5 A-type instructions and 3 E-type instructions that it determines to be the highest priority instruction. The Find-4 module 406 in this instance would pick the oldest 4 of the 5 A-type instructions to be dispatched to the A-type execution units 410. Those 4 oldest A instructions will then be masked out from the set of instructions selected by the Find-8 module 404. The remaining 3 E-type instructions and the 1 youngest A-type instruction will then be dispatched to the E-type execution units 408.
By way of another example, the Find-8 module 404 may select 3 A-type instructions and 5 E-type instructions that it determines to be the highest priority instruction. The Find-4 module 406 in this instance would pick the 3 A-type instructions to be dispatched to the A-type execution units 410. Those 3 A instructions will then be masked out from the set of instructions selected by the Find-8 module 404. Of the remaining 5 E-type instructions selected by the Find-8 module, the oldest 4 E-type instructions will be selected to be dispatched to the E-type execution units 408.
In one embodiment, the index number or ROB ID used to prioritize instructions in the scheduler is also used to calculate port numbers for the execution units used to execute the instructions within Execute module 474.
Parallelizing the operations using a Find-4 module in conjunction with a Find-8 module results in considerable time saving. As mentioned before, basic dispatch search logic is latency critical in a high performance processor. For example, if the filling up of the A execution ports followed by the filling up of the E execution ports was serialized, each operation may take up 1 ns, resulting in dispatch search logic that takes 2 ns. By parallelizing the Find-8 operation which, for example, may take 1.2 ns with the Find-4 operation, which may take 1 ns, an embodiment of the present invention may save 0.8 ns during dispatch in each cycle, which is significant from a processor design perspective. Further, the amount of time the masking operation to separate the results of the Find-4 structure from the results of the Find-8 structure takes is not significant compared to the latency of the Find-4 or Find-8 operations themselves.
The instructions 572 through to 599 are in order of priority based on their ROB ID number or any another index number maintained to order and prioritize the instructions. The Find-8 module searches for the 8 most high priority (or oldest) instructions that have their ready bit set. Accordingly, the Find-8 module selects instructions 572, 574, 576, 578, 580, 588, 590 and 592, as indicated by a count value of 0 to 7 respectively in the table of
As mentioned above, Find-4 logic searches through the dispatch range for A-type blocks and saturates the count if more than 4 are found. As shown in column 3 of the table in
As shown in Column 4 of the table in
Further, as shown in Column 5, a mask is used for E-type instructions—the mask also picks up A-type instructions that were not selected by the Find-4 module. This mask is employed by the Find-8 module to determine the instructions it should dispatch to the E execution units. Accordingly, the instructions masked by this mask are 3 E-type instructions in the 0 to 7 count range, 576, 578 and 588, and a single A-type instruction 592, which was not selected by the Find-4 module because it had already saturated.
At step 602, a first set of instructions are selected to be dispatched from the scheduler 472 to an execute module 474. In one embodiment, a Find-8 structure 404 can select up to 8 high priority instructions to be dispatched at a time from the scheduler. As discussed above, the scheduler is operable to dispatch two types of instructions, A and E. The execution module comprises two types of execution units also, wherein A-type execution units can only execute A-type instructions while E-type execution units can execute both A and E-type of instructions.
At step 604, another find and select module, e.g., a Find-4 module 406 can be configured to select a second set of instructions to dispatch from the scheduler. The second set of instructions is a subset of the first set of instructions, e.g., the Find-4 module selects 4 instructions, which are a subset of the 8 instructions selected by the Find-8 module. However, the second subset comprises solely of one type of instruction, e.g., the A-type of instruction.
At step 606, a third set of instructions is determined which comprises instructions in the first set of instructions that were not picked by the second set of instructions.
At step 608, the second set of instructions is dispatched for execution using the second type of execution unit. For example, the Find-4 structure dispatches the A-type of instructions for execution in the A-type of execution units. And, finally, at step 610, the third set of instructions is dispatched to the execution module for execution in the first type of execution unit. For example, the Find-8 module dispatches instructions not picked by the Find-4 module for execution in the E-type of execution units.
While the foregoing disclosure sets forth various embodiments using specific block diagrams, flowcharts, and examples, each block diagram component, flowchart step, operation, and/or component described and/or illustrated herein may be implemented, individually and/or collectively, using a wide range of hardware, software, or firmware (or any combination thereof) configurations. In addition, any disclosure of components contained within other components should be considered as examples because many other architectures can be implemented to achieve the same functionality.
The process parameters and sequence of steps described and/or illustrated herein are given by way of example only. For example, while the steps illustrated and/or described herein may be shown or discussed in a particular order, these steps do not necessarily need to be performed in the order illustrated or discussed. The various example methods described and/or illustrated herein may also omit one or more of the steps described or illustrated herein or include additional steps in addition to those disclosed.
While various embodiments have been described and/or illustrated herein in the context of fully functional computing systems, one or more of these example embodiments may be distributed as a program product in a variety of forms, regardless of the particular type of computer-readable media used to actually carry out the distribution. The embodiments disclosed herein may also be implemented using software modules that perform certain tasks. These software modules may include script, batch, or other executable files that may be stored on a computer-readable storage medium or in a computing system. These software modules may configure a computing system to perform one or more of the example embodiments disclosed herein.
The foregoing description, for purpose of explanation, has been described with reference to specific embodiments. However, the illustrative discussions above are not intended to be exhaustive or to limit the invention to the precise forms disclosed. Many modifications and variations are possible in view of the above teachings. The embodiments were chosen and described in order to best explain the principles of the invention and its practical applications, to thereby enable others skilled in the art to best utilize the invention and various embodiments with various modifications as may be suited to the particular use contemplated.
Embodiments according to the invention are thus described. While the present disclosure has been described in particular embodiments, it should be appreciated that the invention should not be construed as limited by such embodiments, but rather construed according to the below claims.
This application is a conversion of and claims priority to and the benefit of Provisional Patent Application No. 61/799,062, entitled “METHOD AND APPARATUS FOR EFFICIENT SCHEDULING FOR ASYMMETRICAL EXECUTION UNITS,” having a filing Date of Mar. 15, 2013, which is herein incorporated by reference in its entirety.
| Number | Name | Date | Kind |
|---|---|---|---|
| 4727487 | Masui | Feb 1988 | A |
| 5404470 | Miyake | Apr 1995 | A |
| 5724565 | Dubey et al. | Mar 1998 | A |
| 5751982 | Morley | May 1998 | A |
| 5761476 | Martell | Jun 1998 | A |
| 5819088 | Reinders | Oct 1998 | A |
| 5911057 | Shiell | Jun 1999 | A |
| 6216215 | Palanca et al. | Apr 2001 | B1 |
| 6308323 | Douniwa | Oct 2001 | B1 |
| 6345357 | Sato | Feb 2002 | B1 |
| 6490673 | Heishi et al. | Dec 2002 | B1 |
| 6529928 | Resnick | Mar 2003 | B1 |
| 6557095 | Henstrom | Apr 2003 | B1 |
| 6668316 | Gorshtein | Dec 2003 | B1 |
| 6704860 | Moore | Mar 2004 | B1 |
| 6948172 | D'Souza et al. | Sep 2005 | B1 |
| 7020879 | Nemirovsky | Mar 2006 | B1 |
| 7707578 | Zedlewski | Apr 2010 | B1 |
| 7757065 | Jourdan et al. | Jul 2010 | B1 |
| 8044951 | Brown | Oct 2011 | B1 |
| 8046775 | Kang | Oct 2011 | B2 |
| 8145882 | Kishore et al. | Mar 2012 | B1 |
| 8200949 | Tarjan et al. | Jun 2012 | B1 |
| 8539486 | Cain | Sep 2013 | B2 |
| 20020029308 | Babaian et al. | Mar 2002 | A1 |
| 20020062435 | Nemirovsky | May 2002 | A1 |
| 20030093776 | Hilton | May 2003 | A1 |
| 20030233394 | Rudd | Dec 2003 | A1 |
| 20040078538 | Dutt et al. | Apr 2004 | A1 |
| 20040098567 | Hansen | May 2004 | A1 |
| 20040158822 | Sandham et al. | Aug 2004 | A1 |
| 20040187123 | Tremblay | Sep 2004 | A1 |
| 20050114603 | Buti et al. | May 2005 | A1 |
| 20050120194 | Kissell | Jun 2005 | A1 |
| 20050289530 | Robison | Dec 2005 | A1 |
| 20060161921 | Kissell | Jul 2006 | A1 |
| 20060179257 | Chu | Aug 2006 | A1 |
| 20060179281 | Jensen et al. | Aug 2006 | A1 |
| 20060212687 | Chen | Sep 2006 | A1 |
| 20060230243 | Cochran et al. | Oct 2006 | A1 |
| 20060230409 | Frigo | Oct 2006 | A1 |
| 20060282839 | Hankins et al. | Dec 2006 | A1 |
| 20070006231 | Wang et al. | Jan 2007 | A1 |
| 20070198665 | De Matteis et al. | Aug 2007 | A1 |
| 20080016507 | Thomas et al. | Jan 2008 | A1 |
| 20080104598 | Chang | May 2008 | A1 |
| 20080148237 | Jiang et al. | Jun 2008 | A1 |
| 20080250227 | Linderman | Oct 2008 | A1 |
| 20080320476 | Wingard | Dec 2008 | A1 |
| 20090019264 | Correale, Jr. et al. | Jan 2009 | A1 |
| 20090113170 | Abdallah | Apr 2009 | A1 |
| 20090138670 | Mutlu et al. | May 2009 | A1 |
| 20090150647 | Mejdrich et al. | Jun 2009 | A1 |
| 20090165007 | Aghajanyan | Jun 2009 | A1 |
| 20090282101 | Lim | Nov 2009 | A1 |
| 20090307450 | Lee | Dec 2009 | A1 |
| 20090328053 | Dice | Dec 2009 | A1 |
| 20100100690 | Rajamani | Apr 2010 | A1 |
| 20100115244 | Jensen et al. | May 2010 | A1 |
| 20100154042 | Miyamoto | Jun 2010 | A1 |
| 20100161948 | Abdallah | Jun 2010 | A1 |
| 20100205603 | Merten et al. | Aug 2010 | A1 |
| 20100280996 | Gross, IV et al. | Nov 2010 | A1 |
| 20100286976 | Gao et al. | Nov 2010 | A1 |
| 20100299671 | Kinsey | Nov 2010 | A1 |
| 20100306503 | Henry | Dec 2010 | A1 |
| 20100325394 | Golla et al. | Dec 2010 | A1 |
| 20110055479 | West | Mar 2011 | A1 |
| 20110067016 | Mizrachi et al. | Mar 2011 | A1 |
| 20110093857 | Sydow | Apr 2011 | A1 |
| 20120023318 | Xing et al. | Jan 2012 | A1 |
| 20120066483 | Boury | Mar 2012 | A1 |
| 20120089812 | Smith | Apr 2012 | A1 |
| 20120246450 | Abdallah | Sep 2012 | A1 |
| 20130036296 | Hickey | Feb 2013 | A1 |
| 20130283286 | Lee | Oct 2013 | A1 |
| 20140181833 | Bird | Jun 2014 | A1 |
| 20140281411 | Abdallah | Sep 2014 | A1 |
| 20140281412 | Abdallah | Sep 2014 | A1 |
| 20140281416 | Abdallah | Sep 2014 | A1 |
| 20140281426 | Abdallah | Sep 2014 | A1 |
| 20140281427 | Abdallah | Sep 2014 | A1 |
| 20140281428 | Abdallah | Sep 2014 | A1 |
| 20140281436 | Abdallah | Sep 2014 | A1 |
| 20140282592 | Abdallah | Sep 2014 | A1 |
| 20140282601 | Abdallah | Sep 2014 | A1 |
| 20140317387 | Abdallah | Oct 2014 | A1 |
| 20150046683 | Abdallah | Feb 2015 | A1 |
| 20150046686 | Abdallah | Feb 2015 | A1 |
| Number | Date | Country |
|---|---|---|
| 1841314 | Oct 2006 | CN |
| 544626 | Aug 2003 | TW |
| 200422949 | Nov 2004 | TW |
| 200813766 | Mar 2008 | TW |
| 200949690 | Dec 2009 | TW |
| I329437 | Aug 2010 | TW |
| I331282 | Oct 2010 | TW |
| I352288 | Nov 2011 | TW |
| 201227520 | Jul 2012 | TW |
| 201241744 | Oct 2012 | TW |
| 201305819 | Feb 2013 | TW |
| 2010049585 | May 2010 | WO |
| Entry |
|---|
| Mogul et al; ““Potential benefits of delta encoding and data compression for HTTP””; Oct. 1, 1997; ACM; SIGCOMM 97; pp. 181-194. |
| Number | Date | Country | |
|---|---|---|---|
| 20140373022 A1 | Dec 2014 | US |
| Number | Date | Country | |
|---|---|---|---|
| 61799062 | Mar 2013 | US |
