The field of the invention is data processing, or, more specifically, methods and apparatus for operation of a multi-slice processor.
The development of the EDVAC computer system of 1948 is often cited as the beginning of the computer era. Since that time, computer systems have evolved into extremely complicated devices. Today's computers are much more sophisticated than early systems such as the EDVAC. Computer systems typically include a combination of hardware and software components, application programs, operating systems, processors, buses, memory, input/output devices, and so on. As advances in semiconductor processing and computer architecture push the performance of the computer higher and higher, more sophisticated computer software has evolved to take advantage of the higher performance of the hardware, resulting in computer systems today that are much more powerful than just a few years ago.
One area of computer system technology that has advanced is computer processors. As the number of computer systems in data centers and the number of mobile computing devices has increased, the need for more efficient computer processors has also increased. Speed of operation and power consumption are just two areas of computer processor technology that affect efficiency of computer processors.
Methods and apparatus for operation of a multi-slice processor are disclosed in this specification. Such a multi-slice processor includes a plurality of execution slices and a dispatch network of the multi-slice processor implementing a hardware level transfer of an execution thread between execution slices. Operation of such a multi-slice processor includes, responsive to a thread switch signal, halting dispatch of one or more instructions retrieved from an instruction cache; generating a plurality of instructions to transfer an execution thread from a first execution slice to a second execution slice; and dispatching the plurality of instructions instead of the one or more instructions retrieved from the instruction cache; and transferring, in dependence upon execution of the plurality of instructions, the execution thread from the first execution slice to the second execution slice.
The foregoing and other objects, features and advantages of the invention will be apparent from the following more particular descriptions of exemplary embodiments of the invention as illustrated in the accompanying drawings wherein like reference numbers generally represent like parts of exemplary embodiments of the invention.
Exemplary methods and apparatus for operation of a multi-slice processor in accordance with the present invention are described with reference to the accompanying drawings, beginning with
The computer (152) of
The example computer processor (156) of
The example multi-slice processor (156) of
Although the multi-slice processor (156) in the example of
Stored in RAM (168) in the example computer (152) is a data processing application (102), a module of computer program instructions that when executed by the multi-slice processor (156) may provide any number of data processing tasks. Examples of such data processing applications may include a word processing application, a spreadsheet application, a database management application, a media library application, a web server application, and so on as will occur to readers of skill in the art. Also stored in RAM (168) is an operating system (154). Operating systems useful in computers configured for operation of a multi-slice processor according to embodiments of the present invention include UNIX™, Linux™, Microsoft Windows™, AIX™, IBM's z/OS™, and others as will occur to those of skill in the art. The operating system (154) and data processing application (102) in the example of
The computer (152) of
The example computer (152) of
The exemplary computer (152) of
The arrangement of computers and other devices making up the exemplary system illustrated in
For further explanation,
The multi-slice processor in the example of
The general purpose registers (206) are configured to store the youngest instruction targeting a particular logical register and the result of the execution of the instruction. A logical register is an abstraction of a physical register that enables out-of-order execution of instructions that target the same physical register.
When a younger instruction targeting the same particular logical register is received, the entry in the general purpose register is moved to the history buffer. The history buffer (208) may be configured to store many instructions targeting the same logical register. That is, the general purpose register is generally configured to store a single, youngest instruction for each logical register while the history buffer may store many, non-youngest instructions for each logical register.
Each execution slice (204) of the multi-slice processor of
The arithmetic logic unit depicted in the example of
The results bus (220) may be configured in a variety of manners and be composed in a variety of sizes. In some instances, each execution slice may be configured to provide results on a single bus line of the results bus (220). In a similar manner, each load/store slice may be configured to provide results on a single bus line of the results bus (220). In such a configuration, a multi-slice processor with four processor slices may have a results bus with eight bus lines—four bus lines assigned to each of the four load/store slices and four bus lines assigned to each of the four execution slices. Each of the execution slices may be configured to snoop results on any of the bus lines of the results bus. In some embodiments, any instruction may be dispatched to a particular execution unit and then by issued to any other slice for performance. As such, any of the execution slices may be coupled to all of the bus lines to receive results from any other slice. Further, each load/store slice may be coupled to each bus line in order to receive an issue load/store instruction from any of the execution slices. Readers of skill in the art will recognize that many different configurations of the results bus may be implemented.
The multi-slice processor in the example of
The unaligned data logic (234) of each slice is coupled to the unaligned data logic of another slice through the unaligned data line (236). The unaligned data logic (234) enables data to be stored and retrieved across multiple load/store slices. The formatting logic (226) formats data into a form that may be returned on the results bus (220) to an execution slice as a result of a load instruction.
The example multi-slice processor of
During the flush and recovery operation, in prior art processors, the dispatcher was configured to halt dispatch of new instructions to an execution slice. Such instructions may be considered either target or source instructions. A target instruction is an instruction that targets a logical register for storage of result data. A source instruction by contrast has, as its source, a logical register. A target instruction, when executed, will result in data stored in an entry of a register file while a source instruction utilizes such data as a source for executing the instruction. A source instruction, while utilizing one logical register as its source, may also target another logical register for storage of the results of instruction. That is, with respect to one logical register, an instruction may be considered a source instruction and with respect to another logical register, the same instruction may be considered a target instruction.
For further explanation,
In the example of
Further in the example of
The thread switching hardware generator (310), responsive to the thread switching signal (308), generates multiple computer instructions and provides the computer instructions to the multiplexer (312).
The multiplexer (312), responsive to the same thread switching signal (308), selects the thread switching generator (310) as the source of instructions to propagate to the dispatch logic (306) instead of using the instruction buffer (304) as the source of instructions to propagate to the dispatch logic (306).
In this way, responsive to a hardware level detection and generation of an execution load imbalance among the execution slices, the dispatch logic may temporarily stop dispatching instruction from an instruction cache, and instead dispatch hardware generated instructions to transfer an execution thread from one execution slice to another execution slice of the multi-slice processor (156). The transfer of an execution thread may be carried out by dispatching and executing instructions generated by the thread switching instruction generator (310)—where the instructions include instructions to transfer data stored in registers, issue queues, history buffers, and other components storing data corresponding to an execution thread, from one execution slice to corresponding registers, issue queues, history buffers, and other components storing data corresponding to another execution slice. Because each of the plurality of instructions for transferring an execution thread are to be executed, and executed in the order they are dispatched, each of the plurality of instructions may also be specified to bypass an instruction issue queue and to not write into a completion table.
After the instructions from the thread switching instruction generator (310) have been executed, the execution thread may be considered completely transferred from one execution slice to another execution slice. In one example, the last instruction of the instructions from the thread switching instruction generator (310) may generate a signal to switch off, or change logical state of, the thread switching signal (308) so that the multiplexer (312) uses input from the instruction buffer (304) instead of the thread switching instruction generator (310). In other cases, the dispatch logic, or other hardware logic, may detect completion of the instructions from the thread switching hardware generator (310) based on completion of a specified quantity of instructions, and toggle the logical value of the thread switching signal (308).
In this way, the dispatch logic (202), after the hardware level transfer of an execution thread from one execution slice to another execution slice of the multi-slice processor (156), may resume dispatching instructions from the instruction cache (302).
For further explanation,
The method of
Halting (404) the dispatch of the one or more instructions may be carried out by the thread switch signal being propagated to the multiplexer (312) to switch to the thread switching instruction generator (310) as input instead of the instruction buffer (304) as input, as described above with regard to
Generating (406) the plurality of instructions may be carried out by the thread switching instruction generator (310) propagating a plurality of instructions to the multiplexer (312), where the multiplexer (312) propagates the plurality of instructions to the dispatch logic (306). The instructions from the thread switching instruction generator (310) may be propagated over several cycles. Further, the thread switching signal (308) may trigger the thread switching instruction generator (310) to propagate the plurality of instructions to the multiplexer (312), as described above with regard to
Dispatching (408) of the plurality of instructions from the thread switching instruction generator (310) may be carried out by the dispatch logic (306), responsive to the propagated instructions from the multiplexer (312), dispatching the plurality of instructions for execution, as described above with regard to
The method of
For further explanation,
The method of
The method of
The method of
In this way, instructions corresponding to a user software application may resume execution, where the execution of an execution thread for such a software application may be on a different execution slice—which may provide for a more balanced distribution of executing threads among the multiple execution slices of the multi-slice processor (156).
The present invention may be a system, a method, and/or a computer program product. The computer program product may include a computer readable storage medium (or media) having computer readable program instructions thereon for causing a processor to carry out aspects of the present invention.
The computer readable storage medium can be a tangible device that can retain and store instructions for use by an instruction execution device. The computer readable storage medium may be, for example, but is not limited to, an electronic storage device, a magnetic storage device, an optical storage device, an electromagnetic storage device, a semiconductor storage device, or any suitable combination of the foregoing. A non-exhaustive list of more specific examples of the computer readable storage medium includes the following: a portable computer diskette, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or Flash memory), a static random access memory (SRAM), a portable compact disc read-only memory (CD-ROM), a digital versatile disk (DVD), a memory stick, a floppy disk, a mechanically encoded device such as punch-cards or raised structures in a groove having instructions recorded thereon, and any suitable combination of the foregoing. A computer readable storage medium, as used herein, is not to be construed as being transitory signals per se, such as radio waves or other freely propagating electromagnetic waves, electromagnetic waves propagating through a waveguide or other transmission media (e.g., light pulses passing through a fiber-optic cable), or electrical signals transmitted through a wire.
Computer readable program instructions described herein can be downloaded to respective computing/processing devices from a computer readable storage medium or to an external computer or external storage device via a network, for example, the Internet, a local area network, a wide area network and/or a wireless network. The network may comprise copper transmission cables, optical transmission fibers, wireless transmission, routers, firewalls, switches, gateway computers and/or edge servers. A network adapter card or network interface in each computing/processing device receives computer readable program instructions from the network and forwards the computer readable program instructions for storage in a computer readable storage medium within the respective computing/processing device.
Computer readable program instructions for carrying out operations of the present invention may be assembler instructions, instruction-set-architecture (ISA) instructions, machine instructions, machine dependent instructions, microcode, firmware instructions, state-setting data, or either source code or object code written in any combination of one or more programming languages, including an object oriented programming language such as Smalltalk, C++ or the like, and conventional procedural programming languages, such as the “C” programming language or similar programming languages. The computer readable program instructions may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the latter scenario, the remote computer may be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or the connection may be made to an external computer (for example, through the Internet using an Internet Service Provider). In some embodiments, electronic circuitry including, for example, programmable logic circuitry, field-programmable gate arrays (FPGA), or programmable logic arrays (PLA) may execute the computer readable program instructions by utilizing state information of the computer readable program instructions to personalize the electronic circuitry, in order to perform aspects of the present invention.
Aspects of the present invention are described herein with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the invention. It will be understood that each block of the flowchart illustrations and/or block diagrams, and combinations of blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer readable program instructions.
These computer readable program instructions may be provided to a processor of a general purpose computer, special purpose computer, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks. These computer readable program instructions may also be stored in a computer readable storage medium that can direct a computer, a programmable data processing apparatus, and/or other devices to function in a particular manner, such that the computer readable storage medium having instructions stored therein comprises an article of manufacture including instructions which implement aspects of the function/act specified in the flowchart and/or block diagram block or blocks.
The computer readable program instructions may also be loaded onto a computer, other programmable data processing apparatus, or other device to cause a series of operational steps to be performed on the computer, other programmable apparatus or other device to produce a computer implemented process, such that the instructions which execute on the computer, other programmable apparatus, or other device implement the functions/acts specified in the flowchart and/or block diagram block or blocks.
The flowchart and block diagrams in the Figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods, and computer program products according to various embodiments of the present invention. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of instructions, which comprises one or more executable instructions for implementing the specified logical function(s). In some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems that perform the specified functions or acts or carry out combinations of special purpose hardware and computer instructions.
It will be understood from the foregoing description that modifications and changes may be made in various embodiments of the present invention without departing from its true spirit. The descriptions in this specification are for purposes of illustration only and are not to be construed in a limiting sense. The scope of the present invention is limited only by the language of the following claims.
This application is a continuation application of and claims priority from U.S. patent application Ser. No. 15/086,835, filed Mar. 31, 2016.
Number | Name | Date | Kind |
---|---|---|---|
8140832 | Mejdrich | Mar 2012 | B2 |
8219996 | Morris | Jul 2012 | B1 |
20040015967 | Morris | Jan 2004 | A1 |
20040162971 | Joy | Aug 2004 | A1 |
20050240936 | Jones | Oct 2005 | A1 |
20070083865 | Hemmi | Apr 2007 | A1 |
20080010442 | Hochschild | Jan 2008 | A1 |
20080189487 | Craske | Aug 2008 | A1 |
20090049451 | Bates | Feb 2009 | A1 |
20090070552 | Kanstein | Mar 2009 | A1 |
20090249349 | Bose | Oct 2009 | A1 |
20100095304 | Suzuki | Apr 2010 | A1 |
20100250900 | Brown | Sep 2010 | A1 |
20100257340 | Doing | Oct 2010 | A1 |
20110231616 | Lin | Sep 2011 | A1 |
20120173906 | Elnozahy | Jul 2012 | A1 |
20120233477 | Wu | Sep 2012 | A1 |
20120265969 | Alexander | Oct 2012 | A1 |
20130262822 | Gschwind | Oct 2013 | A1 |
20140006715 | Saraf | Jan 2014 | A1 |
20140095848 | Gschwind | Apr 2014 | A1 |
20140157287 | Howes | Jun 2014 | A1 |
20140181484 | Callister | Jun 2014 | A1 |
20140281402 | Comparan | Sep 2014 | A1 |
20140298060 | Hooker | Oct 2014 | A1 |
20150006854 | Gschwind | Jan 2015 | A1 |
20150212849 | Lee | Jul 2015 | A1 |
20150302219 | Lahteenmaki | Oct 2015 | A1 |
20160170886 | Ma | Jun 2016 | A1 |
20160203180 | Hanai | Jul 2016 | A1 |
20160283245 | Ben-Kiki | Sep 2016 | A1 |
20170003967 | Lin | Jan 2017 | A1 |
20170262281 | Bishop | Sep 2017 | A1 |
20170286183 | Barrick et al. | Oct 2017 | A1 |
Number | Date | Country |
---|---|---|
2309383 | Apr 2011 | EP |
WO 0068781 | Nov 2000 | WO |
WO 2007106959 | Sep 2007 | WO |
WO 2014099002 | Jun 2014 | WO |
Entry |
---|
Manousopoulos et al., “Characterizing Thread Placement and Thread Priorities in the IBM POWER7 Processor”, Diploma Thesis, dated Sep. 2012, 89 pages, National Technical University of Athens. |
Appendix P; List of IBM Patent or Application Treated as Related, Mar. 14, 2019, 2 pages. |
Number | Date | Country | |
---|---|---|---|
20190213055 A1 | Jul 2019 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 15086835 | Mar 2016 | US |
Child | 16353398 | US |