Inside the Vertex 2 Pro

This time there were no stickers telling me that I’d love this SSD, just a brown ESD bag and a plain looking SSD inside.

Pop the top off and you are greeted with a 90mF capacitor. Its duty is to deliver enough power to the controller to commit any buffered data to flash if there’s ever a sudden loss of power.

I asked SandForce why they needed such a large capacitor as Intel can get away with much smaller caps. It actually has to do with the amount of data buffered. Intel’s X25-M buffers somewhere in the low hundreds of KB of data (with a 512KB L2 cache I’m guessing it’s somewhere below that). The SF controllers buffer a couple of megabytes of data, hence the much larger capacitor.

SandForce did point out that the capacitor is a feature of the SF-1500 design, despite OCZ’s use of it on the Vertex 2 Pro.

That brings us to the controller used in the Vertex 2 Pro. Ultimately SandForce is going to have two controllers - the SF-1200 and the SF-1500. Currently the two controllers have a unified firmware and feature set, which is why both OCZ and SF refer to the Vertex 2 Pro as being somewhere in between a 1200 and a 1500. It’s a SF-1200 controller with the firmware of the SF-1500 as far as I can tell. The final shipping version with be a full fledged SF-1500.

The cost of the Vertex 2 Pro is going to be high. Higher than Intel’s X25-M and any other consumer level SSD on the market today. OCZ is targeting it at the very high end desktop/workstation user or perhaps even entry level enterprise customer.

We won’t see the Vertex 2 Pro available in the channel until March. But this isn’t the only SandForced based SSD we’ll get from OCZ though. At some point in the future we’ll have an SF-1200 based SSD that’s priced around the same level as the top-bin Indilinx based Vertex drives. It’s too early to talk about timing on that one though.

Capacities and Hella Overprovisioning The OCZ Toolbox
Comments Locked


View All Comments

  • Holly - Friday, January 1, 2010 - link

    Hmm, I thought MLC/SLC is more the matter of SSD controller than memory chip itself? Anybody could throw a bit light pls?
  • bji - Friday, January 1, 2010 - link

    MLC and SLC are two different types of flash chips. You can find out more at:">">
  • Holly - Friday, January 1, 2010 - link


    according to">

    they are not nescessary the same chips... the transistors are very much the same and it's more or less matter of how you interpret the voltages

    Intel actually uses the same transistors for its SLC and MLC flash, the difference is how you read/write the two.
  • shawkie - Friday, January 1, 2010 - link

    Call me cynical but I'd be very suspicious of benchmark results from this controller. How can you be sure that the write amplification during the benchmark resembles that during real world use? If you write completely random data to the disk then surely its impossible to achieve a write amplification of less than 1.0? I would have thought that home users would be mostly storing compressed images, audio and video which must be pretty close to random. I'd also be interested to know if the deduplication/compression is helping them to increase to the effective reserved space. That would go a long way to mask read-modify-write latency issues but again, what happens if the data on the disk can't be deduplicated/compressed?
  • Swivelguy2 - Friday, January 1, 2010 - link

    On the contrary - if you write random data, some (probably lots) of that data will be duplicated on successive writes simply by random chance.

    When you write already-compressed data, an algorithm has already looked at that data and processed it in a way that makes sure there's very little duplication of data.
  • Holly - Friday, January 1, 2010 - link

    It's always matter of used compression algorithm. There are algorithms that are able to press whole avi movie (= already compressed) to few megabytes. Problem with these algoritms is they are so demanding it takes days even for neuron network to compress and decompress. We had one "very simple" compression algorithm in graphs theory classes.. honestly I got ultimately lost after first read paragraph (out of like 30 pages).

    So depending on algorithms used you can compress already compressed data. You can take your bitmap, run it through Run Length Encoding, then run it through Huffman encoding and finish with some dictionary based encoding... In most cases you'll compress your data a bit more every time.

    There is no chance to tell how this new technology handles it's task in the end. Not until it is ran with Petabytes of data.
  • bji - Friday, January 1, 2010 - link

    Please don't use an authoritative tone when you actually don't know much about the subject. You are likely to confuse readers who believe that what you write is factual.

    The compression of movies that you were talking about is a lossy compression and would never, ever be suitable in any way for compressing data internally within an SSD.

    Run Length Encoding requires knowledge of the internal structure of the data being stored, and an SSD is an agnostic device that knows nothing about the data itself, so that's out.

    Huffman encoding (or derivitives thereof) is universally used in pretty much every compression algorithm, so it's pretty much a given that this is a component of whatever compression SandForce is using. Also, dictionary based encoding is once again only relevent when you are dealing with data of a generally restricted form, not for data which you know nothing about, so it's out; and even if it were used, it would be used before Huffman encoding, not after it as you suggested.

    I think your basic point is that many different individual compression technologies can be combined (typically by being applied successively); but that's already very much de riguer in compression, with every modern compression algorithm I am familiar with already combining several techniques to produce whatever combination of speed and effective compression ratios is desired. And every compression algorithm has certain types of data that it works better on, and certain types of data that it works worse on, than other algorithms.

    I am skeptical about SandForce's technology; if it relies on compression then it is likely to perform quite poorly in certain circumstances (as others have pointed out); it reminds me of "web accelerator" snake oil technology that advertised ridiculous speeds out of 56K modems, and which only worked for uncompressed data, and even then, not very well.

    Furthermore, this tradeoff of on-board DRAM for extra spare flash seems particularly retarded. Why would you design algorithms that do away with cheap DRAM in favor of expensive flash? You want to use as little flash as possible, because that's the expensive part of an SSD; the DRAM cache is a miniscule part of the total cost of the SSD, so who cares about optimizing that away?
  • Holly - Friday, January 1, 2010 - link

    Well I know quite a bit about the subject, but if you feel offended in any way I am sorry.

    More I think we got in a bit of misunderstanding.

    What I wrote was more or less serie of examples where you could go and compress some already compressed data.

    It's quite common knowledge you won't be able to lossless compress well made AVI movie with normally used lossless compression software like ZIP or RAR. But, that is not even a slightest proof there isn't some kind of algorithm that can compress this data to a much smaller volume.

    To prove my concept of theory I took the example of bitmap (uncompressed) and then used various lossless compression algorithms. In most cases every time I'd use the algorithm I would get more and more compressed data (well maybe except RLE that could end up with longer result than original file was).

    I was not forcing any specific "front end" used algorithms on this controller, because honestly all talks about how (if) it compresses the data is mere speculation. So I went back to origins to keep the idea as simple as possible.

    Whole point I was trying to make is there is no way to tell if it saves data traffic on NANDs when you save your file XY on this device simply because there is no knowledge what kind of algorithm is used. We can just guess by trying to compress the file with common algorithms (be it lossless or not) and then try to check if the controller saves NANDs some work or not. OFC, algorithms used on the controller must be lossless and must be stable. But that's about all we can say at this point.

    Sorry if I caused some kind of confusion.

    What _seems_ to me is that basically there is this difference between X25-M and Vertex 2 Pro logic (taking the 25 vs 11 gigs example used in the article):
    System -> 25GB -> X25-M controller -> writes/overwrites -> 25 GB -> NAND flash (but due to overwrites, deletes etc. there is 11GB of data)

    compared to Vertex 2 Pro:
    System -> 25GB -> SF-1500 controller -> controller logic -> 11 GB -> NAND flash (only 11GB actually written in NAND due to smart controller logic)

  • sebijisi - Wednesday, January 6, 2010 - link

    It's quite common knowledge you won't be able to lossless compress well made AVI movie with normally used lossless compression software like ZIP or RAR. But, that is not even a slightest proof there isn't some kind of algorithm that can compress this data to a much smaller volume.

    Well actually there is. The entropy of the original file bounds the minimum possible size of the compressed file. Same reason you compress first before encrypting something: As the goal of encryption is to generate maximum entropy, encrypted data cannot be compressed further. Not even with some advanced but not yet know algorithm.
  • shawkie - Friday, January 1, 2010 - link

    As long as the data is truly random (i.e. there is no correlation between different bytes) then it cannot be compressed. If you have N bits of data then you have 2^N different values. It is impossible to map all of these different values to less than N bits. If you generate this value randomly its possible you might produce something that can be easily compressed (such as all zeros or all ones) but if you do it enough times you will generate every possible value an equal number of times so on average it will take up at least N bits. See">">

    As you note, it is possible to identify already-compressed data and avoid trying to recompress it but this still means you get a write amplification of slightly more than 1.0 for such data.

Log in

Don't have an account? Sign up now