US A1 (19) United States (12) Patent Application Publication (10) Pub. No.: US 2013/ A1 Seo et al. (43) Pub. Date: Dec.

Transcription

1 US A1 (19) United States (12) Patent Application Publication (10) Pub. No.: US 2013/ 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) (71) ApplicantszSAMSUNG ELECTRONICS CO., Publication Classi?cation LTD., SuWon-si (KR); RESEARCH & BUSINESS FOUNDATION (51) Int. Cl. SUNGKYUNKWAN UNIVERSITY, G06F 3/06 ( ) SuWon-si (KR) (52) US. Cl. CPC..... G06F 3/0631 ( ) (72) Inventors: Dong-Young See, Seoul (KR); Dongkun USPC /170 Shin, Seoul (KR) (73) (57) ABSTRACT Assignees: Research & Business Foundation sungkyunkwan University suwomsi A method of managing a memory by a unit of memory chunk (KR); samsung Electronics Co Ltd suwomsi (KR) is provided. The methodincludes managing multiple memory 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 I /60 Auxi l iary Mai n Processor Processor Modem 1 1r < /> F1150 (V130 P170 Nonvo I at i le Cont r0 er User Main Storage CNT Inter face SCRAM ( \1140

2 Patent Application Publication Dec. 12, 2013 Sheet 1 0f 20 US 2013/ A1 F1 g /20 1/10 1/60 Auxiliary Main Modem Processor Processor A M 1930 (\J 1 P170 Nonvolati le Comm er User Main Storage CNT Interface SCRAM ( \1140

3 Patent Application Publication Dec. 12, 2013 Sheet 2 0f 20 US 2013/ A1 Fig. Application ~21O I Operating system ~220 I Memory manager ~230 Wear leveling unit "V281 I Memory N240

4 Patent Application Publication Dec. 12, 2013 Sheet 3 0f 20 US 2013/ A1 Fig. 3A 6 $ Addresses Fig.3B UB wafmoa : Addresses

5 Patent Application Publication Dec. 12, 2013 Sheet 4 0f 20 US 2013/ A1 Fig. 3C Addresses Fig. 3D D ~+ Addresses

6 Patent Application Publication Dec. 12, 2013 Sheet 5 0f 20 US 2013/ 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 the chunk tree structure M480

7 Patent Application Publication Dec. 12, 2013 Sheet 6 0f 20 US 2013/ A1 232:5 55 mm; 235mg cmizvolmw N cwhlzvmis 225g :QQEIZIQ 5.15% w :QQZQOIQ cwizvam cwgzv?a 225% 235% Q m2 g % E 5.15% m _@>@ _

8 Patent Application Publication Dec. 12, 2013 Sheet 7 of 20 US 2013/ A1 Fig. 6 Detect al locat ion of memory chunk 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 N610 M620 M630 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

9 Patent Application Publication Dec. 12, 2013 Sheet 8 0f 20 US 2013/ 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 another chi Id memory chunk is unal located '\ 75O

10 Patent Application Publication Dec. 12, 2013 Sheet 9 0f 20 US 2013/ A1 on L I) 4_, LO 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

11 Patent Application Publication Dec. 12, 2013 Sheet 10 of 20 US 2013/ 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

12 Patent Application Publication Dec. 12, 2013 Sheet 11 0f 20 US 2013/ A1 Fig. 10 QED Access root memory chunk 1010 Target level? No 1030f Access chi Id memory chunks 1040~f Detect chi ld memory chunks wh i ch have unal located memory chunk on the target! evel among the accessed memory chunks N O Two or more 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

13 Patent Application Publication Dec. 12, 2013 Sheet 12 0f 20 US 2013/ A1 CC) I 333:5 x550 mm;» 6863 N 63: 60;: 605 mla g :52 Flo Q16 Wk 6.0: 8;: 6.3 No.0. 6:2 wlow g 33 % w@.@ 30 ml _m>m._ ll

14 Patent Application Publication Dec. 12, 2013 Sheet 13 0f 20 US 2013/ A1 12 Structure Chunk Tree Memory Level

15 Patent Application Publication Dec. 12, 2013 Sheet 14 0f 20 US 2013/ A1 or so 5 g 38 50:62

16 Patent Application Publication Dec. 12, 2013 Sheet 15 0f 20 US 2013/ A1 3.wE 339:3 mm;

17 Patent Application Publication Dec. 12, 2013 Sheet 16 0f 20 US 2013/ A1

18 Patent Application Publication Dec. 12, 2013 Sheet 17 0f 20 US 2013/ A1 S.E 332:5 mm; VEEQ 605mm g N8

19 Patent Application Publication Dec. 12, 2013 Sheet 18 0f 20 US 2013/ A1 Fig. 17 Receive program command and program address 1 Count the number of program The count val ue reaches threshold value? Generate program i nterrupt and send address received last l Reset count value x1750

20 Patent Application Publication Dec. 12, 2013 Sheet 19 0f 20 US 2013/ 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

21

22

23

24

25

26

27

28

29

30

31

32