Classifications

• • G—PHYSICS
  • G06—COMPUTING OR CALCULATING; COUNTING
  • G06F—ELECTRIC DIGITAL DATA PROCESSING
  • G06F9/00—Arrangements for program control, e.g. control units
  • G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
  • G06F9/30—Arrangements for executing machine instructions, e.g. instruction decode
  • G06F9/38—Concurrent instruction execution, e.g. pipeline or look ahead
  • G06F9/3802—Instruction prefetching
• • G—PHYSICS
  • G06—COMPUTING OR CALCULATING; COUNTING
  • G06F—ELECTRIC DIGITAL DATA PROCESSING
  • G06F9/00—Arrangements for program control, e.g. control units
  • G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
  • G06F9/30—Arrangements for executing machine instructions, e.g. instruction decode
• • G—PHYSICS
  • G06—COMPUTING OR CALCULATING; COUNTING
  • G06F—ELECTRIC DIGITAL DATA PROCESSING
  • G06F12/00—Accessing, addressing or allocating within memory systems or architectures
  • G06F12/02—Addressing or allocation; Relocation
  • G06F12/08—Addressing or allocation; Relocation in hierarchically structured memory systems, e.g. virtual memory systems
  • G06F12/0802—Addressing of a memory level in which the access to the desired data or data block requires associative addressing means, e.g. caches
  • G06F12/0862—Addressing of a memory level in which the access to the desired data or data block requires associative addressing means, e.g. caches with prefetch
• • G—PHYSICS
  • G06—COMPUTING OR CALCULATING; COUNTING
  • G06F—ELECTRIC DIGITAL DATA PROCESSING
  • G06F9/00—Arrangements for program control, e.g. control units
  • G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
• • G—PHYSICS
  • G06—COMPUTING OR CALCULATING; COUNTING
  • G06F—ELECTRIC DIGITAL DATA PROCESSING
  • G06F9/00—Arrangements for program control, e.g. control units
  • G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
  • G06F9/30—Arrangements for executing machine instructions, e.g. instruction decode
  • G06F9/30145—Instruction analysis, e.g. decoding, instruction word fields
  • G06F9/30149—Instruction analysis, e.g. decoding, instruction word fields of variable length instructions
• • G—PHYSICS
  • G06—COMPUTING OR CALCULATING; COUNTING
  • G06F—ELECTRIC DIGITAL DATA PROCESSING
  • G06F9/00—Arrangements for program control, e.g. control units
  • G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
  • G06F9/30—Arrangements for executing machine instructions, e.g. instruction decode
  • G06F9/38—Concurrent instruction execution, e.g. pipeline or look ahead
  • G06F9/3802—Instruction prefetching
  • G06F9/3814—Implementation provisions of instruction buffers, e.g. prefetch buffer; banks
• • G—PHYSICS
  • G06—COMPUTING OR CALCULATING; COUNTING
  • G06F—ELECTRIC DIGITAL DATA PROCESSING
  • G06F2212/00—Indexing scheme relating to accessing, addressing or allocation within memory systems or architectures
  • G06F2212/60—Details of cache memory
  • G06F2212/6022—Using a prefetch buffer or dedicated prefetch cache
• • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
  • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
  • Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
  • Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management

Definitions

• the present disclosure relates generally to data processors, and more particularly, to systems and methods of managing instruction prefetch buffers of data processors.
• computing systems such as personal computers, personal digital assistants, cellular and digital telephones, and other processor-based devices include data processors in the form of microprocessors for processing computer-readable instructions.
• a microprocessor is a single-chip data processor that includes an instruction decoder to decode the computer-readable instructions and one or more execution units to execute the decoded instructions. The execution units perform most of the actions responsible for application programs to function.
• Cache memory is a high-speed local memory that utilizes the locality of instruction fetching (in the case of an instruction cache) or data references (in the case of a data cache) to prevent pipeline stalling due to the relatively slow access time of main memory.
• a prefetch buffer is a set of registers that store instructions that have been pre-loaded from the cache or from main memory in a first-in, first-out (FIFO) fashion.
• Prefetch buffers prevent instruction starvation that might otherwise occur during cache or main memory accesses, but have limitations of their own.
• One limitation is that some microprocessors support variable length instructions, which may cause inefficient usage of the prefetch buffer.
• branch instructions may result in a change of flow for the data processor.
• branch instructions may result in a change of flow for the data processor.
• multiple instructions following the branch instruction may have been fetched and loaded into the prefetch buffer that will not be needed if the branch is taken. Consequently, instructions may be loaded from memory only to be subsequently discarded from the prefetch buffer. The discarded instructions represent wasted power in the form of unnecessary fetch operations.
• FIG. 1 is a block diagram illustrating a portion of a data processing system including a processor having a fetch control unit according to an embodiment of the present invention.
• FIG. 2 is a flow diagram illustrating hardware dynamic control of instruction prefetch buffer depth of the processor of FIG. 1.
• a data processor includes a prefetch buffer and a fetch control unit.
• the prefetch buffer includes a plurality of lines, and has a variable maximum depth that defines a number of lines of the plurality of lines that are capable of storing instructions.
• the fetch control unit is coupled to the prefetch buffer to monitor at least one of the plurality of lines of the prefetch buffer and to adjust the variable maximum depth of the prefetch buffer in response to a state of the data processor.
• the fetch control unit may monitor a first line of the prefetch buffer, determined by the variable maximum depth, and initiate an instruction fetch when the first line is empty.
• the fetch control unit may also be adapted to set the variable maximum depth of the prefetch buffer to a first predetermined depth or to a second predetermined depth.
• the fetch control unit may further set the variable maximum depth of the prefetch buffer in response to an instruction type.
• the fetch control unit may set the variable maximum depth of the prefetch buffer to a first predetermined depth or a second predetermined depth in response to the instruction type.
• the instruction type can be one of 32-bit instructions and 16-bit instructions, or alternatively can be one of 32-bit instructions and variable-length instructions.
• the fetch control unit may yet further dynamically adjust the variable maximum depth of the prefetch buffer.
• the fetch control unit may increase the variable maximum depth in response to a starvation condition of the prefetch buffer.
• the starvation condition may be that a frequency of instruction starvation exceeds a threshold, in which case the fetch control unit increases the variable maximum depth in response to the starvation condition.
• the starvation condition may also be whether the prefetch buffer is not averaging close to starvation, in which case the fetch control unit decreases the variable maximum depth in response to the starvation condition. In this latter case the fetch control unit may determine whether the prefetch buffer is averaging close to starvation by monitoring a state of a plurality of lines of the prefetch buffer.
• a data processor includes a register, a prefetch buffer, and a fetch control unit.
• the register stores an instruction prefetch control value that indicates that the data processor is operating in a selected one of a plurality of modes.
• the prefetch buffer includes a plurality of lines, the prefetch buffer having a variable maximum depth that defines a number of lines of the plurality of lines that are capable of storing instructions.
• the fetch control unit is coupled to the prefetch buffer and to the register, the fetch control unit controlling the variable maximum depth in response to the instruction prefetch control value.
• the fetch control unit may set the variable maximum depth of the prefetch buffer to a first predetermined depth or to a second predetermined depth in response to the instruction prefetch control value being respectively a first value or a second value.
• the fetch control unit may set the variable maximum depth of the prefetch buffer to one of first and second predetermined depths, determined at least in part by a current instruction type, in response to the instruction prefetch control value being a predetermined value.
• the fetch control unit may set the variable maximum depth of the prefetch buffer dynamically in response to the instruction prefetch control value being a predetermined value. In this case, the fetch control unit may increase or decrease the variable maximum depth of the prefetch buffer dynamically in response to a starvation condition of the prefetch buffer.
• a method is adapted for use in a data processor having a prefetch buffer with a plurality of lines and a variable maximum depth that defines a number of lines of the plurality of lines that are capable of storing instructions.
• a starvation condition of the prefetch buffer is monitored. If a rate of starvation of the prefetch buffer exceeds a threshold, then the variable maximum depth is increased. If the prefetch buffer is not averaging close to starvation, then the variable maximum depth is decreased.
• instructions may be fetched into the prefetch buffer configured according to the variable maximum depth. Moreover, instructions may be outputted from the prefetch buffer, and instructions so outputted may be decoded for execution by the data processor.
• FIG. 1 is a block diagram illustrating a portion of a data processing system 100 including a data processor 102 having a fetch control unit 116 according to an embodiment of the present invention.
• Data processing system 100 includes generally data processor 102 and a memory 104.
• data processor 102 can be variously implemented as a microprocessor, a microcontroller, a digital signal processor (DSP), and intelligent direct memory access (DMA) controller, etc.
• DSP digital signal processor
• DMA direct memory access
• Data processor 102 is connected to memory 104 over a bidirectional bus conducting address, data, and control signals, and may use any conventional memory bus architecture such as double data rate (DDR) synchronous dynamic random access memory (SDRAM).
• DDR double data rate
• SDRAM synchronous dynamic random access memory
• Data processor 102 includes a memory management unit (MMU)/cache 106, a bus interface unit (BIU) 108, a multiplexer (MUX) 110, a prefetch buffer 112, a decoder 114, a fetch control unit 116, and a register 118.
• MMU/cache 106 has an input for receiving a virtual address labeled "VIRTUAL ADDRESS", a first output for providing a physical address labeled "PHYSICAL ADDRESS, a second output for providing data, and a third output for providing attributes related to the translated VIRTUAL ADDRESS labeled "ATTRIBUTES".
• BIU 108 has an input connected to the first output of MMU/cache 106, a bidirectional terminal connected to memory 104, and a data output terminal.
• MUX 110 has a first input terminal connected to the output terminal of BIU 108, a second input terminal connected to the second output terminal of MMU/cache 106, and an output terminal.
• Prefetch buffer 112 has an input terminal connected to the output terminal of MUX 110, a first output terminal for providing an output instruction, a second output terminal for providing information relating to the instructions stored therein, and a third output terminal for providing a signal labeled "IR EMPTY".
• Decoder 114 has an input terminal connected to the first output terminal of prefetch buffer 112, and an output terminal for providing decoded output signals, directly or indirectly, to the execution units of data processor 102 (not shown in FIG. 1).
• Fetch control unit 116 has input terminals connected to the second and third output terminals of prefetch buffer 112 in a manner to be more fully described below, a first control input terminal, a second control input terminal connected to the third output terminal of MMU/cache 106 for receiving the ATTRIBUTES therefrom, and an output terminal connected to the input terminal of MMU/cache 106 for providing the VIRTUAL ADDRESS thereto.
• Register 118 has an output terminal connected to the first control input terminal of fetch control unit 116.
• data processor 102 is a high-performance microprocessor that uses a prefetch buffer 112 to help prevent instruction starvation.
• Fetch control unit 116 monitors the state of prefetch buffer 112 and generates virtual addresses to initiate instruction fetches.
• MMU/cache 106 In response to receiving the VIRTUAL ADDRESS, MMU/cache 106 first performs a virtual-to-physical address translation by accessing stored translations from a translation look-aside buffer (TLB) included in MMU/cache 106. If the translation is not present in the TLB, MMU/cache 106 initiates a table walking procedure to load a corresponding translation from a page table stored in memory 104.
• TLB translation look-aside buffer
• MMU/cache 106 uses the translation in the TLB to perform attribute checking as well as address translation, and provides the attributes of the selected page as the ATTRIBUTES signal to fetch control unit 116. After MMU/cache 106 performs the address translation, the cache portion of MMU/cache 106 is checked to see if the accessed instruction is present. If the instruction is present in the cache, a condition known as a cache hit, then MMU/cache 106 provides the data so accessed to the second input of MUX 110, and causes it to be selected for input to prefetch buffer 112.
• MMU/cache 106 accesses memory 104 by providing the PHYSICAL ADDRESS to BIU 108.
• BIU 108 performs the bus access by providing the PHYSICAL ADDRESS and appropriate control signals to memory 104.
• memory 104 provides the requested instruction on the data bus to the first input of MUX 110, through which the requested instruction is provided to prefetch buffer 112. Note that the instruction is also stored in the cache of MMU/cache 106 for later use, but this operation is conventional and will not be described further.
• Prefetch buffer 112 includes a set of lines or registers 120, such as representative lines 122, 124, 126, 128, and 130 illustrated in FIG. 1. Depending on the implementation, the number of lines 120 may vary but in the illustrated embodiment prefetch buffer 112 has 10 lines.
• Line 122 which is the last line in prefetch buffer 112, contains the next instruction (or portion of the next instruction if the instruction length exceeds one line) for presentation to decoder 114 and is referred to as the "INSTRUCTION REGISTER".
• Each line of the set of lines 120 is capable of storing an instruction or portion of an instruction if the instruction length exceeds one line.
• Prefetch buffer 112 also has a variable maximum depth, which refers to the number of lines 122, 124, 126, 128, and 130 of the prefetch buffer 112 that are capable of storing an instruction when the buffer is considered to be full. Since instruction register 122 is the last (or oldest) location, the variable maximum depth determines the first (or newest) location in set of lines 120 that is capable of storing instructions. As will be explained below, the maximum buffer depth can advantageously be fewer than all the lines of prefetch buffer 112.
• Fetch control unit 116 includes a program counter, increment logic, and various decoders and buffer state machines as will be described more fully below.
• Fetch control unit 116 monitors the first line of prefetch buffer 112 (determined by the variable maximum depth set by fetch control unit 116) and initiates an instruction fetch when that line is empty.
• Fetch control unit 116 initiates the instruction fetch by generating the VIRTUAL ADDRESS and providing a request signal to MMU/cache 106, which eventually causes the next instruction to be loaded into the oldest available line of prefetch buffer 112.
• Register 118 includes a 2-bit field 120 known as the instruction prefetch control (IPC) field that stores an instruction prefetch control value to define the operation of fetch control unit 116 and prefetch buffer 112.
• IPC instruction prefetch control
• the maximum buffer depth at 10 lines the operating system provides the least chance of instruction starvation, but at a cost of increased power consumption due to unnecessary instruction fetches.
• the maximum buffer depth at 4 lines the operating system provides reduced power consumption but at a cost of occasional starvation and somewhat lower performance.
• the maximum buffer depth is set by the current instruction size.
• fetch control unit 116 sets the maximum buffer depth at 10 buffers.
• fetch control unit 116 sets the maximum buffer depth at 5 buffers.
• Fetch control unit 106 determines the current instruction size by receiving the ATTRIBUTE signal from the MMU in MMU/cache 106 to indicate the instruction format of the memory page accessed by the last instruction fetch.
• data processor 102 is a microprocessor that executes either 32-bit instructions from the "BookE” instruction set of the PowerPC family of microprocessors sold by Freescale Corporation, or instructions having variable length encoding (VLE).
• fetch control unit 116 could provide 10 buffers when executing 32-bit instructions of the so-called "ARM” instruction set or 5 buffers when executing 16-bit instructions of the so-called “Thumb” instruction set that are used in microprocessors designed by Advanced RISC Machines, Ltd.
• these two instruction sets are merely exemplary.
• MMU/cache 106 identifies the instruction type by a corresponding attribute in the page table and fetch control unit 116 controls the depth of prefetch buffer 112 in response to the corresponding one of the ATTRIBUTES.
• fetch control unit 116 could switch between the two maximum prefetch buffer depths based on decoding a special instruction that switches between the ARM and Thumb instruction sets, known as the branch and exchange instruction, rather than by examining an attribute of the memory page accessed by the last instruction fetch.
• decoder 114 would provide an ARM/THUMB control signal to fetch control unit 116 in response to decoding the branch and exchange instruction.
• fetch control unit 116 sets the maximum prefetch buffer depth dynamically.
• the variable maximum depth is set as follows. Fetch control unit 116 detects the instruction starvation condition by receiving the IR EMPTY signal from instruction register 122 indicating that it is empty and by monitoring its internal buffer state machines. Fetch control unit 116 dynamically adjusts the maximum prefetch buffer depth to reduce starvation to an acceptable level. If the rate of starvation exceeds a threshold, then fetch control unit 116 increases the maximum buffer depth by one line. Fetch control unit 116 repeats this process until it determines that the rate of starvation no longer exceeds the threshold.
• fetch control unit 116 also selectively decreases the variable maximum depth based on determining that prefetch buffer 112 is not operating close to starvation.
• One way to determine this condition is for fetch control unit 116 to monitor either all lines, or at least multiple lines, in the last stages of prefetch buffer 112. It then judges prefetch buffer 112 as "not close to starvation” by comparing the fullness of the buffer to a threshold, averaged over time. If fetch control unit 116 determines that prefetch buffer 112 is in the "not close to starvation" state, then fetch control unit 116 reduces the variable maximum depth.
• the availability of these modes provides the user flexibility to reduce power consumption without negatively impacting performance.
• the first two modes allow explicit operating system or software control of the maximum prefetch buffer depth.
• the third mode allows the maximum prefetch buffer depth to be determined by the instruction type.
• the fourth mode allows the hardware to dynamically adjust the maximum prefetch buffer depth depending on conditions in the processor, such as prefetch buffer 112 itself, which will vary as the software running on data processor 102 varies.
• prefetch buffer 112 itself
• FIG. 2 is a flow diagram 200 illustrating one exemplary method that can be used for hardware dynamic control of instruction prefetch buffer depth of data processor 102 of FIG. 1.
• Flow starts at box 202.
• fetch control unit 116 determines whether prefetch buffer 112 is empty by sampling the IR EMPTY signal from line 122 of prefetch buffer 112. If prefetch buffer 112 is empty (IR EMPTY is true), then flow proceeds to decision box 206.
• decision box 206 if the calculated rate of starvation does not exceed a threshold, then flow returns to decision box 204. If however the calculated rate of starvation does exceed a threshold, then flow proceeds to step 208.
• fetch control unit 116 increases the maximum buffer length such as by incrementing it by one (assuming it is not already equal to the maximum number of lines in set 120), and returns flow to decision box 204.
• prefetch buffer 112 is not empty (IR EMPTY is false), then flow proceeds to decision box 210.
• Decision box 210 determines whether prefetch buffer 112 is "not close to starvation". For example fetch control unit 116 may monitor several of the last entries in prefetch buffer 112 and determine when they all contain valid instructions. In a particular example fetch control unit 116 would determine that prefetch buffer 112 is not close to starvation if all of lines 122, 124, 126, and 128 are valid. This "not close to starvation" condition indicates that the software currently being executed does not need as many prefetch buffers to avoid starvation as is currently allocated, and would be the result of characteristics such as the frequency of change of flow instructions, memory accesses, and the like.
• fetch control unit 116 will need to maintain various counters, state machines, and the like. The implementation of these structures will be apparent to those of ordinary skill in the art. Moreover fetch control unit 116 needs to monitor the state of prefetch buffer 112 as well as its internal state machines when switching between modes. For example, when fetch control unit determines the "not close to starvation" condition exists, it may not be able to immediately decrease the variable maximum buffer depth, but only to decrease it as prefetch buffer 112 drains to within the new depth.

Landscapes

• Engineering & Computer Science (AREA)
• Theoretical Computer Science (AREA)
• Software Systems (AREA)
• Physics & Mathematics (AREA)
• General Engineering & Computer Science (AREA)
• General Physics & Mathematics (AREA)
• Advance Control (AREA)
• Memory System Of A Hierarchy Structure (AREA)

Priority Applications (2)

Applications Claiming Priority (2)

Publications (2)

Family

ID=38523133

Family Applications (1)

Country Status (5)

Cited By (1)

Families Citing this family (23)

Citations (3)

Family Cites Families (40)

• 2006
  • 2006-03-21 US US11/385,463 patent/US9304773B2/en active Active
• 2007
  • 2007-02-23 WO PCT/US2007/062651 patent/WO2007109395A2/en not_active Ceased
  • 2007-02-23 JP JP2009501622A patent/JP5279701B2/ja active Active
  • 2007-02-23 KR KR1020087022855A patent/KR20080102213A/ko not_active Withdrawn
  • 2007-02-23 EP EP07757384A patent/EP1999574B1/en not_active Ceased

Patent Citations (3)

Non-Patent Citations (1)

Also Published As

Similar Documents

Legal Events