Transcript MLC NAND in the PCPlanning for Success

Planning for Success
SLC
% Cells
Driving the cost curve
0
Vt
% Cells
MLC
1
11
01
10
00 V
t
Replicate and speed up HDD functionality
Page within a block
Minimum Read/Write
Size ~8kB
Block within a NAND component
Minimum Erase size ~512kB
Flash
Drive
Host
System
External Interface
NAND Component Containing up to 64k blocks
Usage pattern minimizes conflict
Garbage Collection
Flash
Drive
Digital
Camera
External Interface
Block based mapping is extremely effective
External
Interface
External Interface
Static & Dynamic
Wear Leveling
TrueFFSTM
Dynamic Bad Block
Management
Write/Erase
Virtual Mapping
Basic
Endurance
Flash
Management
Usage pattern requires something new
50%
30%
20%
Excel
40%
Word
Outlook
Powerpoint
Photoshop
60%
10%
0%
Random
Read ≤16kB
Random
Read ≥32kB
Random
Write ≤ 16kB
Random
Write ≥ 32kB
Sequential
Read
Sequential
Write
Office 2007 & ADOBE Photoshop CS2 under Vista
Block based mapping hurts random write
NAND Flash does
not
support- over-writing
a page
Read
– Modify
Write
Host
System
External Interface
The next generation SSD algorithm
Static & Dynamic
Wear Leveling
TrueFFSTM
Dynamic Bad Block
Management
Write/Erase
Virtual Mapping
Basic
Endurance
Flash
Management
Page based Data
Allocation
The next generation SSD algorithm
Mark old page invalid and write new data to
NAND Flash does
not support
over-writing a page
an available
location
No longer any tie between
sectors, pages and blocks
External Interface
ExtremeFFSTM simply
writes data where it’s
most convenient
The Next Generation SSD Algorithm
Static & Dynamic
Wear Leveling
TrueFFSTM
Dynamic Bad Block
Management
Fully non-Blocking
Architecture
Usage Based
Content
Localization
Write/Erase
Virtual Mapping
Basic
Endurance
Page based Data
Allocation
Flash
Management
ExtremeFFSTM
A new industry needs new benchmarks
Longterm data endurance (LDE) update
Longterm data endurance (LDE) update
In the client PC usage model
50%
30%
20%
Excel
40%
Word
Outlook
Powerpoint
Photoshop
60%
10%
0%
Random
Read ≤16kB
Random
Read ≥32kB
Random
Write ≤ 16kB
Random
Write ≥ 32kB
Sequential
Read
Sequential
Write
Random Performance α RPM
Application
Completion time for HDD random access command
1.
2.
3.
4.
Command overhead
Seek time
Rotational latency
Data transfer time
HDD _ IOPS(transfer size) 
1 File System 4
3
Latency
1
1
HDDIOPS
  data transfer tim e
Overhead
seek  latency
30
seek 
RPM
1
HDD _ IOPS(smalltransfer) 
Overhead seek 
30
TransferSize  60

RPM 512 RPM  SectorPerTrack
2
Seek
Matching read/write ratios
PC _ IOPS(m ean) 
1
0.5
0.5

SSD IOPS(Read) SSD IOPS( Writ e)
Mobile SSD Performance*
IOPS_R
IOPS_W
PC_IOPS
2006/7
5,000
10
20
2008
10,000
100
200
2009
20,000
400
785
*Industry averages, not representative of a specific product
In Digital Photography
Even in Flash Memory
1x = 150kB/s
2.5” HDD*
Mobile SSD*
IOPS_R
IOPS_W
RPM
IOPS_R
IOPS_W
PC_IOPS
vRPM
2006/7
41
42
5,400
5,000
10
20
~1,000
2008
70
113
7,200
10,000
100
200
~10,000
2009
75
120
7,200
20,000
400
785
~40,000
…and we’re just getting started
*Industry averages, not representative of a specific product
© 2008 Microsoft Corporation. All rights reserved. Microsoft, Windows, Windows Vista and other product names are or may be registered trademarks and/or trademarks in the U.S. and/or other countries.
The information herein is for informational purposes only and represents the current view of Microsoft Corporation as of the date of this presentation. Because Microsoft must respond to changing market
conditions, it should not be interpreted to be a commitment on the part of Microsoft, and Microsoft cannot guarantee the accuracy of any information provided after the date of this presentation.
MICROSOFT MAKES NO WARRANTIES, EXPRESS, IMPLIED OR STATUTORY, AS TO THE INFORMATION IN THIS PRESENTATION.