Table for Operating System – File Cache Alignment


Geeking Out on SSD Hardware Developments (Linux Magazine, February 9th, 2010)

Intel and Smaller Cells
“According to this link the theoretical lower limit on NAND cells appears to be around 20nm. One of the big reasons for this limitation is that as cells shrink in size they are, naturally, closer together. However, the voltage required to program a cell remains about the same (typically 12V). This means that the power density increases (amount of power in a given area) increasing the probability that the voltage will disturb the neighboring cells causing data corruption. Consequently, increasing the density of cells can be a dicey proposition, hence the lower limit.

Recently, IMFT (Intel-Micron Flash Technologies) LLC announced that it had begun sampling 2 bits per cell (MLC) NAND flash chips that have been manufactured using a 25nm process. This announcement is significant because of the increased density and how close the density is getting to the theoretical limit. Plus the fact that one of the best performing SSD drives is from Intel, one of the participating companies in the LLC, and we can see a fairly significant shift in technology.

IMFT is a joint project by Intel and Micro to develop new technologies around Flash storage (primarily NAND). The project started with production several years ago with a 72nm process. They then moved to a 50nm process in 2008 followed by a further reduction to a 34nm process in 2009. It is the 34nm process that current Intel SSDs utilize (Intel X25-M G2). The 34nm process produces a 4GB MLC NAND chip with a die size of 172 mm2.The new 25nm process is targeted for a first product which is an 8GB MLC NAND flash chip with a die size of 167 mm2. So going from 34nm to 25nm doubles the die density.

In addition to the doubling of die density the new chips will have some other changes. The current 34nm generation of chips have a page size of 4KB and 128 pages per block resulting in a block size of 512KB. The new chip will have a page size of 8KB and 256 pages per block. The means that the new block size is 8KB * 256 = 2,048KB (2MB). This change in block size can have a significant impact on performance.

Recall that a block is the smallest amount of storage that goes through an erase/write cycle when any single bit of the block is changed. For example, if any bit within the block is changed then the entire block has to first have the unchanged data copied from the block to cache and then the block is erased. Finally the updated information is merged with the cache data (unchanged data) and the entire block is written to the erased block. This process can take a great deal of time to complete and also uses a rewrite cycle for all of the cells in the block (remember that NAND cells have a limited number of rewrite cycles before they can no longer hold data).

The new 25nm chip will switch from 512KB blocks to 2MB blocks (2,048KB) increasing the amount of data that has to go through the read/erase/write cycle compared to the 34nm chips. To adjust to this change, Intel will have to make adjustments to the firmware to better handle the larger blocks. In addition, it is likely that Intel will have to at least double the cache size to accommodate the larger block sizes. It may have to increase the number of spare pages as well since a single bit change could cause a greater number of blocks to be tagged for updating. However, on the plus side, with larger pages, the controller can do much more optimization for writes including a much greater amount of write coalescing. But this too could increase the amount of cache needed.”

Chatwin’s Table

Conventional Allocation
4 KiB
Alignment
1 MB

Improved Allocation
64 KiB
Alignment
2 MB

OS – 32bit
File Level Cache

Page – 32 K
Size – 128 MB

Page – 64 K
Size – 256 MB

OS – 64bit
File Level Cache

Page – 64 K
Size – 256 MB

Page – 128 K
Size – 512 MB

OS – 32bit
Storage Level Cache

Page – 64 K
Size – 256 MB

Page – 128 K
Size – 512 MB

OS – 64bit
Storage Level Cache

Page – 128 K
Size – 512 MB

Page – 256 K stripe unit
Size – 1 GB

Cluster Unit Aligned
256 Kibit (32 KB)

Windows XP x32
(8*4)
System RAM: 2 GB

Physical Page Size:
32 Kibit (4 KB)
Logical Block Size:
128 KBytes

Sector Size – 512 bytes

Cluster Unit Aligned
512 Kibit (64 KB)

Windows XP x64
(8*8)
System RAM: 4 GB

Physical Page Size:
64 Kibit (8 KB)
Logical Block Size:
256 KBytes

Sector Size – 1024 bytes

About these ads

About Chatwin
This is my website: http://rdwaal.com/, dedicated to my personal designed computer with relevant technological know-how which I learned during my testing and fine tuning period. Concept PC “The Force” evolved in 21 months (minus 7 days) from only a slight idea, till an amazing workstation with remarkable capabilities. It wasn’t labor for me, nor suffering or hard work. It was fun.... If you’re interested in a custom build computer, based on your own preferences, contact me for further information. I only use the best hardware with an acceptable price level. I can assure the best performance within your budget and an unique (thoroughly tested) concept computer/server.

45 Responses to Table for Operating System – File Cache Alignment

  1. exercise bike says:

    Glad to read this blog! Keep it going!

  2. Air Jordan 2011 says:

    I do not even know how I ended up here, but I thought this post was good. I do not know who you are but certainly you’re going to a famous blogger if you are not already ;) Cheers!

  3. Sylvia Rahib says:

    Have you ever considered adding more videos to your blog posts to keep the readers more entertained? I mean I just read through the entire article of yours and it was quite good but since Im more of a visual learner,I found that to be more helpful well let me know how it turns out! I love what you guys are always up too. Such clever work and reporting! Keep up the great works guys Ive added you guys to my blogroll. This is a great article thanks for sharing this informative information.. I will visit your blog regularly for some latest post.

  4. Roy Beasley says:

    hi!, I love your writing very a lot! proportion we keep up a correspondence more about your post on AOL? I require a specialist on this space to unravel my problem. Maybe that is you! Having a look forward to look you.

  5. Jordan Terry says:

    I was just looking for this info for a while. After six hours of continuous Googleing, finally I got it in your web site. I wonder what is the lack of Google strategy that don’t rank this kind of informative sites in top of that list. Generally the top web sites are full of waste.

  6. Winona Mulliniks says:

    Yeah bookmaking this wasn’t a speculative decision outstanding post! .

  7. Judie Reavley says:

    I dugg some of you post as I thought they were very useful very beneficial

  8. Jesenia Sandelius says:

    Very nice post, I certainly love this website, keep on it.

  9. Margene Grastorf says:

    I appreciate an unbelievable publish, may examine your others posts. many thanks for your thinking within this, I felt a lttle bit made an impact to by this article. Many thanks again! You earn a terrific moment. Portrays natures best by the wonderful report here. I do think that if a greater number of people consideration for it like this, they’d have got a better time period receive the suspend ofing the matter.

  10. Kasey Marrs says:

    It is really a great and useful piece of info. I’m glad that you shared this useful info with us. Please keep us informed like this. Thank you for sharing.

  11. Free stuff errors says:

    Awesome website. Bookmarked it and shown my friends!

  12. Alba Laudadio says:

    Youre so cool! I dont suppose I’ve read anything like this before. So nice to find somebody with some original thoughts on this subject. Really thank you for starting this up. This website is something that is needed on the web, someone with a little originality. Useful job for bringing something new to the internet!

  13. Deb Ugarte says:

    Very nice post, I certainly love this website, keep on it.

  14. Adalin says:

    I am glad to be one of lots of readers on this exceptional site (:, thanks for placing up.

  15. Dougsladie says:

    Great article. Expecting a follow up …

  16. Ludo says:

    I stumbled on your internet site by accident though checking Yahoo and I am glad I did. Your post may be a little bit several and I really liked reading through it. I will consequently produce a comment about this on my blog and stage my guests your way. Many thanks.

  17. Laborin1 says:

    Why is your post only loading half way and then getting stuck? I’ve tried refreshing the page a couple of times but I’m still unable to read the whole post.

  18. Chatwin says:

    To: Laborin1
    Select my article in the Post Index (right column) and use the Print & PDF button underneath the article, if you want to edit or change the layout of my post. PDFMYURL generates a complete PDF document of all the articles, which will be downloaded to your computer.
    Kind regards, Chatwin Se7en.

  19. Branda Vanbramer says:

    You should take part in a contest for one of the best blogs on the web. I will recommend this site!

  20. Gaydos says:

    At last I have found just the information which I’ve been searching for. You know, it was actually infuriating to surf through a dozen websites but not get the to-the-point stuffs. But, your web site was an exception. I can proudly tell that- “See, here’s a site that I value for my study! ”

  21. adlawldkja says:

    whoah this weblog is fantastic i truly like reading your posts. Keep up the wonderful work! You already know, lots of persons are looking round for this information, it is possible to aid them greatly.

  22. Layla Waidelich says:

    I definitely wanted to jot down a brief word to thank you for all the nice advice you are giving at this site. My time consuming internet lookup has finally been compensated with reasonable points to share with my best friends. I ‘d say that most of us readers are undoubtedly endowed to dwell in a remarkable place with so many awesome people with useful points. I feel really happy to have encountered your webpages and look forward to so many more thrilling times reading here. Thank you again for a lot of things.

  23. scrap yards says:

    genius post you sir a great author I’ve bookmarked this page

  24. notopanow says:

    I’ll right away grab your rss feed as I can not in finding your e-mail subscription link or e-newsletter service. Do you have any? Kindly allow me realize in order that I may subscribe. Thanks.

  25. Chatwin says:

    To: notopanow
    Above the Recent Comments section (in the right sidebar) you can subscribe with your e-mail address (confidential). You’ll will be informed when a new post is published on The Data Cloud in your mail-box. If you have a RSS-reader (software/plugin) you get the latest headlines.
    Kind regards, Chatwin Se7en.

  26. Hipolito M. Wiseman says:

    we stumbled here from a different web adress and liked what we saw, we are now following you.

  27. Jolliff says:

    With quality information like this, I guess your website can become a masterpiece among your fellow competitors’ sites. I seriously believe that bookmarking your website defintely won’t be a waste of time. Please, do keep on updating interesting posts!

  28. pblogger website says:

    I couldn’t resist commenting. Very well written!

  29. Mery39 says:

    Gday.This particular document was actually enjoyable, specifically for the reason that I’m looking for thoughts on that matter a couple weeks ago.

  30. ruagkf96 says:

    I simply couldn’t go away your website before suggesting that I extremely enjoyed the standard info a person supply for your visitors? Is going to be back incessantly to check up on new posts

  31. armani 0652 says:

    Nice post. You often write a intriguing post. I will come again in the near future.

  32. daminin says:

    A person necessarily lend a hand to make seriously articles I would state. That is the first time I frequented your web page and up to now? I surprised with the analysis you made to create this particular publish extraordinary. Great process!

  33. Hot Carl says:

    Thank you a lot for giving everyone an exceptionally remarkable possiblity to read in detail from this site. It is often so superb and also full of fun for me personally and my office co-workers to visit your site the equivalent of 3 times weekly to learn the new issues you have. And indeed, I’m also at all times pleased considering the perfect tips and hints you give. Some 2 points in this posting are particularly the very best we’ve ever had.

  34. Vince Wilburn says:

    I discovered your blog site on google and examine just a few of your early posts. Continue to keep up the superb operate. I simply additional up your RSS feed to my MSN Information Reader. Searching for ahead to studying more from you later on!…

  35. Mcaninch81 says:

    I do not mind sitting here in my pc and doing nothing but getting impressed by how excellent and fantastic this web site of yours is actually. There’s no other site that will keep me glued for a time other than yours. Please continue the good work!

  36. Tibia guide says:

    I savor, lead to I discovered just what I was taking a look for. You’ve ended my 4 day long hunt! God Bless you man. Have a great day. Bye

  37. Marisol Loter says:

    You made a few good points there. I did a search on the theme and found mainly persons will have the same opinion with your blog.

  38. Alyssa Charles says:

    I won’t be able to thank you fully for the articles on your web-site. I know you’d put a lot of time and energy into all of them and hope you know how much I appreciate it. I hope I could do the same for someone else sometime.

  39. Lorene Cooper says:

    I’m impressed, I have to say. Really hardly ever do I encounter a blog that’s both educative and entertaining, and let me tell you, you will have hit the nail on the head. Your idea is excellent; the problem is something that not enough people are speaking intelligently about. I am very pleased that I stumbled across this in my seek for something relating to this.

  40. injury lawyers phoenix says:

    Hi there would you mind letting me know which web host you’re using? I’ve loaded your blog in 3 completely different browsers and I must say this blog loads a lot quicker then most. Can you suggest a good hosting provider at a honest price? Thank you, I appreciate it!

  41. Joseph Natalie  says:

    Great post. I am facing a couple of these problems.

  42. Landon Audrey  says:

    Pretty! This was a really wonderful post. Thank you for your provided information.

  43. Lindsy Douthart says:

    I really appreciate this post. I have been looking all over for this! Thank goodness I found it on Bing. You have made my day! Thanks again!

  44. Delbert Kreke says:

    Thanks so much for submitting this. Quick enquiry, if you don’t object. Where did you get your blog template? I’m creating a website and value your site.

  45. Morton Ellstrom says:

    I simply want to tell you that I am just all new to blogs and really liked your blog site. Almost certainly I’m likely to bookmark your blog . You amazingly come with perfect well written articles. Kudos for revealing your web-site.

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s

Follow

Get every new post delivered to your Inbox.

%d bloggers like this: