(19) united states (12) patent application publication (10...
Post on 04-Aug-2020
2 Views
Preview:
TRANSCRIPT
US 20130332690A1
(19) United States (12) Patent Application Publication (10) Pub. No.: US 2013/0332690 A1
Seo et al. (43) Pub. Date: Dec. 12, 2013
(54) MEMORY SYSTEMS AND MEMORY (30) Foreign Application Priority Data MANAGING METHODS OF MANAGING MEMORY IN A UNIT 01? MEMORY CHUNK Jun. 12, 2012 (KR) ...................... .. 10-2012-0062811
(71) ApplicantszSAMSUNG ELECTRONICS CO., Publication Classi?cation LTD., SuWon-si (KR); RESEARCH & BUSINESS FOUNDATION (51) Int. Cl. SUNGKYUNKWAN UNIVERSITY, G06F 3/06 (2006.01) SuWon-si (KR) (52) US. Cl.
CPC .................................. .. G06F 3/0631 (2013.01)
(72) Inventors: Dong-Young See, Seoul (KR); Dongkun USPC ........................................................ .. 711/170 Shin, Seoul (KR)
(57) ABSTRACT (73) Assignees: Research & Business Foundation
sungkyunkwan University’ suwomsi A method of managing a memory by a unit of memory chunk (KR); samsung Electronics Co” Ltd” is provided. The methodincludes managing multiple memory suwomsi (KR) chunks according to a chunk tree structure, managing pro
gram frequencies of the memory chunks of the memory (21) App1_NO_j 13/832,144 according to a program of the memory, and allocating the
memory chunks based on the program frequencies and the (22) Filed: Mar. 15, 2013 chunk tree structure.
192
‘I20 110 1/60
Auxi l iary Mai n Modem Processor Processor
1 1r 1 1 80
< /> F1150 (V130 P170
Nonvo I at i le Cont r0‘ ‘er User Main Storage CNT Inter face
(“\1140 SCRAM
Patent Application Publication Dec. 12, 2013 Sheet 1 0f 20 US 2013/0332690 A1
F1 g . 1
112
1/20 1/10 1/60 Auxiliary Main Modem Processor Processor
A M 1930
(\J 1 50 @1130 P170 Nonvolati le Comm‘ ‘er User Main Storage CNT Interface
(“\1140 SCRAM
Patent Application Publication Dec. 12, 2013 Sheet 2 0f 20 US 2013/0332690 A1
Fig. 2
@
Application ~21O
I Operating system ~220
I Memory manager ~230
Wear leveling unit "V281
I Memory N240
Patent Application Publication Dec. 12, 2013 Sheet 3 0f 20 US 2013/0332690 A1
Fig. 3A
26605 “6 $252
Addresses
.3B Fig
___. ___ :
wafmoa UB 6252
Addresses
Patent Application Publication Dec. 12, 2013 Sheet 4 0f 20 US 2013/0332690 A1
Fig. 3C
26505 “6 6252
Addresses
Fig. 3D
+1~+
26505 D6 5252
Addresses
Patent Application Publication Dec. 12, 2013 Sheet 5 0f 20 US 2013/0332690 A1
Fig. 4
Manage memory chunks according to chunk tree structure
1 Manage the numbers of programs of
memory chunks accord i ng to N420 program of memory
l I locate the memory chunks based on
the numbers of programs and M480 the chunk tree structure
Patent Application Publication Dec. 12, 2013 Sheet 6 0f 20 US 2013/0332690 A1
@2 E @2 m2 % g % E g 225% :QQZQOIQ cwizvam cwgzv?a 225% 235% 225% 235% Q cwhlzvmis 225g :QQEIZIQ 5.15% w 235mg cmizvolmw N 5.15% m
_@>@|_
232:5 mm; £55 m @E
Patent Application Publication Dec. 12, 2013 Sheet 7 of 20 US 2013/0332690 A1
Fig. 6
Detect al locat ion of memory chunk N610
l Set f i rst al locat ion bi t of the al located
memory chunk to indicate al location
i Set second al location bits of the al located
memory chunk to indicate al location
i When at least one of i i rst al locat ion bi ts of higher memory chunks of the al located memory
chunk indicates unal locat ion , set the ,at least M640 one of first al location bits indicating
unal location to indicate al location
i When a level whose al I memory chunks are
al located appears, set second al locat ion bi ts ind i cat ing the level to indicate al locat ion on N650
memory chunks of higher levels
M620
M630
Patent Application Publication Dec. 12, 2013 Sheet 8 0f 20 US 2013/0332690 A1
Fig. 7
( Star t >
Y
Receive program i nter rupt and program address ~7t0
l Increase the number of programs of memory chunk of lowest level which “#720 corresponds to the program address
I Set the number of programs of parent memory
chunk as sum of the numbers of programs of chi Id memory chunks when al I chi Id memory chunks of N730
the parent memory chunk are al located
I Set the number of programs of parent memory
chunk as sum of the numbers of programs of chi Id memory chunks when al I chi ld memory chunks of “J40
the parent memory chunk are unal located
I Set the number of program of parent memory
chunk as twice 0t unal located chi Id memory chunk when one chi Id memory chunk is al located and '\’75O another chi Id memory chunk is unal located
Patent Application Publication Dec. 12, 2013 Sheet 9 0f 20 US 2013/0332690 A1
on L
I) LO 4_,
O 2 CO 3
L
y > (D L
. CD g Q0 CD (D
F 2 ‘H '_
FLT-l x q z 2 :5 _r: 0
c0 2
Level
Patent Application Publication Dec. 12, 2013 Sheet 10 of 20 US 2013/0332690 A1
Fig. 9
l Star t >
V
Receive memory al locat ion request “1910
l Access al locat ion bi ts of root
memory chunk i nformat ion N920
Search target level hav i ng unal located memory chunk hav i no size equal to or larger than s i ze 930
cor respond i no to the memory al locat ion request based on the al I ocat ion i niormat ion
l Al locate memory chunk of the target level
accord i no to chunk tree structure and ~940 the number of programs
Patent Application Publication Dec. 12, 2013 Sheet 11 0f 20 US 2013/0332690 A1
Fig. 10 QED Access root memory chunk 1010
Target level?
No ‘
1030f Access chi Id memory chunks
Detect chi ld memory chunks wh i ch have unal located memory chunk on the target ! evel among
the accessed memory chunks
1040~f
Two or more N O chi Id memory chunks are
detected?
i055 i060 i025 \ r Se i ect the Compare the number of Se i ect the
detected chi Id programs of the detected accessed memory chunk chi Id memory chunks memory chunk
v (\JtOTO Se l ect oh i Id memory chunk
havi ng the lowest number of programs
‘ 1080
Yes ‘
AI locate the selected memory chunk ‘V1090
End
US 2013/0332690 A1
CC) I E
Dec. 12, 2013 Sheet 12 0f 20 Patent Application Publication
6.0: No.0. 8;: wlow 6:2 g 6.3 § 6:2 % 33 w@.@ 33 30 Wk ml o 63: mla 60;: g 605 Flo @ :52 Q16 f 6863 Q @Qi: @ N
sooodimwlo » m
ll _m>m._
333:5 mm; x550 @ I @E
Patent Application Publication Dec. 12, 2013 Sheet 13 0f 20 US 2013/0332690 A1
Fig. 12 @ Chunk Tree Structure Memory
Level
Patent Application Publication Dec. 12, 2013 Sheet 14 0f 20 US 2013/0332690 A1
50:62
or
8.3 @lS so“ 5 g
38 § 3 2 .5
Patent Application Publication Dec. 12, 2013 Sheet 15 0f 20 US 2013/0332690 A1
339:3 mm; VEEO 3 .wE @
Patent Application Publication Dec. 12, 2013 Sheet 16 0f 20 US 2013/0332690 A1
@135 m: .5
Patent Application Publication Dec. 12, 2013 Sheet 17 0f 20 US 2013/0332690 A1
32 g 65 N8 605mm 332:5 mm; VEEQ S .E
Patent Application Publication Dec. 12, 2013 Sheet 18 0f 20
Fig. 17
Receive program command and program address
US 2013/0332690 A1
1 Count the number of program command @1720
The count val ue reaches threshold value?
Generate program i nterrupt and send address received last
l Reset count value x1750
Patent Application Publication Dec. 12, 2013 Sheet 19 0f 20 US 2013/0332690 A1
Fig. 18
Detect the smal lest and largest number of programs of memory chunks on lowest level NASH)
1820
Difference between the smal lest and largest number of
programs reaches threshold value?
Change data and al locat lon between memory chunks hav i ng the smal lest and largest ~183O
number of programs each other
top related