Circuit for selecting row to be refreshed
View Patent ↗A circuit for selecting a row of memory cells of a memory device to be refreshed may include: a cold table suitable for storing as a cold row a row selected as a hammered row when the row selected as the hammered row is neither one of cold rows stored in the cold table nor one of hot rows stored in a hot table; and the hot table suitable for storing, as a hot row, the row selected as the hammered row when the row selected as the hammered row is one of the cold rows stored in the cold table.
1. A circuit for selecting a row of memory cells of a memory device to be refreshed, comprising:
a cold table suitable for storing as a cold row a row selected as a hammered row when the row selected as the hammered row is neither one of cold rows stored in the cold table nor one of hot rows stored in a hot table; and
the hot table suitable for storing, as a hot row, the row selected as the hammered row when the row selected as the hammered row is one of the cold rows stored in the cold table,
wherein the hot rows stored in the hot table have respective ranks,
wherein a lowest rank is applied to a new hot row stored in the hot table for the first time, and
wherein, when the row selected as the hammered row is one of the hot rows, the rank of the row selected as the hammered row is raised to the next rank level.
2. The circuit of claim 1 , wherein, when the row selected as the hammered row is one of the cold rows, the row selected as the hammered row is removed from the cold table.
3. The circuit of claim 2 ,
wherein ranks are applied to the cold rows stored in the cold table, and
wherein a highest rank is applied to a new cold row stored in the cold table for the first time.
4. The circuit of claim 3 , wherein, when the new hot row is stored in the hot table, an existing hot row of the lowest rank is removed from the hot table and is stored as the cold row of the highest rank in the cold table.
5. The circuit of claim 4 , wherein, when the new cold row is stored in the cold table, a cold row of the lowest rank of the cold table is removed from the cold table if the cold table is in a full state.
6. The circuit of claim 1 , wherein a row adjacent to an enabled row is selected as the hammered row.
7. The circuit of claim 1 , wherein a row adjacent to a row selected with a predetermined probability among enabled rows is selected as the hammered row.
8. The circuit of claim 4 ,
wherein eviction probabilities are applied, by respective ranks, to the cold rows of the cold table, and
wherein, when the new cold row is stored in the cold table, one cold row selected based on the eviction probabilities among the cold rows of the cold table is removed from the cold table if the cold table is in a full state.
9. The circuit of claim 2 , wherein, during a refresh operation of a memory device for preventing data loss due to row hammering, a row of the memory device corresponding to a hot row of a highest rank is refreshed.
10. The circuit of claim 9 , wherein, when there is no hot row present in the hot table having the highest rank, the refresh operation of the memory device for preventing the data loss due to the row hammering is not performed.
11. The circuit of claim 2 , wherein, during a refresh operation of a memory device for preventing data loss due to row hammering, a row of the memory device corresponding to a hot row having a highest rank among the hot rows stored in the hot table is refreshed.
12. A circuit for selecting a row to be refreshed, comprising:
a cold table suitable for storing a plurality of cold rows having respective ranks;
a hot table suitable for storing a plurality of hot rows having respective ranks;
an input unit suitable for storing, as a cold row of a highest rank of the cold table, a row selected as a hammered row when the row selected as the hammered row is neither one of the cold rows nor one of the hot rows;
a promotion unit suitable for storing, as a hot row of a lowest rank of the hot table, the row selected as the hammered row when the row selected as the hammered row is one of the cold rows, and raising the rank of the hammered row when the row selected as the hammer row is one of the hot rows; and
an eviction unit suitable for removing one of the cold rows of the cold table if the cold table is in a full state when a new cold row is stored in the cold table.
13. The circuit of claim 12 , wherein, when the row selected as the hammered row is one of the cold rows, the promotion unit removes the hammered row from the cold table.
14. The circuit of claim 13 , wherein the input unit selects a row adjacent to an enabled row as the hammered row.
15. The circuit of claim 13 , wherein the input unit selects, as the hammered row, a row adjacent to a row selected with a predetermined probability among enabled rows.
16. The circuit of claim 13 , wherein, during the removing, the eviction unit removes a cold rod of a lowest rank.
17. The circuit of claim 13 ,
wherein eviction probabilities are applied, by respective ranks, to the cold rows of the cold table, and
wherein, during the removing, the eviction unit removes one cold row selected based on the eviction probabilities among the cold rows.
18. The circuit of claim 13 , wherein, during a refresh operation of a memory device for preventing data loss due to row hammering, a row of the memory device corresponding to a hot row of a highest rank is refreshed.
19. The circuit of claim 18 , wherein, when the hot row of the highest rank is not present, the refresh operation of the memory device for preventing the data loss due to the row hammering is not performed.
20. The circuit of claim 13 , wherein, during a refresh operation of a memory device for preventing data loss due to row hammering, a row of the memory device corresponding to a hot row having a highest rank among the hot rows stored in the hot table is refreshed.