Apparatuses and methods for distributing row hammer refresh events across a memory device

Information

  • Patent Grant
  • 11315619
  • Patent Number
    11,315,619
  • Date Filed
    Wednesday, November 13, 2019
    5 years ago
  • Date Issued
    Tuesday, April 26, 2022
    3 years ago
Abstract
Apparatuses and methods for distributing row hammer refresh events across a memory device is disclosed. In one embodiment, the present disclosure is directed to an apparatus that includes a first memory configured to receive a sequential series of refresh commands and to replace a first of the sequential refresh commands with a row hammer refresh operation once during a refresh steal cycle, a second memory configured to receive the sequential series of refresh commands at to replace a second of the sequential refresh command with a row hammer refresh operation once during a refresh steal cycle, wherein the first of the sequential refresh commands and the second of the sequential refresh commands are different commands.
Description
BACKGROUND

A semiconductor memory device typically stores information via charges accumulated in cell capacitors. One such device that stores information in this manner is a Dynamic Random Access Memory (DRAM). Charges that accumulate in cell capacitors of a semiconductor memory device may dissipate over time through leakage. This charge leakage may lead to information loss unless refresh operations are periodically carried out. In a semiconductor memory device, such as a DRAM or the like, refresh operations are typically controlled through refresh commands. For example, a control device that controls the DRAM may periodically issue refresh commands that indicate refresh operations. The control device may issue the refresh commands at a frequency such that all word lines are refreshed at least once during the period of one refresh cycle. For example, with a 64 millisecond refresh cycle, a control device may issue a plurality of refresh commands that ensure every word line is refreshed at least once every 64 milliseconds.


The information retention characteristics of a memory cell may be reduced in some cases as a consequence of the access history of the memory cell. If the information retention time of the memory cell is reduced to less than one refresh cycle, part of the information stored in the memory cell may be lost even when refresh commands are issued at a frequency that refreshes all word lines at least one time per refresh cycle. Various factors may give rise to this problem in DRAMs. For example, cell leakage may occur due to crystal defects, foreign matters, etc., which may be present in memory cells by some degree. Cell leakage may also emerge due to interference from adjacent word lines or noise caused along with memory access. In some cases, the impact of access history on information retention may be mitigated by providing a disturb counter, which counts and/or stores the number of accesses that occur for each memory section. If an access count becomes larger than a predetermined threshold value, the refresh frequency of the section may be increased.


With miniaturization of DRAMs advancing to become a 2x-nm process in the current generation, the “row hammer” phenomenon has emerged. Generally, the “row hammer” phenomenon occurs when adjacent cell charges are lost by minor carriers that are generated every time a word line is activated/deactivated. Errors may occur as a result. The row hammer phenomenon is an additional mechanism for information retention loss and thus presents additional difficulties for the reliability of DRAMs. A row hammer threshold value generally refers to the number of memory access for a given word line that result in errors occurring in adjacent word lines. As process dimensions shrink, row hammer threshold values become smaller. In the 20-nm process generation, row hammer threshold values become 100,000 times or less. Because of this increasing problem, it is becoming difficult to maintain correct operations without dedicated circuit solutions in DRAM or some other solution on the memory side.


Some solutions to the row hammer problem expand the above-mentioned disturb counter to monitor each row address so to determine a row address (hammer address) at which the number accesses has reached the row hammer threshold value. Once the disturb counter registers a threshold number of accesses, adjacent word line(s) are subjected to additional refresh operations. However, because the memory space of a memory system is much bigger than a single DRAM, an extremely large scale circuit has to be mounted in order to analyze the history of access to such memory cells, and the cost thereof is not realistic. This is even more so in a large-scale system such as a server.


Other solutions focus on the fact that the appearance frequency of hammer addresses, as determined the row hammer threshold, inevitably increases as the upper limit of the number of times of row access (the number of Active commands) which can be executed in a refresh cycle decreases. Here, row addresses may be captured at random timing and at an appropriate frequency according to a probabilistic memory control. When random capture of row addresses is used, only additional refresh with respect to the adjacent word line thereof is carried out. Therefore, the circuit scale can be extremely reduced, and, according to the probability of hitting the hammer addresses, practically high reliability can be obtained.





BRIEF DESCRIPTION OF THE DRAWINGS


FIG. 1 is a block diagram showing an overall configuration of a memory in accordance with the present disclosure.



FIG. 2 is a schematic illustration of an example refresh address control circuit in accordance with the present disclosure.



FIG. 3 is a schematic illustration of a “CAS before RAS” (CBR) circuit in accordance with the present disclosure.



FIG. 4 is a schematic illustration of row hammer refresh (RHR) counter in accordance with the present disclosure.



FIG. 5A is a schematic illustration of a memory device in accordance with the present disclosure that uses a token bus configuration to control scheduling of row hammer events across the various memories of the memory device.



FIG. 5B is a schematic illustration of another memory device in accordance with the present disclosure that uses a token bus configuration to control scheduling of row hammer events across the various memories of the memory device.



FIG. 6 is a schematic illustration of an example N-bit shift register in accordance with the present disclosure.



FIG. 7 is a schematic illustration of an example shift register cell in accordance with the present disclosure.



FIG. 8 is a timing diagram that illustrates the timing of various row hammer refresh events across an example memory device in accordance with the present disclosure.





DETAILED DESCRIPTION

The present disclosure is directed to systems and methods for scheduling row hammer events across multiple memories in a memory device. As used herein, a “memory” may operate as part of a larger “memory device” that includes a number of other memories. For example, a memory may be a unit of memory such as a Dynamic Random Access Memory or the like. A memory may include a plurality of memory cells that are organized into word lines that may accessed as a group from outside the memory. A memory device may be Dual In-Line Memory Module or the like which includes a plurality of memories. A memory device may include a controller that issues commands to the various memories. For example, a controller may issue a read command that retrieves data from a word line in a particular memory. A controller may also issue a write command that stores data at a word line in a particular memory. Because memory cells store data via electrical charges that deteriorate over time, a controller may also periodically issue refresh commands that operate to restore electrical charges on individual memory cells in a word line of memory.


Generally, a “row hammer event” occurs when a refresh command is executed to refresh word lines that are adjacent to a hammered word line. A particular word line is “hammered” when it is accessed via memory access operations, such as a read or a write, in a manner that could potentially lead to data errors in adjacent word lines. Typically, a word line is hammered when it accessed more than a predetermined number of times. Embodiments in accordance with the present disclosure may determine that a particular word line is hammered via various mechanisms. In one example, probabilistic methods may be used to track hammer addresses. In other examples, disturb counters or similar mechanisms may be used to track hammer addresses.


A row hammer refresh command may be generally executed via a refresh command steal operation where a refresh command received from a memory device controller is “stolen” by the memory and a row hammer refresh command is executed in place of the “stolen” refresh command. The refresh command called, for by the “stolen” refresh command is typically executed at a later time after the row hammer refresh command is executed. In connection with the refresh steal operation, a memory may execute a timing protocol that allows the memory to “steal” refresh commands with a frequency that is determined such that a sufficient number of refresh commands are still executed to ensure that data in the memory is not lost.


A row hammer refresh command generally refreshes fewer memory cells than a typical memory refresh command. Because a row hammer refresh command refreshes fewer memory cells, a row hammer refresh command consumes less power than a typical memory refresh command. Given this observation, a memory device in accordance with the present disclosure may be programmed such that not all memories associated with a memory device execute a row hammer refresh command at the same time. Through this programming, the power consumption saving that occur on a row hammer refresh command may be distributed across the memories of a memory device. In this way, the peak power consumption of a memory device may be reduced.



FIG. 1 is a block diagram showing an overall configuration of a memory 10 in accordance with the present disclosure. The memory 10 according to the present embodiment is a SDRAM of, for example, a DDR3 (Double Data Rate 3) type integrated on a single semiconductor chip and has a memory cell array 11. The memory cell array 11 is provided with a plurality of word lines WL and a plurality of bit lines BL and has a configuration in which memory cells MC are disposed at the intersection points thereof. Selection of the word lines WL is carried out by a row decoder 12, and selection of bit lines BL is carried out by a column decoder 13. The memory cell array 11, the row decoder 12A, the column decoder 13, and a read/write amplifier 14 are divided into eight banks BANK0 to BANK7 by way of example and not limitation.


The memory 10 may be generally configured to be receive inputs from an external controller. Certain aspects of an example controller are described in greater detail below. The memory include various external terminals that provide for communication with the external controller. For example, the memory 10 may be provided with address terminals 21, command terminals 22, clock terminals 23, data terminals 24, and data mask terminals 25 as externals. The memory 10 may include additional external terminals such as power supply terminals 26 and 27. The address terminals 21 are the terminals to which address signals ADD are input from outside. The address signals ADD are supplied to an address output circuit 32 via an address input circuit 31. The address output circuit 32 supplies a row address XADD to the row decoder 12A and supplies a column address YADD to the column decoder 13. Moreover, the row address XADD is supplied also to a refresh address control circuit 40.


The command terminals 22 are the terminals to which command signals COM are input from outside. The command signals COM are supplied to a command decoder 34 via a command input circuit 33. The command decoder 34 is a circuit which generates various internal commands by decoding the command signals COM. Examples of the internal commands include active signets ACT, pre-charge signals Pre, read/write signals R/W, and refresh signals AREF.


The active signal ACT is a pulse signal which is activated when the command signal COM is indicating row access (active command). When the active signal ACT is activated, the row decoder 12 of a specified bank address is activated. As a result, the word line WL specified by the row address XADD is selected and activated. The pre-charge signal Pre is a pulse signal which is activated when the command signal COM is indicating pre-charge. When the pre-charge signal Pre is activated, the row decoder 12A of the specified bank address and the word line WL specified by the row address XADD controlled thereby are deactivated.


The read/write signal RAN is a pulse signal which is activated when the command signal COM is indicating column access (read command or write command). When the read/write signal RAN is activated, the column decoder 13 is activated. As a result, the bit line BL specified by the column address YADD is selected. Therefore, if the active command and the read command are input and if the row address XADD and the column address YADD are input in synchronization with them, read data is read from the memory cell MC specified by the row address XADD and the column address YADD. The read data DQ is output from the data terminal 24 to outside via a sense amplifier SAMP, a transfer gate TG, the read/write amplifier 14, and an input/output circuit 15.


On the other hand, if the active command and the write, command are input, if the row address XADD and the column address YADD are input in synchronization with them, and, then, if write data DQ is input to the data terminal 24, the write data DQ is supplied to the memory cell array 11 via the input/output circuit 15, the read/write amplifier 14, the transfer gate TG, and the sense amplifier SAMP and is written to the memory cell MC specified by the row address XADD and the column address YADD.


The refresh signal AREF is a pulse signal which is activated when the command signal COM is indicating an auto-refresh command. Also, when the command signal COM is indicating a self-refresh entry command, the refresh signal AREF is activated, is activated once immediately after command input, thereafter, is cyclically activated at desired internal timing, and a refresh state is continued. By a self-refresh exit command thereafter, the activation of the refresh signal AREF is stopped and returns to an IDLE state. The refresh signal AREF is supplied to the refresh address control circuit 40. The refresh address control circuit 40 supplies a refreshing row address RXADD to the row decoder 12A, thereby activating the predetermined word line WL contained in the memory cell array 11, thereby refreshing the information of the corresponding memory cell MC. Other than the refresh signal AREF, the active signal ACT, the row address XADD, etc. are supplied to the refresh address control circuit 40. Details of the refresh address control circuit 40 will be described later.


External clock signals CK and /CK are input to the clock terminals 23. The external clock signals CK and the external clock signals /CK are mutually complementary signals, and both of them are supplied to the clock input circuit 35. The clock input circuit 35 generates internal clock signals ICLK based on the external clock signals CK and /CK. The internal clock signals ICLK are supplied to the command decoder 34, an internal clock generator 36, etc. The internal clock generator 36 generates internal clock signals LCLK, which control the operation timing of the input/output circuit 15.


The data mask terminals 25 are the terminals to which data mask signals DM are input. When the data mask signal DM is activated, overwrite of corresponding data is prohibited.


The power supply terminals 26 are the terminals to which power supply potentials VDD and VSS are supplied. The power supply potentials VDD and VSS supplied to the power supply terminals 26 are supplied to a voltage generator 37. The voltage generator 37 generates various internal potentials VPP, VOD, VARY, VPERI, etc. based on the power supply potentials VDD and VSS. The internal potential VPP is the potential mainly used in the row decoder 12A, the internal potentials VOD and VARY are the potentials used in the sense amplifier SAMP in the memory cell array 11, and the internal potential VPERI is the potential used in many other circuit blocks.


The power supply terminals 27 are the terminals to which power supply potentials VDDQ and VSSQ are supplied. The power supply potentials VDDQ and VSSQ supplied to the power supply terminals 27 are supplied to the input/output circuit 15. The power supply potentials VDDQ and VSSQ are the same potentials as the power supply potentials VDD and VSS, respectively, which are supplied to the power supply terminals 26. However, the dedicated power supply potentials VDDQ and VSSQ are used for the input/output circuit 15 so that power supply noise generated by the input/output circuit 15 does not propagate to other circuit blocks.


A memory 10 in accordance with the present disclosure typically receives a sequential series of refresh commands that, when processed by the refresh address control circuit 40 and other components of the memory 10, operate to refresh the memory cell array 11 block by block. For example, a first refresh command may be received that is directed to refreshing word lines WL in a first address block, a second refresh command may be received that is directed to refreshing word lines WL in a second address block, and so on. As used herein, an “address block” refers to a sequential group of memory locations that may be accessed by addressing a particular memory location in the address block such as the first memory location. The series of refresh commands continues in this way until all word lines WL have been refreshed. Once all word lines WL have been refreshed, a new sequential series of refresh commands is initiated, beginning again with the first refresh command.


The externally generated refresh commands do not generally occur one after the other, but rather are interleaved with other commands issued to the memory 10. Here, commands may be issued to a memory 10 in a sequence with slots in the sequence being allocated for a refresh command. The refresh command slots may occur with a frequency that allows one sequential series of refresh commands to be completed within a predetermined refresh cycle time. The refresh cycle time may be determined based on the frequency with which a cell must be refreshed in order to preserve data.


The refresh cycle time may be defined in a way that allows for row hammer refresh events to occur in the memory 10. In row hammer refresh events, certain refresh command slots may be used for a row hammer refresh command instead of for a sequential refresh command. In this way, refresh command slots may be “stolen” periodically for row hammer refresh operations. The rate with which refresh command slots are stolen may vary depending on the implementation. For example, a refresh command slot may be stolen once every 17th refresh command slot, once every 9th refresh command slot, once every 5th refresh command slot, and so on.


The refresh address control circuit 40 is generally configured to provide the refreshing row address RXADD that specifies a particular word line to be refreshed. In one respect, the refresh address control circuit 40 provides the refreshing row address RXADD responsive to sequential refresh commands received from an external controller outside of the memory 10. The refresh address control circuit 40 may additionally be configured to “steal” or otherwise preempt a refresh command received from the external controller and replace that refresh command with a row hammer refresh command. Here, the refresh address control circuit 40 provides the refreshing row address RXADD responsive to a row hammer refresh event. As shown in FIG. 1, the memory 10 may receive a RHR_Token signal that is provided as input to the refresh address control circuit 40. The RHR_Token signal is typically provided by a controller that is external to the memory 10. When the RHR_Token signal is asserted by the external controller, the refresh address control circuit 40 is allowed to proceed with a row hammer refresh event if one is called for based on internal timing and programming. If the RHR_Token signal is not asserted by the external controller, the refresh address control circuit 40 execute refresh commands as they are received from the external controller.



FIG. 2 is a schematic illustration of an example, refresh address control circuit 200 in accordance with the present disclosure. The refresh address control circuit 200 of FIG. 2 may implement the address control circuit 40 of FIG. 1. As shown in FIG. 2, the refresh address counter 200 may include a “CAS before RAS” (CBR) circuit 204 that is generally configured to count through a series of memory addresses responsive to a refresh command received from an external controller. A refresh command received by the memory 10 typically includes an address within the memory cell array 11 (FIG. 1) that corresponds to the beginning of the address block to be refreshed. The CBR circuit 204 provides an incremental sequence of refresh addresses beginning with the first address provided by the externally generated refresh command. As indicated in FIG. 2, the CBR circuit 204 provides a CBR signal as output.


The refresh address counter 200 may additionally include a row hammer refresh (RHR) counter 208 that is generally configured to “steal” a refresh command received from the external controller and replace that refresh command with a row hammer refresh command. The RHR counter 208 may reference the current state of the CBR circuit 204 in determining the timing for stealing the refresh command. Thus, the RHR counter 208 may receive as input the CBR signal, which is output from the CBR circuit 204. The RHR_Token signal may be provided as input to RHR counter 208 so as to enable its command stealing functionality. As mentioned, the refresh address control circuit 200 may be enabled to steal a refresh command when the refresh address control circuit 200 is in possession of a refresh token provided by an external controller. More specifically, the refresh address control circuit 200 may be enabled to steal a refresh command when the RHR_Token signal received by the refresh address control circuit 200 is asserted by the external controller. When the RHR counter 208 determines based on its inputs that a row hammer refresh event should occur, the RHR counter 208 asserts the RHR_ModeF signal. The RHR_ModeF signal is then provided as output from the RHR counter 208.


The refresh address counter 200 may additionally include a refresh address output circuit 212. The refresh address output circuit 212 may be configured to receive the CBR signal and the RHR_ModeF signal as input. When not in row hammer refresh mode, the address output circuit 212 passes through the memory address provided by the CBR signal. When in row hammer refresh mode, the address output circuit 212 provides a row hammer address according to its own internal calculations. Embodiments in accordance with the present disclosure may determine that a particular word line is hammered via various mechanisms. In one example, probabilistic methods may be used to track hammer addresses. In other examples, disturb counters or similar mechanisms may be used to track hammer addresses. More generally, any currently existing or later developed methods for determined a hammered word line may be used.



FIG. 3 is a schematic illustration of an CBR circuit 300 in accordance with the present disclosure. The CBR circuit 300 of FIG. 3 may be used to implement the CBR circuit 204 of FIG. 2. The CBR circuit 300 may include a chain 302 of flip-flops 304a-f coupled together via plurality of inverters 308a-f that function as feedback elements. By way of example and not limitation, the CBR circuit 300 includes six D flip-flops 304a-f and six feedback inverters 308a-f. Each flip-flop 304a-f provides one bit in a memory address used to refresh a block of memory addresses. The first flip flop 304a is coupled at its input to a NAND gate 312 that provides the initial input to the flip-flop chain 302. The output of the NAND gate 312 is directly coupled to the CLK input of the first flip flop 304a and coupled to the CLKf input of the first flip flop 304a through an inverter 316. Inputs to the NAND gate 312 may include a first bit signal 320 and a RHR_ModeF signal 324. As shown in greater detail in FIG. 2, the RHR_ModeF signal 324 may be provided as output from the RHR counter 208.


The first flip flop 304a is coupled to the second flip flop 304b such that the Q output of the first flip flop 304a is coupled to the CLKf input of the second flip flop 304b. The Q output of the first flip flop 304a is also coupled to the CLK input of the second flip flop 304b through the first inventor 308a. The first inverter 308a also provides a feedback path such that the Q output of the first flip flop 304a is coupled through the first inverter 308 to the input of the first flip flop 304a. Additional adjacent flip flops that are further downstream in the flip flop chain 302 are coupled together in a manner similar to the coupling between the first flip flop 304a and the second flip flop 304b. For example, the Q output of the second flip flop 304b is coupled directly to CLKf input of the third flip flop 304c and through the second inverter 308b to the CLK input of the third flip flop 304c and the D input of the second flip flop 304b, and so on.


The flip flop chain 302 additionally includes R and S lines that connect to the R and S inputs of the various flip flops 304a-f in the flip flop chain 302. The R and S lines may be asserted to set and/or reset the flip flops on start up or otherwise as appropriate.


The CBR circuit 300 may be generally configured to count through a series of internal memory addresses responsive to a refresh command received from the external controller. The Q output of each of the flip flops 304a-f provides one bit of an internal memory address. The CBR signal provided by the CBR circuit 300 may represent the internal memory addresses. The first bit signal 320 that provides input to the NAND gate 312 may toggle between a logical one state and a logical zero state. This toggling between one and zero may lead to a subsequent toggle of the flip flops 304a-f in the flip flop chain 302 through the configuration described above such that a counter function is implemented. For example, when the initial bit line 320 toggles from one to zero, the first flop 304a toggles from zero to one. When the first flip flop 304a toggles from one to zero, the second flip flop 304b toggles from zero to one. Through these transitions, the flip flop chain 302 counts through a series of binary values as follows: “000000”, “100000”, “010000”, “110000” “111111”. As previously discussed, the binary values may represent memory addresses.


The CBR circuit 300 may supply internal memory addresses for refresh commands. In one embodiment, the CBR circuit 300 is configured such that the first and second bits of the flip flop chain 302 correspond to the A<13:12> signals of the internal address bus. Through the operation of the CBR circuit 300, the A<13:12> signals cycle through four different states 00, 10, 01, and 11 within a single command. In this way, a single refresh command is sub divided into 4 internal events with different most significant bit (MSB) addresses. During a row hammer refresh event, the RHR_ModeF signal 324 may be asserted, for example, by the RHR counter 204 shown in FIG. 2. As mentioned, RHR_ModeF signal 324 may be provided as input to the NAND gate 312 that provides the initial input to the flip-flop chain 302. When RHR_ModeF is asserted, the NAND gate 312 outputs a logical zero regardless of the state of the first bit signal 320, which provides the other input to the NAND gate 312. In this state, the NAND gate 312 is effectively disabled from passing the first bit signal to the flip-flop chain 302. Thus, when the RHR_ModeF signal is asserted, the CBR circuit 300 is stalled.



FIG. 4 is a schematic illustration of an RHR counter 400 in accordance with the present disclosure. The RHR counter 400 may be the RHR counter 208 shown in FIG. 2. The RHR counter 400 may include a multiplexer 404 that receives as input at least a portion of the CBR signal output from the CBR circuit 208. Typically, the multiplexer 404 receives the least significant bits of the CBR signal as input. A programmable selector signal tmfzRHR may be additionally provided as input to multiplexer 404. The multiplexer 404 is generally configured to select a particular bit of the CBR signal to be used to trigger a refresh command steal. More specifically, input from the programmable selector signal tmfzRHR selects a particular bit from the CBR signal. The selected CBR signal bit is then passed through to the output of the multiplexer 404. As output from the multiplexer 404, the selected CBR signal bit is then used to initiate a steal cycle for the next memory refresh.


The programmable selector signal tmfrRHR selects a particular rate at which refresh commands are stolen for a row hammer refresh operation. For example, the programmable selector signal tmfzRHR signal selecting the second most LSB of the CBR signal results in a row hammer refresh operation occurring after 4 sequential refreshes, the programmable selector signal tmfzRHR signal selecting the third most LSB of the CBR signal results in a row hammer refresh operation occurring after 8 sequential refreshes, and so on. In this way, the multiplexer 404 provides a 1:N steal rate counting, where N=5, 9, 17, and so on.


The RHR counter may further include a timeout circuit 408. The timeout circuit 408 may receive a CBRCNT signal as input. The CBRCNT signal may be provided from the refresh address output circuit 212 or other components. The CBRCNT signal may be used to specify a row hammer refresh cycle time. The timeout circuit 408 may additionally receive as input the RHR_ModeF signal, which signal is fed back from the output of the RHR counter 208. The timeout circuit 408 is generally configured to provide an output signal HammerCountStopF that triggers a row hammer refresh timeout. The timeout circuit 408 begins a count cycle when the RHR_ModeF signal is asserted indicating the beginning of row hammer refresh operation. The timeout circuit 408 then counts down from the value indicated by the CBRCNT signal. When the timeout circuit 408 counts down to zero, the timeout circuit 408 asserts that HammerCountStopF signal so to indicate an end of the row hammer refresh operation.


The latch 412 is generally configured to provide a handoff between sequential refresh operations and row hammer refresh operations. The latch 412 includes a first NAND gate 416 that is coupled to the multiplexer 404 and a second NAND gate 420 that is coupled to the timeout circuit 408. The latch 412 provides an output, which is labelled in FIG. 4 as HammerCountEn. The latch 412 asserts the HammerCountEn signal when the multiplexer 404 indicates the beginning of a row hammer refresh operation. The HammerCountEn signal remains asserted as the row hammer refresh operation executes. When the timeout circuit 408 asserts the HammerCountStopF signal indicating the end of a row hammer refresh operation, the latch 412 toggles so as to de-assert the HammerCountEn signal.


The RHR counter 400 may additionally include a flip flop 424 coupled to the output of the latch 412. The flip flop 424 may be configured to latch and hold the value of the HammerCountEn on a refresh command basis. The flip flop 424 may be a D type flip flop in one embodiment. The flip flop 424 may be clocked by an AREF signal that indicates a refresh command. The output of the flip flop 424 is provided to the output of the RHR counter 404 through an XOR gate 428. The XOR gate 428 is configured to also receive the RHR_Token signal as an input. When the RHR_Token signal is asserted, the XOR gate passes the HammerCountEn signal to the output of the RHR counter 400.


The number of rows refreshed in a row hammer refresh operation may be specified by the CBRCNT signal shown in FIG. 4. Row hammer refresh operations typically refresh fewer rows than sequential refresh commands. For example, in a 32 millisecond refresh, a typical sequential refresh command refreshes 256 word lines WL per refresh command. In contrast, a typical row hammer refresh event only refreshes 18-32 word lines WL. Because row hammer refresh operations refresh fewer word lines WL, row hammer refresh operations typically consume less power. Continuing with the 32 millisecond refresh example, refreshing 16 hammered word lines instead of the 256 rows that would be refreshed in a sequential refresh command results in an approximately 75% reduction in power consumption.


The memory device may be organized into groups of memories such that only one group at a time executes a row hammer refresh operation. For example, each group of memories may be assigned a different delay. Once a particular memory reaches the time for a row hammer refresh operation, the memory may wait its assigned delay amount before stealing a refresh command slot for a row hammer refresh operation. Thus, the various memories may steal refresh command slots at the same rate, but execute the operation at different time due to the various delays.



FIG. 5A is a schematic illustration of a memory device 500 in accordance with the present disclosure that uses a token bus configuration to control scheduling of row hammer events across the various memories 504a-536d of the memory device 500. The memory device 500 includes a controller 538 coupled to a plurality of memory devices 504a-536d through an example token bus 540. The controller 538 may include a N-bit shift register 544 that is configured to provide output to the token bus 540. The memory 10 of FIG. 1 may be used to implement the various memories 504a-536d associated with the memory device 500. The number of memories 504a-536d that are coupled to a controller 538 through the token bus 540 may depend on the implementation. The example token bus 540 of FIG. 5A couples the controller 538 to thirty-two memories 504a-536d by way of example and not limitation.


As shown in FIG. 5A, the example thirty-two memories 504a-536d are organized into groups of four memories. This grouping is shown by way of example and not limitation. The number of memories included within a group of memories may vary depending on the implementation. The token bus 540 of FIG. 5A includes nine token signals RHR_Token_0 through RHR_Token_8. Each token signal is associated with a particular group of memories. For example, the first token signal RHR_Token_0 is associated with the first group 548a of four memories 504a-d, the second token signal RHR_Token_1 is associated with the second group 548b of four memories 508a-d, and so on. In operation, the controller 538 asserts one token signal at a time. When a particular token signal is asserted, the particular memory group coupled to the asserted token line has possession of the token controlled by the token bus 540. When a particular group of memories has possession of the token controlled by the token bus 540, the various memories in the group of memories may proceed with a row hammer refresh operation.



FIG. 5B is a schematic illustration of another memory device 501 in accordance with the present disclosure that uses a token bus configuration to control scheduling of row hammer events across the various memories of the memory device. In FIG. 5A, a token for each group 548a-548i is provided by the controller 538. In contrast, in the embodiment of FIG. 5B, a token is self-generated in each of the groups 548a-548i in a non-overlapping manner. In the configuration of FIG. 5B, the controller 538 is not required to manage the token. Additionally, a plurality of buses for different tokens is not used. For example, a group 546a may be programmed (by a fuse in one embodiment) to be the first group to perform a row hammer refresh; a group 548b may be programmed to be the second group to perform a row hammer refresh; a group 548c may be programmed to be the third group to perform a row hammer refresh; and so on. In this way, the memory groups 548a-548i perform row hammer refreshes in an order that is generally indicated by the arrow 552 shown in FIG. 5B. Each may memory group 548a-548i may perform a row hammer refresh once per refresh interval. In one embodiment, the refresh interval may be defined by the AREF cycle. This aspect of the present disclosure is discussed in more detail with in connection with FIG. 8.



FIG. 6 is a schematic illustration of an example an N-bit shift register 600 in accordance with the present disclosure. The N-bit shift register 600 of FIG. 6 may be used to implement the N-bit shift register 544 of FIG. 5. The N-bit shift register 600 may be generally configured to hold the RHR refresh token and to provide the token as output to the token bus 540 shown in FIG. 5. The N-bit shift register 600 includes a plurality of shift register cells 604(0)-604(n) arranged in a series configuration, where “n” is a non-zero, positive number. The N-bit shift register 600 includes a first shift register cell 604(0) having an output coupled to the input of a second shift register cell 604(1). The output of the second shift register cell 604(1) is coupled to the input of a third shift register cell 604(2) (not shown in FIG. 6). Additional shift register cells are coupled together in this manner such that the various cells form a chain beginning with the first shift register cell 604(0) and ending with the Nth shift register cell 604(n). The chain of cells may be circular such that the output of the Nth shift register cell 604(n) is coupled to the input of the first shift register cell 604(0).


Each shift register cell 604(0)_604(n) of the N-bit shift register 600 may include a CLK input. The N-bit shift register 600 may be configured to advance the RHR refresh token from one shift register cell to another on a particular edge of a clock signal. A shift register cell may be clocked with the AREF signal shown in FIG. 1. Through clocking by the AREF signal, the token moves from one memory to another memory responsive to a refresh command as shown in FIG. 8.) For example, if on a particular AREF edge the RHR refresh token is held by the first shift register cell 604(0), the AREF edge may cause the RHR refresh token to pass to the second shift register cell 604(1). The RHR refresh token may be advanced on the rising edge or the falling edge of AREF signal depending on the implementation. Each shift register cell 604(0)-604(n) may additionally be provided with input from a tmfzIDD5 signal that is generally configured to set an initial position or the RHR refresh token along the N-bit shift register 600.



FIG. 7 is a schematic illustration of an example shift register cell 700. The example shift register cell 700 of FIG. 7 may be used to implement the various, shift, register cells 604(0)-604(n) shown in FIG. 6. The example shift register cell 700 of FIG. 7 may include a D type flip flop 704 that functions as the storage element for the cell 700. The D input of the flip flop 704 may function as the input of the shift register cell 700. Similarly, the output may function as the output of the shift register cell 700. The shift register cell 700 may include a CLK input that functions as described in connection with FIG. 6. As additionally shown in FIG. 6B, a shift register cell 700 may be provided with an inverse clock signal that is coupled to a CLKf input of the flip flop 704. As also shown in FIG. 7, the tmfzIDD5 signal may be provided to the S input of the flip flop 704 through a series of logic gates that includes NAND gate 708 and OR gate 712. The shift register cell 700 may additionally include a RESET signal that is provided to the R input of the flip flop 704. The RESET signal may be asserted to reset the flip flop 704 when needed such as on power-up.



FIG. 8 is a timing diagram 800 that illustrates the timing of various row hammer refresh events across an example memory device in accordance with the present disclosure. The timing diagram 800 references the memory device 500 shown in FIG. 5 by way of example and not limitation. As mentioned, the memory device 500 includes thirty-two memories 504a-536d organized into memory groups 548a-i that have four memories to a group. Each memory 504a-536d includes an RHR counter 400 that asserts an RHR_ModeF signal when the memory is stealing a refresh command so as to execute a row hammer refresh operation rather than a sequential memory refresh operation. FIG. 8 includes certain ones of these RHR_ModeF signals so as to illustrate the distribution of row hammer refresh events across the memory device 500. More specifically, FIG. 8 includes one RHR_ModeF signal per group 548a-i of four memories.


Through a token provided over a token bus 540, the controller 500 may be configured to enable one memory group 548a-i at a time to steal a refresh command for a row hammer refresh operation. In order to simply the diagram 800, one RHR_ModeF signal per memory groups 548a-i is shown in FIG. 8. For example, FIG. 8 includes a first row hammer mode signal RHR_ModeF_1 corresponding to the RHR_ModeF signal of memory 504a. Memory 504a is a member of memory group 548a, which additionally includes memories 504b-c. Because memories 504b-c have RHR_modeF signals that are asserted as the same time as memory 504a, the RHR_modeF signals for memories 504b-c are omitted form FIG. 8 in order to simply the drawing.



FIG. 8 additionally includes signal traces for the additional memory groups 548b-i. A second row hammer mode signal RHR_ModeF_2 corresponds to the RHR_ModeF signal of memory 508a in memory group 548b. A third row hammer mode signal RHR_ModeF_3 corresponds to the RHR_ModeF signal of memory 512a in memory group 548c. A fourth row hammer mode signal RHR_ModeF_4 corresponds to the RHR_ModeF signal of memory 516a in memory group 548d. A fifth row hammer mode signal RHR_ModeF_5 corresponds to the RHR_ModeF signal of memory 520a in memory group 548e. A sixth row hammer mode signal RHR_ModeF_6 corresponds to the RHR_ModeF signal of memory 524a in memory group 548f. A seventh row hammer mode signal RHR_ModeF_7 corresponds to the RHR_ModeF signal of memory 528a in memory group 548g. An eighth row hammer mode signal RHR_ModeF_8 corresponds to the RHR_ModeF signal of memory 532a in memory group 548h. A ninth row hammer mode signal RHR_ModeF_9 corresponds to the RHR_ModeF signal of memory 536a in memory group 548i.



FIG. 8 additionally includes signal traces for certain signals that may be issued by the controller 500 and received by the various memories 504a-536d of the memory device 500. Certain of the signals may be shown in greater detail in FIG. 1. FIG. 8 includes an ACT signal asserted by the controller 500 to indicate an active signal. FIG. 8 also includes a Rfsh signal asserted by the controller 500 on the COM signals to indicate a refresh command. FIG. 8 also includes a AREF signal that corresponds to a refresh command executing on the memory device 500.


In operation, the controller 538 issues a series of refresh commands to the various memories 504a-536d. In FIG. 8, these refresh commands correspond to the asserted portions of the AREF signal. When a particular memory receives a refresh command, the memory will determine if the refresh command should be executed as a sequential refresh operation or if the refresh command should be stolen so as to execute a row hammer refresh command. Whether or not a refresh command is stolen will depend on both the calculated timing for a row hammer refresh operation and possession of the refresh token. Generally, a memory will determine, at a particular point during a predetermined refresh cycle, that a row hammer refresh operation is scheduled to occur. In addition, once the memory determines that a row hammer refresh is scheduled to occur, the memory will hold off from executing the row hammer refresh operation until the memory possesses the token issued by the controller 500.


The additional step of holding off from executing the row hammer refresh event until the token is received may be used to cause the various memories 504a-536d to execute row hammer refresh operations at different times. The aspect of the present disclosure is illustrated in FIG. 8. In FIG. 8, a 1:9 steal rate is illustrated by way of example and not limitation. The particular steal used may depend on the implementation. For example, other steal rates such as 1:5 and 1:17 may be used. Each memory 504a-536d may calculate the time for a row hammer refresh operation as occurring at time T1. However, it may be the case that only memories 504a-d in memory group 548a have possession of the token at time T1. Thus, as shown in FIG. 8, memory 504a asserts its RHR_ModeF signal at T1, while memories 508a-536a do not.


As the token is passed between the memories 504a-536d, each memory enabled to steal a refresh command for a row hammer refresh operation. Thus, as shown in FIG. 8, memory 508a asserts its RHR_ModeF signal at time T2, while memories 504a and 512a-536a do not. Memory 512a asserts its RHR_ModeF signal at time T3, while memories 504a-508a and 516a-536a do not. Memory 516a asserts its RHR_ModeF signal at time T4, while memories 504a-512a and 520a-536a do not. Memory 520a asserts its RHR_ModeF signal at time T5, while memories 504a-516a and 524a-536a do not. Memory 524a asserts its RHR_ModeF signal at time T6, while memories 504a-520a and 528a-536a do not. Memory 528a asserts its RHR_ModeF signal at time T7, while memories 504a-524a and 532a-536a do not. Memory 532a asserts its RHR_ModeF signal at time T8, while memories 504a-526a and 536a do not. Memory 536a asserts its RHR_ModeF signal at time T9, while memories 504a-532a do not.


By distributing row hammer refresh events across the memory device 500 as shown in FIG. 8, peak power consumption may be reduced. This reduction in peak power consumption may be due to the smaller power consumption that occurs in a row hammer refresh operation. For example, in 32 ms refresh, 256 (×8) rows are fired per command, in a row hammer refresh event, only 16-32 rows need to be fired. Referring to FIG. 8, at time T1, fewer rows are refreshed by memory 504a than are refreshed by memories 508a-536a. At time T2, fewer rows are refreshed by memory 508a than are refreshed by memories 504a and 512a-536a, and so on. As shown in FIG. 8, the memory device 500 may be programmed such that at least one memory is executing the lower power row hammer refresh operation during the time allotted for given refresh command. Power consumption is thereby reduced for each refresh command. Thus, overall peak power may be reduced.


Embodiments of the present disclosure allow each memory associated with a memory device to program which refresh in a given refresh cycle fires a row hammer refresh event. As described above, various refresh cycles times may be defined such as every 5th refresh command, every 9th refresh command, every 17th refresh command. By programming a memory device such that row hammer refresh events are distributed across the memory device, the peak idd5 current at a memory device level can be reduced by almost 1/(steal rate). For example, refreshing 16 row hammer refresh rows instead of 256 rows may result in a 75% IDD reduction. On a DIMM, including up to 36 DRAM devices, embodiments in accordance with the present disclosure can reduce peak idd5 demand by evenly distributing the steals across different commands. For example, steal 1:9 and 36 chips could have 4 chips stealing every refresh command instead of 36 chips stealing every 9th refresh command. Accordingly, in some embodiments, peak, power reduction of approximately 8.6% may be obtained.


The above specification, examples and data provide a complete description of the structure and use of exemplary embodiments of the invention as defined in the claims. Although various embodiments of the claimed invention have been described above with a certain degree of particularity, or with reference to one or more individual embodiments, those skilled in the art could make numerous alterations to the disclosed embodiments without departing from the spirit or scope of the claimed invention. Other embodiments are therefore contemplated. It is intended that all matter contained in the above description and shown in the accompanying drawings shall be interpreted as illustrative only of particular embodiments and not limiting. Changes in detail or structure may be made without departing from the basic elements of the invention as defined in the following claims.


The foregoing description has broad application. The discussion of any embodiment is meant only to be explanatory and is not intended to suggest that the scope of the disclosure, including the claims, is limited to these examples. In other words, while illustrative embodiments of the disclosure have been described in detail herein, the inventive concepts may be otherwise variously embodied and employed, and the appended claims are intended to be construed to include such variations, except as limited by the prior art.

Claims
  • 1. An apparatus, comprising: a first memory configured to receive a sequential series of refresh commands and to replace a first of the sequential refresh commands with a row hammer refresh operation;a second memory configured to receive the sequential series of refresh commands and to replace a second of the sequential refresh command with a row hammer refresh operation;wherein the first of the sequential refresh commands and the second of the sequential refresh commands are different commands.
  • 2. The apparatus of claim 1, wherein: the first memory is further configured to execute a sequential refresh operation responsive to the second of the sequential refresh command; andthe second memory is further configured to execute a sequential refresh operation responsive to the first of the sequential refresh command.
  • 3. The apparatus of claim 2, wherein: the row hammer refresh operation executed by the first memory refreshes fewer memory cells than the sequential refresh operation executed by the first memory; andthe row hammer refresh operation executed by the second memory refreshes fewer memory cells than the sequential refresh operation executed by the second memory.
  • 4. The apparatus of claim 1, wherein: the first memory is a member of a first group of memories, wherein each memory of the first group of memories is configured to replace the first of the sequential refresh commands with a row hammer refresh operation; andthe second memory is a member of a second group of memories, wherein each memory of the second group of memories is configured to replace the second of the sequential refresh commands with a row hammer refresh operation.
  • 5. The apparatus of claim 1, further comprising: a controller coupled to both the first and second memory devices and configured to issue the sequential series of refresh commands to the first and second memory devices; whereinthe first memory device is enabled to replace the first of the sequential refresh commands with a row hammer refresh operation when the first memory device possess a token and the second memory device does not possess the token; andthe second memory device is enabled to replace the second of the sequential refresh commands with a row hammer refresh operation when the second memory device possess the token and the first memory device does not possess the token.
  • 6. The apparatus of claim 5, wherein the controller is further configured to pass the token between at least the first and second memory devices and comprises an N-bit shift register coupled to a token bus that provides the token to at least the first and second memory devices.
  • 7. The apparatus of claim 5, wherein the first memory device comprises: an address counter circuit configured to output a series of internal memory addresses responsive to a refresh command received from the controller;a row hammer refresh counter coupled to the address counter and configured to receive the token, the row hammer refresh counter further configured to stall the address counter on a row hammer refresh event;wherein the row hammer refresh counter stalls the address counter only when the row hammer refresh circuit possesses the token.
  • 8. The apparatus of claim 7, wherein the row hammer refresh counter receives at least a portion of the internal memory addresses as input, the row hammer refresh counter configured to the trigger row hammer refresh operation based on the at least a portion of the internal memory addresses.
  • 9. A method comprising: receiving a sequence of refresh commands at a first memory device and a second memory device;replacing a first of the sequence of refresh commands with a row hammer refresh operation in the first memory device;replacing a second of the sequence of refresh commands with a row hammer refresh operation in the second memory device, wherein the first and the second of the sequence of refresh commands are different ones of the sequence of refresh commands.
  • 10. The method of claim 9, further comprising determining the first and the second of the sequence of refresh commands based, in part, on a time when a token is possessed by the first memory device and second memory device respectively, wherein the time the token is possessed by the first memory is non-overlapping with a time the token is possessed by the second memory.
  • 11. The method of claim 10, wherein the first memory device and the second memory device are configured to generate the token.
  • 12. The method of claim 10, wherein the first memory device and the second memory device are configured to receive the token from a controller.
  • 13. The method of claim 9, further comprising: performing a CAS before RAS (CBR) refresh operation responsive to the second of the sequence of refresh commands with the first memory device; andperforming a CBR refresh operation responsive to the first of the sequence of refresh commands with the second memory device.
CROSS-REFERENCE TO RELATED APPLICATION(S)

This application is a divisional of pending U.S. patent application Ser. No. 15/419,590 filed Jan. 30, 2017. The aforementioned application is incorporated herein by reference, in its entirety, for any purpose.

US Referenced Citations (439)
Number Name Date Kind
5299159 Balistreri et al. Mar 1994 A
5654929 Mote, Jr. Aug 1997 A
5699297 Yamazaki et al. Dec 1997 A
5867442 Kim et al. Feb 1999 A
5933377 Hidaka Aug 1999 A
5943283 Wong et al. Aug 1999 A
5956288 Bermingham et al. Sep 1999 A
5959923 Matteson et al. Sep 1999 A
5970507 Kato et al. Oct 1999 A
5999471 Choi Dec 1999 A
6002629 Kim et al. Dec 1999 A
6011734 Pappert Jan 2000 A
6061290 Shirley May 2000 A
6064621 Tanizaki et al. May 2000 A
6212118 Fujita Apr 2001 B1
6306721 Teo et al. Oct 2001 B1
6310806 Higashi et al. Oct 2001 B1
6310814 Hampel et al. Oct 2001 B1
6363024 Fibranz Mar 2002 B1
6392952 Chen et al. May 2002 B1
6424582 Ooishi Jul 2002 B1
6434064 Nagai Aug 2002 B2
6452868 Fister Sep 2002 B1
6515928 Sato et al. Feb 2003 B2
6535950 Funyu et al. Mar 2003 B1
6567340 Nataraj et al. May 2003 B1
6950364 Kim Sep 2005 B2
7002868 Takahashi Feb 2006 B2
7057960 Fiscus et al. Jun 2006 B1
7082070 Hong Jul 2006 B2
7187607 Koshikawa et al. Mar 2007 B2
7203113 Takahashi et al. Apr 2007 B2
7203115 Eto et al. Apr 2007 B2
7209402 Shinozaki et al. Apr 2007 B2
7215588 Lee May 2007 B2
7444577 Best et al. Oct 2008 B2
7551502 Dono et al. Jun 2009 B2
7692993 Iida et al. Apr 2010 B2
7830742 Han Nov 2010 B2
8174921 Kim et al. May 2012 B2
8400805 Yoko Mar 2013 B2
8572423 Isachar et al. Oct 2013 B1
8625360 Iwamoto et al. Jan 2014 B2
8681578 Narui Mar 2014 B2
8811100 Ku Aug 2014 B2
8862973 Zimmerman et al. Oct 2014 B2
8938573 Greenfield et al. Jan 2015 B2
9032141 Bains et al. May 2015 B2
9047978 Bell et al. Jun 2015 B2
9076499 Schoenborn et al. Jul 2015 B2
9087602 Youn et al. Jul 2015 B2
9117544 Bains et al. Aug 2015 B2
9123447 Lee et al. Sep 2015 B2
9153294 Kang Oct 2015 B2
9190139 Jung et al. Nov 2015 B2
9236110 Bains et al. Jan 2016 B2
9251885 Greenfield et al. Feb 2016 B2
9286964 Halbert et al. Mar 2016 B2
9299400 Bains et al. Mar 2016 B2
9311984 Hong et al. Apr 2016 B1
9311985 Lee et al. Apr 2016 B2
9324398 Jones et al. Apr 2016 B2
9384821 Bains et al. Jul 2016 B2
9396786 Yoon et al. Jul 2016 B2
9406358 Lee Aug 2016 B1
9412432 Narui et al. Aug 2016 B2
9418723 Chishti et al. Aug 2016 B2
9424907 Fujishiro Aug 2016 B2
9484079 Lee Nov 2016 B2
9514850 Kim Dec 2016 B2
9570143 Lim et al. Feb 2017 B2
9570201 Morgan et al. Feb 2017 B2
9646672 Kim et al. May 2017 B1
9653139 Park May 2017 B1
9672889 Lee et al. Jun 2017 B2
9685240 Park Jun 2017 B1
9691466 Kim Jun 2017 B1
9697913 Mariani et al. Jul 2017 B1
9734887 Tavva Aug 2017 B1
9741409 Jones et al. Aug 2017 B2
9741447 Akamatsu Aug 2017 B2
9747971 Bains et al. Aug 2017 B2
9761297 Tomishima Sep 2017 B1
9786351 Lee et al. Oct 2017 B2
9799391 Wei Oct 2017 B1
9805782 Liou Oct 2017 B1
9805783 Ito et al. Oct 2017 B2
9812185 Fisch et al. Nov 2017 B2
9818469 Kim Nov 2017 B1
9831003 Sohn et al. Nov 2017 B2
9865326 Bains et al. Jan 2018 B2
9865328 Desimone et al. Jan 2018 B1
9922694 Akamatsu Mar 2018 B2
9934143 Bains et al. Apr 2018 B2
9953696 Kim Apr 2018 B2
9978430 Seo et al. May 2018 B2
10020045 Riho Jul 2018 B2
10020046 Uemura Jul 2018 B1
10032501 Ito et al. Jul 2018 B2
10049716 Proebsting Aug 2018 B2
10083737 Bains et al. Sep 2018 B2
10090038 Shin Oct 2018 B2
10134461 Bell et al. Nov 2018 B2
10141042 Richter Nov 2018 B1
10147472 Jones et al. Dec 2018 B2
10153031 Akamatsu Dec 2018 B2
10170174 Ito et al. Jan 2019 B1
10192608 Morgan Jan 2019 B2
10210925 Bains et al. Feb 2019 B2
10297305 Moon et al. May 2019 B1
10297307 Raad et al. May 2019 B1
10339994 Ito et al. Jul 2019 B2
10381327 Ramachandra et al. Aug 2019 B2
10446256 Ong et al. Oct 2019 B2
10468076 He et al. Nov 2019 B1
10490250 Ito et al. Nov 2019 B1
10504577 Alzheimer Dec 2019 B1
10510396 Notani et al. Dec 2019 B1
10572377 Zhang Feb 2020 B1
10573370 Ito et al. Feb 2020 B2
10607679 Nakaoka Mar 2020 B2
10685696 Brown et al. Jun 2020 B2
10699796 Benedict Jun 2020 B2
10790005 He et al. Sep 2020 B1
10825505 Rehmeyer Nov 2020 B2
10832792 Penney et al. Nov 2020 B1
10930335 Bell et al. Feb 2021 B2
10943636 Wu et al. Mar 2021 B1
10950289 Ito et al. Mar 2021 B2
10957377 Noguchi Mar 2021 B2
10964378 Ayyapureddi et al. Mar 2021 B2
10978132 Rehmeyer et al. Apr 2021 B2
11017833 Wu et al. May 2021 B2
11069393 Cowles et al. Jul 2021 B2
11081160 Ito Aug 2021 B2
20010008498 Ooishi Jul 2001 A1
20020026613 Niiro Feb 2002 A1
20020181301 Takahashi et al. Dec 2002 A1
20020191467 Matsumoto et al. Dec 2002 A1
20030026161 Yamaguchi et al. Feb 2003 A1
20030063512 Takahashi et al. Apr 2003 A1
20030067825 Shimano et al. Apr 2003 A1
20030081483 De Paor et al. May 2003 A1
20030123301 Jang et al. Jul 2003 A1
20030161208 Nakashima et al. Aug 2003 A1
20030193829 Morgan et al. Oct 2003 A1
20030231540 Lazar et al. Dec 2003 A1
20040004856 Sakimura et al. Jan 2004 A1
20040008544 Shinozaki et al. Jan 2004 A1
20040022093 Lee Feb 2004 A1
20040024955 Patel Feb 2004 A1
20040114446 Takahashi et al. Jun 2004 A1
20040130959 Kawaguchi Jul 2004 A1
20040184323 Mori et al. Sep 2004 A1
20040218431 Chung et al. Nov 2004 A1
20050002268 Otsuka et al. Jan 2005 A1
20050041502 Perner Feb 2005 A1
20050105362 Choi et al. May 2005 A1
20050108460 David May 2005 A1
20050213408 Shieh Sep 2005 A1
20050243627 Lee et al. Nov 2005 A1
20050265104 Remaklus et al. Dec 2005 A1
20060018174 Park et al. Jan 2006 A1
20060083099 Bae et al. Apr 2006 A1
20060087903 Riho et al. Apr 2006 A1
20060104139 Hur et al. May 2006 A1
20060176744 Stave Aug 2006 A1
20060215474 Hokenmaier Sep 2006 A1
20060233012 Sekiguchi et al. Oct 2006 A1
20060262616 Chen Nov 2006 A1
20060262617 Lee Nov 2006 A1
20060268643 Schreck et al. Nov 2006 A1
20070002651 Lee Jan 2007 A1
20070008799 Dona et al. Jan 2007 A1
20070014175 Min et al. Jan 2007 A1
20070028068 Golding et al. Feb 2007 A1
20070030746 Best et al. Feb 2007 A1
20070147154 Lee Jun 2007 A1
20070237016 Miyamoto et al. Oct 2007 A1
20070263442 Cornwell et al. Nov 2007 A1
20070297252 Singh Dec 2007 A1
20080028260 Oyagi et al. Jan 2008 A1
20080031068 Yoo et al. Feb 2008 A1
20080126893 Harrand et al. May 2008 A1
20080130394 Dono et al. Jun 2008 A1
20080181048 Han Jul 2008 A1
20080212386 Riho Sep 2008 A1
20080224742 Pomichter Sep 2008 A1
20080253212 Iida et al. Oct 2008 A1
20080253213 Sato et al. Oct 2008 A1
20080266990 Loeffler Oct 2008 A1
20080270683 Barth et al. Oct 2008 A1
20080306723 De Ambroggi et al. Dec 2008 A1
20080316845 Wang et al. Dec 2008 A1
20090021999 Tanimura et al. Jan 2009 A1
20090052264 Hong et al. Feb 2009 A1
20090059641 Jeddeloh Mar 2009 A1
20090073760 Betser et al. Mar 2009 A1
20090161468 Fujioka Jun 2009 A1
20090168571 Pyo et al. Jul 2009 A1
20090185440 Lee Jul 2009 A1
20090201752 Riho et al. Aug 2009 A1
20090228739 Cohen et al. Sep 2009 A1
20090251971 Futatsuyama Oct 2009 A1
20090296510 Lee et al. Dec 2009 A1
20100005376 Laberge et al. Jan 2010 A1
20100061153 Yen et al. Mar 2010 A1
20100074042 Fukuda et al. Mar 2010 A1
20100097870 Kim et al. Apr 2010 A1
20100110809 Kobayashi et al. May 2010 A1
20100110810 Kobayashi May 2010 A1
20100124138 Lee et al. May 2010 A1
20100128547 Kagami May 2010 A1
20100131812 Mohammad May 2010 A1
20100141309 Lee Jun 2010 A1
20100157693 Iwai et al. Jun 2010 A1
20100182862 Teramoto Jul 2010 A1
20100182863 Fukiage Jul 2010 A1
20100329069 Ito et al. Dec 2010 A1
20110026290 Noda et al. Feb 2011 A1
20110055495 Remaklus, Jr. et al. Mar 2011 A1
20110069572 Lee et al. Mar 2011 A1
20110122987 Neyer May 2011 A1
20110134715 Norman Jun 2011 A1
20110216614 Hosoe Sep 2011 A1
20110225355 Kajigaya Sep 2011 A1
20110299352 Fujishiro et al. Dec 2011 A1
20110310648 Iwamoto et al. Dec 2011 A1
20120014199 Narui Jan 2012 A1
20120059984 Kang et al. Mar 2012 A1
20120151131 Kilmer et al. Jun 2012 A1
20120155173 Lee et al. Jun 2012 A1
20120155206 Kodama et al. Jun 2012 A1
20120213021 Riho et al. Aug 2012 A1
20120254472 Ware et al. Oct 2012 A1
20120287727 Wang Nov 2012 A1
20120307582 Marumoto et al. Dec 2012 A1
20120327734 Sato Dec 2012 A1
20130003467 Klein Jan 2013 A1
20130003477 Park et al. Jan 2013 A1
20130028034 Fujisawa Jan 2013 A1
20130051157 Park Feb 2013 A1
20130051171 Porter et al. Feb 2013 A1
20130077423 Lee Mar 2013 A1
20130279284 Jeong Oct 2013 A1
20140006700 Schaefer et al. Jan 2014 A1
20140006703 Bains et al. Jan 2014 A1
20140006704 Greenfield et al. Jan 2014 A1
20140013169 Kobla et al. Jan 2014 A1
20140013185 Kobla et al. Jan 2014 A1
20140016422 Kim et al. Jan 2014 A1
20140022858 Chen et al. Jan 2014 A1
20140043888 Chen et al. Feb 2014 A1
20140050004 Mochida Feb 2014 A1
20140078841 Chopra Mar 2014 A1
20140078842 Oh et al. Mar 2014 A1
20140089576 Bains et al. Mar 2014 A1
20140089758 Kwok et al. Mar 2014 A1
20140095780 Bains et al. Apr 2014 A1
20140095786 Moon et al. Apr 2014 A1
20140119091 You et al. May 2014 A1
20140143473 Kim et al. May 2014 A1
20140169114 Oh Jun 2014 A1
20140177370 Halbert et al. Jun 2014 A1
20140181453 Jayasena et al. Jun 2014 A1
20140185403 Lai Jul 2014 A1
20140189228 Greenfield et al. Jul 2014 A1
20140219042 Yu et al. Aug 2014 A1
20140219043 Jones et al. Aug 2014 A1
20140237307 Kobla et al. Aug 2014 A1
20140241099 Seo et al. Aug 2014 A1
20140254298 Dally Sep 2014 A1
20140281206 Crawford et al. Sep 2014 A1
20140281207 Mandava et al. Sep 2014 A1
20140321226 Pyeon Oct 2014 A1
20150016203 Sriramagiri et al. Jan 2015 A1
20150049566 Lee et al. Feb 2015 A1
20150049567 Chi Feb 2015 A1
20150055420 Bell et al. Feb 2015 A1
20150078112 Huang Mar 2015 A1
20150085564 Yoon et al. Mar 2015 A1
20150089326 Joo et al. Mar 2015 A1
20150092508 Bains Apr 2015 A1
20150109871 Bains et al. Apr 2015 A1
20150120999 Kim et al. Apr 2015 A1
20150134897 Sriramagiri et al. May 2015 A1
20150162064 Oh et al. Jun 2015 A1
20150170728 Jung et al. Jun 2015 A1
20150206572 Lim et al. Jul 2015 A1
20150213872 Mazumder et al. Jul 2015 A1
20150243339 Bell et al. Aug 2015 A1
20150255140 Song Sep 2015 A1
20150279442 Hwang Oct 2015 A1
20150294711 Gaither et al. Oct 2015 A1
20150340077 Akamatsu Nov 2015 A1
20150356048 King Dec 2015 A1
20150380073 Joo et al. Dec 2015 A1
20160019940 Jang et al. Jan 2016 A1
20160027498 Ware et al. Jan 2016 A1
20160027531 Jones et al. Jan 2016 A1
20160027532 Kim Jan 2016 A1
20160042782 Narui et al. Feb 2016 A1
20160070483 Yoon et al. Mar 2016 A1
20160078846 Liu et al. Mar 2016 A1
20160078911 Fujiwara et al. Mar 2016 A1
20160086649 Hong et al. Mar 2016 A1
20160093402 Kitagawa et al. Mar 2016 A1
20160125931 Doo et al. May 2016 A1
20160133314 Hwang et al. May 2016 A1
20160155491 Roberts et al. Jun 2016 A1
20160180917 Chishti et al. Jun 2016 A1
20160180921 Jeong Jun 2016 A1
20160196863 Shin et al. Jul 2016 A1
20160202926 Benedict Jul 2016 A1
20160225433 Bains et al. Aug 2016 A1
20160343423 Shido Nov 2016 A1
20170011792 Oh Jan 2017 A1
20170052722 Ware Feb 2017 A1
20170076779 Bains et al. Mar 2017 A1
20170092350 Halbert et al. Mar 2017 A1
20170133085 Kim et al. May 2017 A1
20170133108 Lee et al. May 2017 A1
20170140807 Sun et al. May 2017 A1
20170140810 Choi et al. May 2017 A1
20170140811 Joo May 2017 A1
20170146598 Kim et al. May 2017 A1
20170148504 Saifuddin et al. May 2017 A1
20170186481 Oh et al. Jun 2017 A1
20170213586 Kang et al. Jul 2017 A1
20170263305 Cho Sep 2017 A1
20170269861 Lu et al. Sep 2017 A1
20170287547 Ito et al. Oct 2017 A1
20170323675 Jones et al. Nov 2017 A1
20170345482 Balakrishnan Nov 2017 A1
20170352404 Lee et al. Dec 2017 A1
20180005690 Morgan et al. Jan 2018 A1
20180025772 Lee et al. Jan 2018 A1
20180025773 Bains et al. Jan 2018 A1
20180033479 Lea et al. Feb 2018 A1
20180047110 Blackman et al. Feb 2018 A1
20180061476 Kim Mar 2018 A1
20180061485 Joo Mar 2018 A1
20180075927 Jeong Mar 2018 A1
20180096719 Tomishima et al. Apr 2018 A1
20180108401 Choi et al. Apr 2018 A1
20180114561 Fisch et al. Apr 2018 A1
20180114565 Lee Apr 2018 A1
20180122454 Lee et al. May 2018 A1
20180130506 Kang et al. May 2018 A1
20180137005 Wu et al. May 2018 A1
20180158504 Akamatsu Jun 2018 A1
20180158507 Bang Jun 2018 A1
20180182445 Lee et al. Jun 2018 A1
20180190340 Kim et al. Jul 2018 A1
20180218767 Wolff Aug 2018 A1
20180226119 Kim et al. Aug 2018 A1
20180233197 Laurent Aug 2018 A1
20180240511 Yoshida et al. Aug 2018 A1
20180247876 Kim et al. Aug 2018 A1
20180254078 We et al. Sep 2018 A1
20180261268 Hyun et al. Sep 2018 A1
20180276150 Eckert et al. Sep 2018 A1
20180285007 Franklin et al. Oct 2018 A1
20180294028 Lee et al. Oct 2018 A1
20180308539 Ito et al. Oct 2018 A1
20190013059 Akamatsu Jan 2019 A1
20190043558 Suh et al. Feb 2019 A1
20190051344 Bell et al. Feb 2019 A1
20190065087 Li et al. Feb 2019 A1
20190066759 Nale Feb 2019 A1
20190066766 Lee Feb 2019 A1
20190088315 Saenz et al. Mar 2019 A1
20190088316 Inuzuka et al. Mar 2019 A1
20190103147 Jones et al. Apr 2019 A1
20190115069 Lai Apr 2019 A1
20190122723 Ito et al. Apr 2019 A1
20190129651 Wuu et al. May 2019 A1
20190130960 Kim May 2019 A1
20190130961 Bell et al. May 2019 A1
20190147964 Yun et al. May 2019 A1
20190161341 Howe May 2019 A1
20190190341 Beisele et al. Jun 2019 A1
20190196730 Imran Jun 2019 A1
20190198078 Hoang et al. Jun 2019 A1
20190198099 Mirichigni et al. Jun 2019 A1
20190205253 Roberts Jul 2019 A1
20190228810 Jones et al. Jul 2019 A1
20190228815 Morohashi et al. Jul 2019 A1
20190252020 Rios et al. Aug 2019 A1
20190267077 Ito et al. Aug 2019 A1
20190279706 Kim Sep 2019 A1
20190294348 Ware et al. Sep 2019 A1
20190333573 Shin et al. Oct 2019 A1
20190348100 Smith et al. Nov 2019 A1
20190348102 Smith et al. Nov 2019 A1
20190348103 Jeong et al. Nov 2019 A1
20190362774 Kuramori et al. Nov 2019 A1
20190385661 Koo et al. Dec 2019 A1
20190385667 Morohashi et al. Dec 2019 A1
20190385668 Fujioka et al. Dec 2019 A1
20190385670 Notani et al. Dec 2019 A1
20190386557 Wang et al. Dec 2019 A1
20190391760 Miura et al. Dec 2019 A1
20190392886 Cox et al. Dec 2019 A1
20200051616 Cho Feb 2020 A1
20200075086 Hou et al. Mar 2020 A1
20200126611 Riho et al. Apr 2020 A1
20200135263 Brown et al. Apr 2020 A1
20200143871 Kim et al. May 2020 A1
20200176050 Ito et al. Jun 2020 A1
20200185026 Yun et al. Jun 2020 A1
20200194056 Sakurai et al. Jun 2020 A1
20200202921 Morohashi et al. Jun 2020 A1
20200210278 Rooney et al. Jul 2020 A1
20200211632 Noguchi Jul 2020 A1
20200211633 Okuma Jul 2020 A1
20200211634 Ishikawa et al. Jul 2020 A1
20200219555 Rehmeyer Jul 2020 A1
20200219556 Ishikawa et al. Jul 2020 A1
20200265888 Ito et al. Aug 2020 A1
20200273517 Yamamoto Aug 2020 A1
20200273518 Raad et al. Aug 2020 A1
20200279599 Ware et al. Sep 2020 A1
20200294569 Wu et al. Sep 2020 A1
20200294576 Brown et al. Sep 2020 A1
20200321049 Meier et al. Oct 2020 A1
20200381040 Penney et al. Dec 2020 A1
20200388324 Rehmeyer et al. Dec 2020 A1
20200388325 Cowles et al. Dec 2020 A1
20200395063 Rehmeyer Dec 2020 A1
20210057021 Wu et al. Feb 2021 A1
20210057022 Jenkinson et al. Feb 2021 A1
20210118491 Li et al. Apr 2021 A1
20210166752 Noguchi Jun 2021 A1
20210183433 Jenkinson et al. Jun 2021 A1
20210183435 Meier et al. Jun 2021 A1
20210225431 Rehmeyer et al. Jul 2021 A1
20210304813 Cowles et al. Sep 2021 A1
20210335411 Wu et al. Oct 2021 A1
Foreign Referenced Citations (16)
Number Date Country
101038785 Sep 2007 CN
101067972 Nov 2007 CN
104350546 Feb 2015 CN
106710621 May 2017 CN
107871516 Apr 2018 CN
2005-216429 Aug 2005 JP
2611-258259 Dec 2011 JP
4911510 Jan 2012 JP
2013-004158 Jan 2013 JP
6281030 Jan 2018 JP
2014120477 Aug 2014 WO
2015030991 Mar 2015 WO
2017171927 Oct 2017 WO
2020117686 Jun 2020 WO
2020247163 Dec 2020 WO
2020247639 Dec 2020 WO
Non-Patent Literature Citations (68)
Entry
U.S. Appl. No. 16/788,657, titled “Semiconductor Device Performing Row Hammer Refresh Operation”, filed Feb. 12, 2020.
U.S. Appl. No. 16/818,989, titled “Semiconductor Device Performing Row Hammer Refresh Operation”, filed Mar. 13, 2020.
U.S. Appl. No. 16/818,981 titled “Apparatuses and Methods for Staggered Timing of Targeted Refresh Operations” filed Mar. 13, 2020.
U.S. Appl. No, 16/208,217, titled “Semiconductor Device Performing Row Hammer Refresh Operation”, filed Dec. 3. 2018.
U.S. Appl. No. 16/824,460, titled “Semiconductor Device Performing Row Hammer Refresh Operation”, filed Mar. 19, 2020.
U.S. Appl. No. 16/997,766 titled “Refresh Logic Circuit Layouts Thereof” filed Aug. 19, 2020.
U.S. Appl. No. 16/783,063, titled “Apparatus and Methods for Triggering Row Hammer Address Sampling”, filed Feb. 5, 2020.
U.S. Appl. No. 17/095,978 titled “Apparatuses and Methods for Controlling Refresh Timing” filed Nov. 12, 2020.
U.S. Appl. No. 16/431,641 titled “Apparatuses and Methods for Controlling Steal Rates” filed Jun. 4, 2019.
U.S. Appl. No. 17/030,018, titled “Apparatuses and Methods for Controlling Refresh Operations”, filed Sep. 23, 2020, pp. all.
U.S. Appl. No. 16/655,110 titled “Apparatuses and Methods for Dynamic Targeted Refresh Steals” filed Oct. 16, 2019.
U.S. Appl. No. 16/025,844, titled “Apparatus and Methods for Triggering Row Hammer Address Sampling”, filed Jul. 2, 2018.
U.S. Appl. No. 16/084,119, titled “Apparatuses and Methods for Pure-Time, Self Adopt Sampling for Row Hammer Refresh Sampling”, filed Sep. 11, 2018.
U.S. Appl. No. 16/176,932, titled “Apparatuses and Methods for Access Based Refresh Timing”, filed Oct. 31, 2018.
U.S. Appl. No. 16/230,300, titled “Apparatuses and Methods for Staggered Timing of Targeted Refresh Operations” filed Dec. 21, 2018.
U.S. Appl. No. 16/232,837, titled “Apparatuses and Methods for Distributed Targeted Refresh Operations”, filed Dec. 26, 2018.
U.S. Appl. No. 16/286,187 titled “Apparatuses and Methods for Memory MAT Refresh Sequencing” filed Feb. 26, 2019.
U.S. Appl. No. 16/290,730, titled “Semiconductor Device Performing Row Hammer Refresh Operation”, filed Mar. 1, 2019.
U.S. Appl. No. 16/374,623, titled “Semiconductor Device Performing Row Hammer Refresh Operation”, filed Apr. 3, 2019.
U.S. Appl. No. 16/375,716 titled “Stagger RHR Pumping Scheme Across Die Banks” filed Apr. 4, 2019; pp. all.
U.S. Appl. No. 16/549,411 titled “Apparatuses and Methods for Dynamic Refresh Allocation” filed Aug. 23, 2019.
U.S. Appl. No. 17/008,396 titled “Apparatuses and Methods for Staggered Timing of Targeted Refresh Operations” filed Aug. 31, 2020.
U.S. Appl. No. 16/886,284, titled “Apparatuses and Methods for Access Based Refresh Timing”, filed May 28, 2020.
U.S. Appl. No. 17/175,485 titled “Apparatuses and Methods for Distributed Targeted Refresh Operations” filed Feb. 12, 2021.
Application No. PCT/US20/23689, titled “Semiconductor Device Having CAM That Stores Address Signals”, filed Mar. 19, 2020.
U.S. Appl. No. 16/797,658, titles “Apparatuses and Methods for Controlling Refresh Operations”, filed Feb. 21, 2020.
U.S. Appl. No. 16/805,197, titled “Apparatuses and Methods for Calculating Row Hammer Refresh Addresses in a Semiconductor Device”, filed Feb. 28, 2020.
U.S. Appl. No. 16/268,818, titled “Apparatuses and Methods for Managing Row Access Counts”, filed Feb. 6, 2019.
U.S. Appl. No. No. 16/358,587, titled “Semiconductor Device Having CAM That Stores Address Signals”, filed Mar. 19, 2019.
U.S. Appl. No. 16/411,573 titled “Apparatuses, Systems, and Methods for a Content Addressable Memory Cell” filed May 14, 2019.
U.S. Appl. No. 16/428,625 titled “Apparatuses and Methods for Tracking Victim Rows” filed May 31, 2019.
U.S. Appl. No. 16/513,400 titled “Apparatuses and Methods for Tracking Row Accesses” filed Jul. 16, 2019.
U.S. Appl. No. 16/548,027 titled “Apparatuses, Systems, and Methods for Analog Row Access Rate Determination” filed Aug. 22, 2019.
U.S. Appl. No. 16/549,942 titled “Apparatuses and Methods for Lossy Row Access Counting” filed Aug. 23, 2019.
U.S. Appl. No. 16/546,152 titled “Apparatuses and Methods for Analog Row Access Tracking” filed Aug. 20, 2019.
U.S. Appl. No. 15/881,256 entitled ‘Apparatuses and Methods for Detecting a Row Hammer Attack With a Bandpass Filter’ filed Jan. 26, 2018.
U.S. Appl. No. 16/425,525 titled “Apparatuses and Methods for Tracking All Row Accesses” filed May 29, 2019.
U.S. Appl. No. 16/427,105 titled “Apparatuses and Methods for Priority Targeted Refresh Operations” filed May 30, 2019.
U.S. Appl. No. 16/427,140 titled “Apparatuses and Methods for Tracking Row Access Counts Between Multiple Register Stacks” filed May 30, 2019.
U.S. Appl. No. 16/437,811 titled “Apparatuses, Systems, and Methods for Determining Extremum Numerical Values”' filed Jun. 11, 2019.
U.S. Appl. No. 15/789,897, entitled “Apparatus and Methods for Refreshing Memory”, filed Oct. 20, 2017.
U.S. Appl. No. 15/796,340, entitled: “'Apparatus and Methods for Refreshing Memory” filed Oct. 27, 2017.
U.S. Appl. No. 16/012,679, titled “Apparatuses and Methods for Multiple Row Hammer Refresh Address Sequences”, filed Jun. 19, 2018.
U.S. Appl. No. 16/020,863, titled “Semiconductor Device”, filed Jun. 27, 2018.
U.S. Appl. No. 16/112,471 titled “Apparatuses and Methods for Controlling Refresh Operations” filed Aug. 24, 2018.
U.S. Appl. No. 16/160,801, titled “Apparatuses and Methods for Selective Row Refreshes” filed Oct. 15, 2018.
U.S. Appl. No. 16/231,327 titled “Apparatuses and Methods for Selective Row Refreshes”, filed Dec. 21, 2018.
U.S. Appl. No. 16/237,291, titled “Apparatus and Methods for Refreshing Memory”, filed Dec. 31, 2018.
U.S. Appl. No. 16/411,698 title “Semiconductor Device” filed May 14, 2019.
U.S. Appl. No. 16/427,330 titled “Apparatuses and Methods for Storing Victim Row Data” filed May 30, 2019.
U.S. Appl. No. 15/876,566 entitled ‘Apparatuses and Methods for Calculating Row Hammer Refresh Addresses in a Semiconductor Device’ filed Jan. 22, 2018.
U.S. Appl. No. 15/656,084, titled: Apparatuses and Methods for Targeted Refreshing of Memory, filed Jul. 21, 2017.
U.S. Appl. No. 16/459,520 titled “Apparatuses and Methods for Monitoring Word Line Accesses”, filed Jul. 1, 2019.
PCT Application No. PCT/US18/55821 “Apparatus and Methods for Refreshing Memory” filed Oct. 15, 2018.
U.S. Appl. No. 15/715,846, entitled “Semiconductor Device”, filed Sep. 26, 2017.
U.S. Appl. No. 15/888,993, entitled “Apparatuses and Methods for Controlling Refresh Operations”, filed Feb. 5, 2018.
U.S. Appl. No. 16/190,627 titled “Apparatuses and Methods for Targeted Refreshing of Memory” filed Nov. 14, 2018.
U.S. Appl. No. 15/281,818, entitled: “Semiconductor Device” filed Sep. 30.
Kim, et al., “Flipping Bits in MemoryWithout Accessing Them: An Experimental Study of DRAM Disturbance Errors”, IEEE, Jun. 2014, 12 pgs.
U.S. Appl. No. 17/186,913 titled “Apparatuses and Methods for Dynamic Refresh Allocation” filed Feb. 26, 2021, pp. all.
U.S. Appl. No. 17/187,002 titled “Apparatuses and Methods for Staggered Timing of Targeted Refresh Operations” filed Feb. 26, 2021, pp. all.
U.S. Appl. No. 16/994,338 titled “Apparatuses, Systems, and Methods for Memory Directed Access Pause” filed Aug. 14, 2020, pp. all.
U.S. Appl. No. 16/997,659 titled “Apparatuses, Systems, and Methods for Refresh Modes” filed Aug. 19, 2020; pp. all.
U.S. Appl. No. 17/127,654 titled “Apparatuses and Methods for Row Hammer Based Cache Lockdown” filed Dec. 13, 2020, pp. all.
U.S. Appl. No. 17/324,621 titled “Apparatuses And Methods for Pure-Time, Self-Adopt Sampling For Row Hammer Refresh Sampling” filed May 19, 2021, pp. all.
U.S. Appl. No. 17/347,957 titled “Apparatuses and Methods for Controlling Steal Rates” filed Jun. 15, 2021, pp. all.
U.S. Appl. No. 16/432,604 titled “Apparatuses and Methods for Staggered Timing of Skipped Refresh Operations” filed Jun. 5, 2019, pp. all.
U.S. Appl. No. 17/226,975, titled “Apparatuses and Methods for Staggered Timing of Skipped Refresh Operations” filed Apr. 9, 2021, pp. all.
Related Publications (1)
Number Date Country
20200082873 A1 Mar 2020 US
Divisions (1)
Number Date Country
Parent 15419590 Jan 2017 US
Child 16682606 US