US20010014928A1 - Dynamically disabling speculative prefetch when high priority demand fetch opportunity use is high - Google Patents
Dynamically disabling speculative prefetch when high priority demand fetch opportunity use is high Download PDFInfo
- Publication number
- US20010014928A1 US20010014928A1 US09/835,279 US83527901A US2001014928A1 US 20010014928 A1 US20010014928 A1 US 20010014928A1 US 83527901 A US83527901 A US 83527901A US 2001014928 A1 US2001014928 A1 US 2001014928A1
- Authority
- US
- United States
- Prior art keywords
- priority
- shift register
- memory
- threshold
- shifted
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR 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/46—Multiprogramming arrangements
- G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
- G06F9/5005—Allocation of resources, e.g. of the central processing unit [CPU] to service a request
- G06F9/5011—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resources being hardware resources other than CPUs, Servers and Terminals
- G06F9/5016—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resources being hardware resources other than CPUs, Servers and Terminals the resource being the memory
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR 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, look ahead
- G06F9/3802—Instruction prefetching
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR 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, look ahead
- G06F9/3824—Operand accessing
- G06F9/383—Operand prefetching
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/30—Monitoring
- G06F11/34—Recording or statistical evaluation of computer activity, e.g. of down time, of input/output operation ; Recording or statistical evaluation of user activity, e.g. usability assessment
- G06F11/3409—Recording or statistical evaluation of computer activity, e.g. of down time, of input/output operation ; Recording or statistical evaluation of user activity, e.g. usability assessment for performance assessment
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2201/00—Indexing scheme relating to error detection, to error correction, and to monitoring
- G06F2201/88—Monitoring involving counting
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2209/00—Indexing scheme relating to G06F9/00
- G06F2209/50—Indexing scheme relating to G06F9/50
- G06F2209/5021—Priority
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2209/00—Indexing scheme relating to G06F9/00
- G06F2209/50—Indexing scheme relating to G06F9/50
- G06F2209/507—Low-level
Definitions
- Modern microprocessors comprise many resources such as registers and memory for which various requesters contend.
- a typical microprocessor has various layers of memory including local instruction and data caches, lower level backup caches (B-cache), main memory, storage devices such as disk drives, and storage available over a network.
- B-cache lower level backup caches
- main memory main memory
- storage devices such as disk drives
- storage available over a network storage available over a network.
- these layers form a hierarchical set of memories where at one extreme, the local caches are very fast but tend to be small, whereas at the other extreme, main memory, disk storage, and network storage tend to have very large capacities, but access times are also magnitudes larger than for local memory.
- the present invention addresses this problem by providing a mechanism which dynamically detects when a high percentage of memory-access bandwidth is needed for high-priority operations such as demand misses, and which, based on this detection, shuts down low priority requesters such as hardware prefetchers until the demand for the bandwidth is reduced.
- a preferred embodiment of the present invention realizes this mechanism by counting the number of high-priority utilizations from the last N opportunities in which the high-priority utilizations could have been requested. When the count exceeds some threshold, indicating high usage by the high-priority requester, a portion of low-priority requests are throttled or disabled. Priority may be determined, for example, by measuring the degree of speculative use of the resource. Thus, speculative prefetches have a lower priority than demand accesses.
- the present invention works on the principle that if bandwidth utilization due to high-priority accesses has been high in the recent past, then it will continue to be high due to high-priority accesses in the near future. To that end, the present invention prohibits hardware prefetchers, which have a lower priority, from making requests during high bandwidth utilization periods to increase overall performance.
- a method for arbitrating among a plurality of requesters of resources in a computer system comprises selecting a first requester based on a history of program execution. Other requesters which compete with the first requester are inhibited.
- the history is based on past utilization of the resources.
- memory including but not limited to main memory and cache memory, and associated data paths, are resources from which a demand fetcher and a speculative prefetcher request instructions or data.
- the demand fetcher is the first requester, while the speculative prefetcher is a competing requester.
- low-priority utilization of a resource in a digital processor is limited in favor of high-priority utilization of the resource such as demand fetching, by determining a value which is predictive of high-priority utilization of the resource. If the predictive value is greater than some threshold, low-priority utilization of the resource is inhibited, or throttled. If the predictive value is less than or equal to the threshold, low-priority utilization of the resource is allowed.
- the threshold is a predefined constant.
- the predictive value is preferably determined by counting the number of opportunities in which the resource could have been utilized for a high-priority need, regardless of whether it actually was so utilized. The number of actual high-priority utilizations of the resource is also counted, and divided by the opportunity count, yielding the predictive value.
- some actual high-priority utilizations are given more weight than others.
- recent high-priority utilizations are weighted more heavily than less recent high-priority utilizations.
- the number m of actual high-priority uses from the last N use opportunities is first determined, where N is predefined.
- the value m is compared with some threshold. Speculative accesses are inhibited if m is greater than a threshold, but are allowed otherwise.
- m is determined by providing an N-bit shift register.
- a 1 is shifted into the N-bit shift register for each high-priority use opportunity in which there has been an actual high-priority use.
- a 0 is shifted into the shift register for all other use opportunities, such that a count of 1s in the shift register provides a value for m.
- hysteresis can be used about the threshold.
- a second shift register is provided.
- the second register When a 0 is shifted in to the N-bit shift register and 1 is shifted out, the second register is shifted left, with a 0 being shifted in from the right.
- the second register When a 1 is shifted in to the N-bit register and 0 is shifted out, the second register is shifted right, with a 1 being shifted in from the left.
- a certain predesignated bit in the second shift register, associated with the threshold has a value of 1, m is deemed to exceed the threshold.
- the techniques of the present invention may be employed by associating a priority level with each option.
- a value is determined based on past behavior of at least one of the options.
- At least one high-priority option is selected if the determined value exceeds a threshold such that lower priority options are effectively inhibited.
- any option may be selected if the determined value does not exceed the threshold.
- the techniques of the present invention may be employed to select a thread based on utilization of bandwidth, or based on a prioritization among the threads.
- FIG. 1 is a block diagram of a computer system having a main memory and backup cache.
- FIG. 2 is a schematic diagram of a preferred embodiment of the present invention using a shift register and counting logic.
- FIG. 3 is a schematic diagram of the embodiment of FIG. 2 with weights added.
- FIG. 4 is a schematic diagram depicting the use of an upper and lower threshold to characterize a variation of the embodiments of the FIGS. 2 and 3 with hysteresis.
- FIG. 5A is a schematic diagram of a preferred embodiment with two shift registers.
- FIG. 5B is a schematic diagram of a preferred embodiment of the present invention using a counter.
- FIG. 1 shows a general computer system 100 .
- a microprocessor (CPU) 101 generally fetches its instructions and data from a main memory 113 .
- this main memory and the system bus 111 over which instructions and data travel, tend to slow down the execution of the microprocessor 101 which must wait to receive the instructions or data.
- a modem microprocessor 101 typically has an on-board instruction cache, or I-cache 103 , and a data cache, or D-cache 105 . Based on the fact that recently-fetched instructions or data tend to be reused, these caches 103 , 105 provide the microprocessor 101 with near-instantaneous access to the instructions or data. While the discussion hereafter focuses only on instruction fetching, it will be recognized by those skilled in the art that the discussion applies equally to data fetching.
- Memory hierarchies may comprise several caching levels.
- the first level instruction and data caches described above need to be accessed very quickly. This restriction limits the size of these first-level caches, creating the need for other caches which are larger but are slower to access. Therefore, many computer systems have backup caches, or B-caches 109 , which may reside on-chip or off-chip, and which serve as intermediary caches between the first-level caches and main memory 113 or other storage. When needed, instructions or data are retrieved from the first-level caches 103 , 105 , or from lower levels of the memory hierarchy, as available.
- Fetching hardware 108 fetches instructions or data typically as the need arises. Such fetches are denoted hereafter as “demand requests”.
- modem CPUs utilize hardware prefetching techniques to reduce the impact of the long latency between the CPU and main memory.
- the CPU prefetcher 107 predicts which memory blocks the CPU will utilize in the near future and requests those blocks from the memory hierarchy before they are actually needed. The CPU cannot be certain ahead of time which instructions and data it will need in the future. For instruction prefetch, this uncertainty is typically due to branch instructions in the code. This is referred to as “speculative prefetching”. Because the results are not needed immediately, timing is less critical with prefetching requests than with demand requests.
- prefetching consumes significant bandwidth to the memory hierarchy, thereby reducing the amount of available bandwidth for memory transactions that are needed as soon as possible, such as for demand misses, cache-victim processing, etc. This can be a problem even when the priority of the prefetch requests has been lowered to below that of other demand misses, because, for example, the prefetch cycle could have already begun.
- a mechanism which dynamically detects when a high percentage of the bandwidth is needed for high-priority accesses such as demand misses, and which shuts down the hardware prefetcher until the demand for bandwidth decreases.
- FIG. 2 is a schematic diagram of a preferred embodiment of the present invention.
- Instruction fetching hardware 108 is responsible for fetching instructions from memory, e.g., the B-cache 109 .
- the hardware prefetcher 107 which is responsible for speculative prefetching.
- the present invention works on the principle that if bandwidth utilization for high-priority requests has been high in the recent past, then it will continue to be high in the near future.
- bandwidth utilization has been high for high-priority requests
- speculative requests from the hardware prefetcher 107 are prohibited from making requests.
- Information about the recent history of memory bandwidth utilization of a resource is captured using a shift register 115 of arbitrary length N.
- Each bit 116 in the shift register 115 represents one usage opportunity for the memory resource.
- the fetcher 108 outputs a signal 119 which is indictive of resource usage. For example, if a high-priority demand request was made in the last opportunity, the fetcher 108 shifts a 1 into the register 115 via signal 119 . Otherwise, the fetcher 108 shifts a 0 into the register 115 . If the register 115 contains N bits, then it holds information about the last N usage opportunities.
- prefetch requests are inhibited depending on some function based upon the contents of the shift register 115 .
- this function is a count of the bits 116 in the shift register 115 that are set to 1. This is represented schematically in FIG. 2 by counting logic 117 whose output 125 represents the number of 1s in the shift register 115 . This count 125 is compared by comparator 121 to some threshold 127 , and if the count 125 exceeds the threshold 127 , the comparator 121 generates a choke signal 123 which inhibits the prefetcher 107 . Otherwise prefetching is not inhibited.
- FIG. 3 is a schematic diagram of the embodiment similar to that of FIG. 2 in which the bits 116 of the shift register 115 are individually assigned weights 129 .
- the counting logic 117 in FIG. 3 may give more weight to some bits 116 than others, for example, counting some bits 116 more than once. Preferably, more weight is given to more recent bits 120 in the register 115 than to the older bits 122 .
- the ultimate output of counter logic 117 and operation of the remaining parts is the same as in FIG. 2 as previously discussed.
- FIG. 4 is a schematic diagram depicting the use of two thresholds 135 —an upper threshold Th H and a lower threshold ThL—to characterize a preferred embodiment of the present invention with hysteresis around a nominal threshold.
- the illustrated thresholds Th L and Th H are used instead of threshold 127 Th in FIGS. 2 and 3.
- Selector 131 selects the upper threshold Th H when the comparator output 123 indicates that the usage has been low and that prefetching is allowed, and selects the lower threshold Th L when the comparator output 123 indicates that the usage has been high and prefetching has been turned off.
- FIG. 5A is a schematic diagram of a preferred embodiment using two shift registers, SRA and SRB. Assume that logic in the fetching hardware 108 produces either a 0 or 1 to be shifted into shift register SRA, according to whether the resource was actually used at the last usage opportunity. As before, SRA can be of arbitrary length N.
- the shift register SRA's input bit 201 and output bit 209 are brought to logic circuit 203 .
- the logic circuit 203 has the following truth table: SRA input 201 SRA output 209 SHL SHR Comment 0 0 0 0 No change - no action 0 1 1 0 a 1 has been dropped 1 0 0 1 a 1 has been added 1 1 0 0 No change - no action
- the SHL and SHR output signals from the logic circuit 203 command the second shift register SRB to shift left or right respectively.
- shift register SRB is shifted to the left via the SHL signal
- a 0 is shifted in from the right 213 .
- register SRB is shifted to the right via the SHR signal
- a 1 is shifted in from the left 215 .
- both registers hold the same number of 1s and 0s, but while register SRA's bits are ordered historically, register SRB groups all of the 1s contiguously to the left side 215 and groups all of the 0s contiguously to the right side 213 .
- the terms left and right are used to differentiate one from the other, and may just as easily be reversed.
- n is the value of the threshold, i.e., to see if there are more than n 1s in shift register SRA or equivalently, register SRB
- the hardware only needs to look at predesignated bit n of register SRB.
- Predesignated bit n is the n+1st bit from the left 215 end of register SRB as illustrated in FIG. 5 where the leftmost bit is 0. No counting is required. If the value 205 of register SRB bit n is 1, the threshold has been exceeded. In turn, prefetcher 107 is inhibited. Otherwise, when the value 205 of bit n is 0, the threshold is not met and prefetcher 107 remains active.
- FIG. 5B shows an alternate embodiment of the present invention in which a counter 225 and comparator 227 perform essentially the same function as the second shift register SRB of FIG. 5A.
- the same logic circuit 203 is used, however, its output SHL and SHR signals become decrement and increment signals respectively to the counter 225 , which keeps a running tally of the number of is in register SRA.
- the counter's value 226 is compared with a threshold at comparator 227 , which generates a choke signal 123 to inhibit the prefetcher 107 .
- a thread is selected based on bandwidth, or prioritization among the threads.
Abstract
Description
- This application is a continuation of application Ser. No. 09/184,623, filed on Nov. 2, 1998. The entire teachings of the above application is incorporated herein by reference.
- Modern microprocessors comprise many resources such as registers and memory for which various requesters contend. For example, a typical microprocessor has various layers of memory including local instruction and data caches, lower level backup caches (B-cache), main memory, storage devices such as disk drives, and storage available over a network. Generally, these layers form a hierarchical set of memories where at one extreme, the local caches are very fast but tend to be small, whereas at the other extreme, main memory, disk storage, and network storage tend to have very large capacities, but access times are also magnitudes larger than for local memory.
- To reduce the impact of the long latency between processor and main memory or other long latency storage, hardware prefetching techniques are utilized. The CPU predicts which memory blocks it will utilize next and requests those blocks from the memory hierarchy before they are actually needed.
- Because it cannot be predicted with certainty which branch a branch instruction in the instruction stream will take, these prefetched instructions are said to be speculative. Unfortunately, these prefetches can consume bandwidth to the lower level caches, main memory, etc., reducing the amount of available bandwidth for memory transactions that are needed as soon as possible, for example, for demand misses and cache-victim processing.
- The present invention addresses this problem by providing a mechanism which dynamically detects when a high percentage of memory-access bandwidth is needed for high-priority operations such as demand misses, and which, based on this detection, shuts down low priority requesters such as hardware prefetchers until the demand for the bandwidth is reduced.
- A preferred embodiment of the present invention realizes this mechanism by counting the number of high-priority utilizations from the last N opportunities in which the high-priority utilizations could have been requested. When the count exceeds some threshold, indicating high usage by the high-priority requester, a portion of low-priority requests are throttled or disabled. Priority may be determined, for example, by measuring the degree of speculative use of the resource. Thus, speculative prefetches have a lower priority than demand accesses.
- In other words, the present invention works on the principle that if bandwidth utilization due to high-priority accesses has been high in the recent past, then it will continue to be high due to high-priority accesses in the near future. To that end, the present invention prohibits hardware prefetchers, which have a lower priority, from making requests during high bandwidth utilization periods to increase overall performance.
- Accordingly, a method for arbitrating among a plurality of requesters of resources in a computer system comprises selecting a first requester based on a history of program execution. Other requesters which compete with the first requester are inhibited.
- Preferably, the history is based on past utilization of the resources. Preferably, memory, including but not limited to main memory and cache memory, and associated data paths, are resources from which a demand fetcher and a speculative prefetcher request instructions or data. The demand fetcher is the first requester, while the speculative prefetcher is a competing requester.
- In a preferred embodiment of the present invention, low-priority utilization of a resource in a digital processor, such as speculative prefetching, is limited in favor of high-priority utilization of the resource such as demand fetching, by determining a value which is predictive of high-priority utilization of the resource. If the predictive value is greater than some threshold, low-priority utilization of the resource is inhibited, or throttled. If the predictive value is less than or equal to the threshold, low-priority utilization of the resource is allowed. Preferably, the threshold is a predefined constant.
- Furthermore, the predictive value is preferably determined by counting the number of opportunities in which the resource could have been utilized for a high-priority need, regardless of whether it actually was so utilized. The number of actual high-priority utilizations of the resource is also counted, and divided by the opportunity count, yielding the predictive value.
- In a preferred embodiment, some actual high-priority utilizations are given more weight than others. Preferably, recent high-priority utilizations are weighted more heavily than less recent high-priority utilizations.
- In another preferred embodiment, the number m of actual high-priority uses from the last N use opportunities is first determined, where N is predefined. The value m is compared with some threshold. Speculative accesses are inhibited if m is greater than a threshold, but are allowed otherwise.
- In a preferred embodiment, m is determined by providing an N-bit shift register. A 1 is shifted into the N-bit shift register for each high-priority use opportunity in which there has been an actual high-priority use. A 0 is shifted into the shift register for all other use opportunities, such that a count of 1s in the shift register provides a value for m. Optionally, hysteresis can be used about the threshold.
- In a further preferred embodiment, a second shift register is provided. When a 0 is shifted in to the N-bit shift register and 1 is shifted out, the second register is shifted left, with a 0 being shifted in from the right. When a 1 is shifted in to the N-bit register and 0 is shifted out, the second register is shifted right, with a 1 being shifted in from the left. When a certain predesignated bit in the second shift register, associated with the threshold has a value of 1, m is deemed to exceed the threshold.
- Similarly, where a plurality of options is available, the techniques of the present invention may be employed by associating a priority level with each option. A value is determined based on past behavior of at least one of the options. At least one high-priority option is selected if the determined value exceeds a threshold such that lower priority options are effectively inhibited. On the other hand, any option may be selected if the determined value does not exceed the threshold.
- Finally, where multiple threads are executing, the techniques of the present invention may be employed to select a thread based on utilization of bandwidth, or based on a prioritization among the threads.
- The foregoing and other objects, features and advantages of the invention will be apparent from the following more particular description of preferred embodiments of the invention, as illustrated in the accompanying drawings in which like reference characters refer to the same parts throughout the different views. The drawings are not necessarily to scale, emphasis instead being placed upon illustrating the principles of the invention.
- FIG. 1 is a block diagram of a computer system having a main memory and backup cache.
- FIG. 2 is a schematic diagram of a preferred embodiment of the present invention using a shift register and counting logic.
- FIG. 3 is a schematic diagram of the embodiment of FIG. 2 with weights added.
- FIG. 4 is a schematic diagram depicting the use of an upper and lower threshold to characterize a variation of the embodiments of the FIGS. 2 and 3 with hysteresis.
- FIG. 5A is a schematic diagram of a preferred embodiment with two shift registers.
- FIG. 5B is a schematic diagram of a preferred embodiment of the present invention using a counter.
- FIG. 1 shows a
general computer system 100. A microprocessor (CPU) 101 generally fetches its instructions and data from amain memory 113. However, this main memory and thesystem bus 111 over which instructions and data travel, tend to slow down the execution of themicroprocessor 101 which must wait to receive the instructions or data. - To speed up execution, a
modem microprocessor 101 typically has an on-board instruction cache, or I-cache 103, and a data cache, or D-cache 105. Based on the fact that recently-fetched instructions or data tend to be reused, thesecaches microprocessor 101 with near-instantaneous access to the instructions or data. While the discussion hereafter focuses only on instruction fetching, it will be recognized by those skilled in the art that the discussion applies equally to data fetching. - Memory hierarchies may comprise several caching levels. The first level instruction and data caches described above need to be accessed very quickly. This restriction limits the size of these first-level caches, creating the need for other caches which are larger but are slower to access. Therefore, many computer systems have backup caches, or B-
caches 109, which may reside on-chip or off-chip, and which serve as intermediary caches between the first-level caches andmain memory 113 or other storage. When needed, instructions or data are retrieved from the first-level caches - Fetching
hardware 108 fetches instructions or data typically as the need arises. Such fetches are denoted hereafter as “demand requests”. In addition, modem CPUs utilize hardware prefetching techniques to reduce the impact of the long latency between the CPU and main memory. TheCPU prefetcher 107 predicts which memory blocks the CPU will utilize in the near future and requests those blocks from the memory hierarchy before they are actually needed. The CPU cannot be certain ahead of time which instructions and data it will need in the future. For instruction prefetch, this uncertainty is typically due to branch instructions in the code. This is referred to as “speculative prefetching”. Because the results are not needed immediately, timing is less critical with prefetching requests than with demand requests. - Unfortunately, prefetching consumes significant bandwidth to the memory hierarchy, thereby reducing the amount of available bandwidth for memory transactions that are needed as soon as possible, such as for demand misses, cache-victim processing, etc. This can be a problem even when the priority of the prefetch requests has been lowered to below that of other demand misses, because, for example, the prefetch cycle could have already begun. Thus there is a need for a mechanism which dynamically detects when a high percentage of the bandwidth is needed for high-priority accesses such as demand misses, and which shuts down the hardware prefetcher until the demand for bandwidth decreases.
- FIG. 2 is a schematic diagram of a preferred embodiment of the present invention.
Instruction fetching hardware 108 is responsible for fetching instructions from memory, e.g., the B-cache 109. Within the fetchinghardware 108 is thehardware prefetcher 107 which is responsible for speculative prefetching. Of course, there could be multiple hardware prefetchers, for example, for instructions and for data. - The present invention works on the principle that if bandwidth utilization for high-priority requests has been high in the recent past, then it will continue to be high in the near future. When recent bandwidth utilization has been high for high-priority requests, speculative requests from the
hardware prefetcher 107 are prohibited from making requests. - Information about the recent history of memory bandwidth utilization of a resource, such as a B-
cache 109, is captured using ashift register 115 of arbitrary length N. Eachbit 116 in theshift register 115 represents one usage opportunity for the memory resource. Thefetcher 108 outputs asignal 119 which is indictive of resource usage. For example, if a high-priority demand request was made in the last opportunity, thefetcher 108 shifts a 1 into theregister 115 viasignal 119. Otherwise, thefetcher 108 shifts a 0 into theregister 115. If theregister 115 contains N bits, then it holds information about the last N usage opportunities. When theregister 115 is full, the oldest information is shifted out of theregister 115 as new information is shifted in. To avoid unnecessarily inhibiting theprefetcher 107, low-priority utilizations such as prefetches are preferably not recorded in theshift register 115 as consuming a usage opportunity. - In the present invention, prefetch requests are inhibited depending on some function based upon the contents of the
shift register 115. Preferably, this function is a count of thebits 116 in theshift register 115 that are set to 1. This is represented schematically in FIG. 2 by countinglogic 117 whoseoutput 125 represents the number of 1s in theshift register 115. Thiscount 125 is compared bycomparator 121 to somethreshold 127, and if thecount 125 exceeds thethreshold 127, thecomparator 121 generates achoke signal 123 which inhibits theprefetcher 107. Otherwise prefetching is not inhibited. - FIG. 3 is a schematic diagram of the embodiment similar to that of FIG. 2 in which the
bits 116 of theshift register 115 are individually assignedweights 129. Thus, the countinglogic 117 in FIG. 3 may give more weight to somebits 116 than others, for example, counting somebits 116 more than once. Preferably, more weight is given to morerecent bits 120 in theregister 115 than to the older bits 122. The ultimate output ofcounter logic 117 and operation of the remaining parts is the same as in FIG. 2 as previously discussed. - FIG. 4 is a schematic diagram depicting the use of two
thresholds 135—an upper threshold ThH and a lower threshold ThL—to characterize a preferred embodiment of the present invention with hysteresis around a nominal threshold. The illustrated thresholds ThL and ThH are used instead ofthreshold 127 Th in FIGS. 2 and 3.Selector 131 selects the upper threshold ThH when thecomparator output 123 indicates that the usage has been low and that prefetching is allowed, and selects the lower threshold ThL when thecomparator output 123 indicates that the usage has been high and prefetching has been turned off. - FIG. 5A is a schematic diagram of a preferred embodiment using two shift registers, SRA and SRB. Assume that logic in the fetching
hardware 108 produces either a 0 or 1 to be shifted into shift register SRA, according to whether the resource was actually used at the last usage opportunity. As before, SRA can be of arbitrary length N. - The shift register SRA's input bit201 and
output bit 209 are brought tologic circuit 203. Thelogic circuit 203 has the following truth table:SRA input 201 SRA output 209SHL SHR Comment 0 0 0 0 No change - no action 0 1 1 0 a 1 has been dropped 1 0 0 1 a 1 has been added 1 1 0 0 No change - no action - The SHL and SHR output signals from the
logic circuit 203 command the second shift register SRB to shift left or right respectively. When shift register SRB is shifted to the left via the SHL signal, a 0 is shifted in from the right 213. On the other hand, when register SRB is shifted to the right via the SHR signal, a 1 is shifted in from the left 215. Thus, both registers hold the same number of 1s and 0s, but while register SRA's bits are ordered historically, register SRB groups all of the 1s contiguously to theleft side 215 and groups all of the 0s contiguously to theright side 213. Of course, it is obvious to those skilled in the art that the terms left and right are used to differentiate one from the other, and may just as easily be reversed. - Referring to the above logic truth table, when the input and
output bits 201, 209 to shift register SRA are the same, i.e., both 0s or both 1s, there is no change to the total number of is in the register, and so no action is taken with respect to shift register SRB. However, when the input 201 is a 0 and theoutput bit 209 is a 1, shift register SRA is losing a 1. Therefore register SRB is shifted left. Note again that when SRB is shifted left, a 0 is shifted in. Finally, when the input bit 201 is a 1 and theoutput bit 209 is a 0, shift register SRA is gaining a 1, and register SRB is shifted right, with a 1 shifting in from the left 215. - Now, to see if there are more than n actual uses out of the last N opportunities where n is the value of the threshold, i.e., to see if there are more than n 1s in shift register SRA or equivalently, register SRB, the hardware only needs to look at predesignated bit n of register SRB. Predesignated bit n is the n+1st bit from the left215 end of register SRB as illustrated in FIG. 5 where the leftmost bit is 0. No counting is required. If the
value 205 of register SRB bit n is 1, the threshold has been exceeded. In turn,prefetcher 107 is inhibited. Otherwise, when thevalue 205 of bit n is 0, the threshold is not met andprefetcher 107 remains active. - FIG. 5B shows an alternate embodiment of the present invention in which a
counter 225 andcomparator 227 perform essentially the same function as the second shift register SRB of FIG. 5A. Thesame logic circuit 203 is used, however, its output SHL and SHR signals become decrement and increment signals respectively to thecounter 225, which keeps a running tally of the number of is in register SRA. As with the embodiment of FIG. 2, the counter'svalue 226 is compared with a threshold atcomparator 227, which generates achoke signal 123 to inhibit theprefetcher 107. - It will be obvious to those skilled in the art that the above use of two shift registers with the logic described above can be used to measure bandwidth for other goals as well as throttling prefetching, e.g. performance evaluation with respect to any type of resource usage. The roles of 0s and 1s could similarly be reversed.
- In another embodiment of the present invention, a thread is selected based on bandwidth, or prioritization among the threads.
- While this invention has been particularly shown and described with references to preferred embodiments thereof, it will be understood by those skilled in the art that various changes in form and details may be made therein without departing from the spirit and scope of the invention as defined by the appended claims. Those skilled in the art will recognize or be able to ascertain using no more than routine experimentation, many equivalents to the specific embodiments of the invention described specifically herein. Such equivalents are intended to be encompassed in the scope of the claims.
Claims (34)
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US09/835,279 US6324616B2 (en) | 1998-11-02 | 2001-04-13 | Dynamically inhibiting competing resource requesters in favor of above threshold usage requester to reduce response delay |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US09/184,623 US6233645B1 (en) | 1998-11-02 | 1998-11-02 | Dynamically disabling speculative prefetch when high priority demand fetch opportunity use is high |
US09/835,279 US6324616B2 (en) | 1998-11-02 | 2001-04-13 | Dynamically inhibiting competing resource requesters in favor of above threshold usage requester to reduce response delay |
Related Parent Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US09/184,623 Continuation US6233645B1 (en) | 1998-11-02 | 1998-11-02 | Dynamically disabling speculative prefetch when high priority demand fetch opportunity use is high |
Publications (2)
Publication Number | Publication Date |
---|---|
US20010014928A1 true US20010014928A1 (en) | 2001-08-16 |
US6324616B2 US6324616B2 (en) | 2001-11-27 |
Family
ID=22677671
Family Applications (2)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US09/184,623 Expired - Lifetime US6233645B1 (en) | 1998-11-02 | 1998-11-02 | Dynamically disabling speculative prefetch when high priority demand fetch opportunity use is high |
US09/835,279 Expired - Fee Related US6324616B2 (en) | 1998-11-02 | 2001-04-13 | Dynamically inhibiting competing resource requesters in favor of above threshold usage requester to reduce response delay |
Family Applications Before (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US09/184,623 Expired - Lifetime US6233645B1 (en) | 1998-11-02 | 1998-11-02 | Dynamically disabling speculative prefetch when high priority demand fetch opportunity use is high |
Country Status (1)
Country | Link |
---|---|
US (2) | US6233645B1 (en) |
Cited By (17)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20030165146A1 (en) * | 2002-03-04 | 2003-09-04 | Robert Sultan | Aggregate rate transparent LAN service for closed user groups over optical rings |
US20050198439A1 (en) * | 2004-03-04 | 2005-09-08 | Fredy Lange | Cache memory prefetcher |
US20060095677A1 (en) * | 2004-08-17 | 2006-05-04 | Hakura Ziyad S | System, apparatus and method for issuing predictions from an inventory to access a memory |
US20060161762A1 (en) * | 2005-01-20 | 2006-07-20 | Eisen Lee E | Method and logical apparatus for managing processing system resource use for speculative execution |
US20060268692A1 (en) * | 2005-05-31 | 2006-11-30 | Bellsouth Intellectual Property Corp. | Transmission of electronic packets of information of varying priorities over network transports while accounting for transmission delays |
US20080177925A1 (en) * | 2003-12-01 | 2008-07-24 | Radoslav Danilak | Hardware support system for accelerated disk I/O |
US20080177914A1 (en) * | 2003-06-26 | 2008-07-24 | Nvidia Corporation | Hardware support system for accelerated disk I/O |
US20090150657A1 (en) * | 2007-12-05 | 2009-06-11 | Ibm Corporation | Method and Apparatus for Inhibiting Fetch Throttling When a Processor Encounters a Low Confidence Branch Instruction in an Information Handling System |
US20100070667A1 (en) * | 2008-09-16 | 2010-03-18 | Nvidia Corporation | Arbitration Based Allocation of a Shared Resource with Reduced Latencies |
US20100095036A1 (en) * | 2008-10-14 | 2010-04-15 | Nvidia Corporation | Priority Based Bus Arbiters Avoiding Deadlock And Starvation On Buses That Support Retrying Of Transactions |
US20100217868A1 (en) * | 2009-02-25 | 2010-08-26 | International Business Machines Corporation | Microprocessor with software control over allocation of shared resources among multiple virtual servers |
US20100259536A1 (en) * | 2009-04-08 | 2010-10-14 | Nvidia Corporation | System and method for deadlock-free pipelining |
US8356143B1 (en) | 2004-10-22 | 2013-01-15 | NVIDIA Corporatin | Prefetch mechanism for bus master memory access |
US8356142B1 (en) * | 2003-11-12 | 2013-01-15 | Nvidia Corporation | Memory controller for non-sequentially prefetching data for a processor of a computer system |
US8683132B1 (en) | 2003-09-29 | 2014-03-25 | Nvidia Corporation | Memory controller for sequentially prefetching data for a processor of a computer system |
US9569385B2 (en) | 2013-09-09 | 2017-02-14 | Nvidia Corporation | Memory transaction ordering |
US10445136B1 (en) * | 2017-06-01 | 2019-10-15 | Amazon Technologies, Inc. | Randomized subrequest selection using request-specific nonce |
Families Citing this family (44)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP3573980B2 (en) * | 1998-11-13 | 2004-10-06 | 富士通株式会社 | Information processing apparatus and information processing system |
US6473833B1 (en) | 1999-07-30 | 2002-10-29 | International Business Machines Corporation | Integrated cache and directory structure for multi-level caches |
US6418516B1 (en) * | 1999-07-30 | 2002-07-09 | International Business Machines Corporation | Method and system for managing speculative requests in a multi-level memory hierarchy |
US6487637B1 (en) | 1999-07-30 | 2002-11-26 | International Business Machines Corporation | Method and system for clearing dependent speculations from a request queue |
US6625744B1 (en) * | 1999-11-19 | 2003-09-23 | Intel Corporation | Controlling population size of confidence assignments |
US6718454B1 (en) * | 2000-04-29 | 2004-04-06 | Hewlett-Packard Development Company, L.P. | Systems and methods for prefetch operations to reduce latency associated with memory access |
US6678795B1 (en) * | 2000-08-15 | 2004-01-13 | International Business Machines Corporation | Method and apparatus for memory prefetching based on intra-page usage history |
US7752400B1 (en) * | 2000-12-14 | 2010-07-06 | F5 Networks, Inc. | Arbitration and crossbar device and method |
US6832280B2 (en) * | 2001-08-10 | 2004-12-14 | Freescale Semiconductor, Inc. | Data processing system having an adaptive priority controller |
US6918010B1 (en) * | 2002-10-16 | 2005-07-12 | Silicon Graphics, Inc. | Method and system for prefetching data |
US6959374B2 (en) * | 2003-01-29 | 2005-10-25 | Sun Microsystems, Inc. | System including a memory controller configured to perform pre-fetch operations including dynamic pre-fetch control |
US7055016B2 (en) * | 2003-04-30 | 2006-05-30 | Sun Microsystems, Inc. | Computer system including a memory controller configured to perform pre-fetch operations |
US7054968B2 (en) * | 2003-09-16 | 2006-05-30 | Denali Software, Inc. | Method and apparatus for multi-port memory controller |
US8275865B2 (en) * | 2004-02-05 | 2012-09-25 | International Business Machines Corporation | Methods, systems and computer program products for selecting among alert conditions for resource management systems |
GB2415060B (en) * | 2004-04-16 | 2007-02-14 | Imagination Tech Ltd | Dynamic load balancing |
US7318125B2 (en) * | 2004-05-20 | 2008-01-08 | International Business Machines Corporation | Runtime selective control of hardware prefetch mechanism |
US20060048158A1 (en) * | 2004-07-29 | 2006-03-02 | International Business Machines Corporation | Methods and apparatus for aging a command |
US8490102B2 (en) * | 2004-07-29 | 2013-07-16 | International Business Machines Corporation | Resource allocation management using IOC token requestor logic |
KR100643287B1 (en) * | 2004-11-19 | 2006-11-10 | 삼성전자주식회사 | Data processing device and method for flash memory |
US20060123003A1 (en) * | 2004-12-08 | 2006-06-08 | International Business Machines Corporation | Method, system and program for enabling non-self actuated database transactions to lock onto a database component |
US8732368B1 (en) * | 2005-02-17 | 2014-05-20 | Hewlett-Packard Development Company, L.P. | Control system for resource selection between or among conjoined-cores |
US20070204267A1 (en) * | 2006-02-28 | 2007-08-30 | Cole Michael F | Throttling prefetching in a processor |
US7747806B2 (en) * | 2006-06-02 | 2010-06-29 | Panasonic Corporation | Resource use management device, resource use management system, and control method for a resource use management device |
US7996623B2 (en) * | 2006-06-30 | 2011-08-09 | Seagate Technology Llc | Read ahead storage control |
US20080091866A1 (en) * | 2006-10-12 | 2008-04-17 | International Business Machines Corporation | Maintaining forward progress in a shared L2 by detecting and breaking up requestor starvation |
US7787485B2 (en) * | 2007-02-08 | 2010-08-31 | Lutron Electronics Co., Ltd. | Method of transmitting a high-priority message in a lighting control system |
US7574547B1 (en) * | 2007-07-17 | 2009-08-11 | Sun Microsystems, Inc. | Ring counter based starvation free weighted priority encoded arbiter |
US8260990B2 (en) * | 2007-11-19 | 2012-09-04 | Qualcomm Incorporated | Selective preclusion of a bus access request |
US8032713B2 (en) * | 2007-12-10 | 2011-10-04 | International Business Machines Corporation | Structure for handling data access |
US7949830B2 (en) * | 2007-12-10 | 2011-05-24 | International Business Machines Corporation | System and method for handling data requests |
US9053031B2 (en) * | 2007-12-10 | 2015-06-09 | International Business Machines Corporation | System and method for handling data access |
US7937533B2 (en) * | 2007-12-10 | 2011-05-03 | International Business Machines Corporation | Structure for handling data requests |
US10721269B1 (en) | 2009-11-06 | 2020-07-21 | F5 Networks, Inc. | Methods and system for returning requests with javascript for clients before passing a request to a server |
US20120016681A1 (en) * | 2010-07-13 | 2012-01-19 | Salesforce.Com, Inc. | System, method and computer program product for analyzing monitored usage of a resource |
US8510521B2 (en) | 2010-09-16 | 2013-08-13 | Apple Inc. | Reordering in the memory controller |
US8631213B2 (en) | 2010-09-16 | 2014-01-14 | Apple Inc. | Dynamic QoS upgrading |
US8314807B2 (en) | 2010-09-16 | 2012-11-20 | Apple Inc. | Memory controller with QoS-aware scheduling |
US9053058B2 (en) | 2012-12-20 | 2015-06-09 | Apple Inc. | QoS inband upgrade |
US9229896B2 (en) | 2012-12-21 | 2016-01-05 | Apple Inc. | Systems and methods for maintaining an order of read and write transactions in a computing system |
US20150134933A1 (en) * | 2013-11-14 | 2015-05-14 | Arm Limited | Adaptive prefetching in a data processing apparatus |
US9465744B2 (en) * | 2014-07-29 | 2016-10-11 | International Business Machines Corporation | Data prefetch ramp implemenation based on memory utilization |
US9507596B2 (en) * | 2014-08-28 | 2016-11-29 | Intel Corporation | Instruction and logic for prefetcher throttling based on counts of memory accesses to data sources |
US10296463B2 (en) * | 2016-01-07 | 2019-05-21 | Samsung Electronics Co., Ltd. | Instruction prefetcher dynamically controlled by readily available prefetcher accuracy |
US11314558B2 (en) | 2019-07-23 | 2022-04-26 | Netapp, Inc. | Methods for dynamic throttling to satisfy minimum throughput service level objectives and devices thereof |
Family Cites Families (14)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US4620278A (en) * | 1983-08-29 | 1986-10-28 | Sperry Corporation | Distributed bus arbitration according each bus user the ability to inhibit all new requests to arbitrate the bus, or to cancel its own pending request, and according the highest priority user the ability to stop the bus |
US5487156A (en) | 1989-12-15 | 1996-01-23 | Popescu; Valeri | Processor architecture having independently fetching issuing and updating operations of instructions which are sequentially assigned and stored in order fetched |
US5506989A (en) * | 1990-01-31 | 1996-04-09 | Ibm Corporation | Arbitration system limiting high priority successive grants |
US5440752A (en) * | 1991-07-08 | 1995-08-08 | Seiko Epson Corporation | Microprocessor architecture with a switch network for data transfer between cache, memory port, and IOU |
US5421020A (en) | 1993-01-08 | 1995-05-30 | International Business Machines Corporation | Counter register implementation for speculative execution of branch on count instructions |
US5421022A (en) | 1993-06-17 | 1995-05-30 | Digital Equipment Corporation | Apparatus and method for speculatively executing instructions in a computer system |
US5454117A (en) | 1993-08-25 | 1995-09-26 | Nexgen, Inc. | Configurable branch prediction for a processor performing speculative execution |
EP0651324B1 (en) | 1993-10-29 | 2006-03-22 | Advanced Micro Devices, Inc. | Speculative instruction queue for variable byte length instructions |
US5613083A (en) | 1994-09-30 | 1997-03-18 | Intel Corporation | Translation lookaside buffer that is non-blocking in response to a miss for use within a microprocessor capable of processing speculative instructions |
US5774685A (en) | 1995-04-21 | 1998-06-30 | International Business Machines Corporation | Method and apparatus for biasing cache LRU for prefetched instructions/data based upon evaluation of speculative conditions |
US5721864A (en) | 1995-09-18 | 1998-02-24 | International Business Machines Corporation | Prefetching instructions between caches |
US6073159A (en) * | 1996-12-31 | 2000-06-06 | Compaq Computer Corporation | Thread properties attribute vector based thread selection in multithreading processor |
US6035392A (en) * | 1998-02-20 | 2000-03-07 | International Business Machines Corporation | Computer with optimizing hardware for conditional hedge fetching into cache storage |
US6073132A (en) * | 1998-03-27 | 2000-06-06 | Lsi Logic Corporation | Priority arbiter with shifting sequential priority scheme |
-
1998
- 1998-11-02 US US09/184,623 patent/US6233645B1/en not_active Expired - Lifetime
-
2001
- 2001-04-13 US US09/835,279 patent/US6324616B2/en not_active Expired - Fee Related
Cited By (32)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US7102997B2 (en) | 2002-03-04 | 2006-09-05 | Fujitsu Limited | Aggregate rate transparent LAN service for closed user groups over optical rings |
US20030165146A1 (en) * | 2002-03-04 | 2003-09-04 | Robert Sultan | Aggregate rate transparent LAN service for closed user groups over optical rings |
US8694688B2 (en) | 2003-06-26 | 2014-04-08 | Nvidia Corporation | Disk controller for implementing efficient disk I/O for a computer system |
US20080177914A1 (en) * | 2003-06-26 | 2008-07-24 | Nvidia Corporation | Hardware support system for accelerated disk I/O |
US8595394B1 (en) | 2003-06-26 | 2013-11-26 | Nvidia Corporation | Method and system for dynamic buffering of disk I/O command chains |
US8386648B1 (en) | 2003-06-26 | 2013-02-26 | Nvidia Corporation | Hardware support system for accelerated disk I/O |
US8683132B1 (en) | 2003-09-29 | 2014-03-25 | Nvidia Corporation | Memory controller for sequentially prefetching data for a processor of a computer system |
US8356142B1 (en) * | 2003-11-12 | 2013-01-15 | Nvidia Corporation | Memory controller for non-sequentially prefetching data for a processor of a computer system |
US8700808B2 (en) | 2003-12-01 | 2014-04-15 | Nvidia Corporation | Hardware support system for accelerated disk I/O |
US20080177925A1 (en) * | 2003-12-01 | 2008-07-24 | Radoslav Danilak | Hardware support system for accelerated disk I/O |
US20050198439A1 (en) * | 2004-03-04 | 2005-09-08 | Fredy Lange | Cache memory prefetcher |
US7441087B2 (en) * | 2004-08-17 | 2008-10-21 | Nvidia Corporation | System, apparatus and method for issuing predictions from an inventory to access a memory |
US20060095677A1 (en) * | 2004-08-17 | 2006-05-04 | Hakura Ziyad S | System, apparatus and method for issuing predictions from an inventory to access a memory |
US8356143B1 (en) | 2004-10-22 | 2013-01-15 | NVIDIA Corporatin | Prefetch mechanism for bus master memory access |
US7890738B2 (en) * | 2005-01-20 | 2011-02-15 | International Business Machines Corporation | Method and logical apparatus for managing processing system resource use for speculative execution |
US20060161762A1 (en) * | 2005-01-20 | 2006-07-20 | Eisen Lee E | Method and logical apparatus for managing processing system resource use for speculative execution |
US20060268692A1 (en) * | 2005-05-31 | 2006-11-30 | Bellsouth Intellectual Property Corp. | Transmission of electronic packets of information of varying priorities over network transports while accounting for transmission delays |
US8006070B2 (en) * | 2007-12-05 | 2011-08-23 | International Business Machines Corporation | Method and apparatus for inhibiting fetch throttling when a processor encounters a low confidence branch instruction in an information handling system |
US20090150657A1 (en) * | 2007-12-05 | 2009-06-11 | Ibm Corporation | Method and Apparatus for Inhibiting Fetch Throttling When a Processor Encounters a Low Confidence Branch Instruction in an Information Handling System |
US20100070667A1 (en) * | 2008-09-16 | 2010-03-18 | Nvidia Corporation | Arbitration Based Allocation of a Shared Resource with Reduced Latencies |
US8356128B2 (en) | 2008-09-16 | 2013-01-15 | Nvidia Corporation | Method and system of reducing latencies associated with resource allocation by using multiple arbiters |
US8370552B2 (en) | 2008-10-14 | 2013-02-05 | Nvidia Corporation | Priority based bus arbiters avoiding deadlock and starvation on buses that support retrying of transactions |
US20100095036A1 (en) * | 2008-10-14 | 2010-04-15 | Nvidia Corporation | Priority Based Bus Arbiters Avoiding Deadlock And Starvation On Buses That Support Retrying Of Transactions |
US8788672B2 (en) | 2009-02-25 | 2014-07-22 | International Business Machines Corporation | Microprocessor with software control over allocation of shared resources among multiple virtual servers |
US8676976B2 (en) | 2009-02-25 | 2014-03-18 | International Business Machines Corporation | Microprocessor with software control over allocation of shared resources among multiple virtual servers |
US20100217868A1 (en) * | 2009-02-25 | 2010-08-26 | International Business Machines Corporation | Microprocessor with software control over allocation of shared resources among multiple virtual servers |
WO2010097331A3 (en) * | 2009-02-25 | 2010-11-18 | International Business Machines Corporation | Microprocessor with software control over allocation of shared resources among multiple virtual servers |
US8698823B2 (en) | 2009-04-08 | 2014-04-15 | Nvidia Corporation | System and method for deadlock-free pipelining |
US20100259536A1 (en) * | 2009-04-08 | 2010-10-14 | Nvidia Corporation | System and method for deadlock-free pipelining |
US9928639B2 (en) | 2009-04-08 | 2018-03-27 | Nvidia Corporation | System and method for deadlock-free pipelining |
US9569385B2 (en) | 2013-09-09 | 2017-02-14 | Nvidia Corporation | Memory transaction ordering |
US10445136B1 (en) * | 2017-06-01 | 2019-10-15 | Amazon Technologies, Inc. | Randomized subrequest selection using request-specific nonce |
Also Published As
Publication number | Publication date |
---|---|
US6233645B1 (en) | 2001-05-15 |
US6324616B2 (en) | 2001-11-27 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US6233645B1 (en) | Dynamically disabling speculative prefetch when high priority demand fetch opportunity use is high | |
US6766419B1 (en) | Optimization of cache evictions through software hints | |
US5758142A (en) | Trainable apparatus for predicting instruction outcomes in pipelined processors | |
US5822790A (en) | Voting data prefetch engine | |
US7757045B2 (en) | Synchronizing recency information in an inclusive cache hierarchy | |
US7506105B2 (en) | Prefetching using hashed program counter | |
EP0582635B1 (en) | Method for increasing the speed of data processing in a computer system | |
US7707359B2 (en) | Method and apparatus for selectively prefetching based on resource availability | |
US9015422B2 (en) | Access map-pattern match based prefetch unit for a processor | |
US5345560A (en) | Prefetch buffer and information processing system using the same | |
EP3129886B1 (en) | Dynamic cache replacement way selection based on address tag bits | |
US8762649B2 (en) | Bounding box prefetcher | |
US20110072218A1 (en) | Prefetch promotion mechanism to reduce cache pollution | |
EP3055774B1 (en) | Multi-mode set associative cache memory dynamically configurable to selectively allocate into all or a subset of its ways depending on the mode | |
US5822757A (en) | Computer system with multi-buffer data cache for prefetching data having different temporal and spatial localities | |
US10331567B1 (en) | Prefetch circuit with global quality factor to reduce aggressiveness in low power modes | |
US20060248280A1 (en) | Prefetch address generation implementing multiple confidence levels | |
US9904624B1 (en) | Prefetch throttling in a multi-core system | |
US20060248279A1 (en) | Prefetching across a page boundary | |
EP3676713B1 (en) | Utilization-based throttling of hardware prefetchers | |
US20210182214A1 (en) | Prefetch level demotion | |
US6792524B1 (en) | System and method cancelling a speculative branch | |
US10599577B2 (en) | Admission control for memory access requests | |
US7062640B2 (en) | Instruction segment filtering scheme | |
US8255632B2 (en) | Pre-fetch control apparatus |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
AS | Assignment |
Owner name: COMPAQ COMPUTER CORPORATION, TEXAS Free format text: MERGER;ASSIGNOR:DIGITAL EQUIPMENT CORPORATION;REEL/FRAME:011704/0119 Effective date: 19991209 |
|
FEPP | Fee payment procedure |
Free format text: PAYOR NUMBER ASSIGNED (ORIGINAL EVENT CODE: ASPN); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY Free format text: PAYER NUMBER DE-ASSIGNED (ORIGINAL EVENT CODE: RMPN); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY |
|
FPAY | Fee payment |
Year of fee payment: 4 |
|
FEPP | Fee payment procedure |
Free format text: PAYER NUMBER DE-ASSIGNED (ORIGINAL EVENT CODE: RMPN); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY Free format text: PAYOR NUMBER ASSIGNED (ORIGINAL EVENT CODE: ASPN); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY |
|
FPAY | Fee payment |
Year of fee payment: 8 |
|
AS | Assignment |
Owner name: HEWLETT-PACKARD DEVELOPMENT COMPANY, L.P., TEXAS Free format text: CHANGE OF NAME;ASSIGNOR:COMPAQ INFORMATION TECHNOLOGIES GROUP, L.P.;REEL/FRAME:026909/0243 Effective date: 20021001 Owner name: COMPAQ INFORMATION TECHNOLOGIES GROUP, L.P., TEXAS Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:COMPAQ COMPUTER CORPORATION;REEL/FRAME:026909/0193 Effective date: 20010531 |
|
REMI | Maintenance fee reminder mailed | ||
LAPS | Lapse for failure to pay maintenance fees | ||
LAPS | Lapse for failure to pay maintenance fees |
Free format text: PATENT EXPIRED FOR FAILURE TO PAY MAINTENANCE FEES (ORIGINAL EVENT CODE: EXP.); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY |
|
STCH | Information on status: patent discontinuation |
Free format text: PATENT EXPIRED DUE TO NONPAYMENT OF MAINTENANCE FEES UNDER 37 CFR 1.362 |
|
FP | Lapsed due to failure to pay maintenance fee |
Effective date: 20131127 |