4 ms·
Memristors in silicon promising for dense, fast memory
- aidenn0 15y agoAnyone else find it a bit lame that they couldn't test switching time below 90ns with the excuse that they didn't have the equipment?
- cheatercheater 15y agoNo, because I don't understand the process they would need to measure, and neither do you
- Symmetry 15y agoAs awesome as RRAM is, and as much as I've boosted it in the past[1], there are still lots of things that could go wrong. Unless its practical to manufacture in large quantities, this won't go anywhere for instance. [1]http://hopefullyintersting.blogspot.com/2011/12/resistive-ram.html http://hopefullyintersting.blogspot.com/2011/12/resistive-ra...
- mbenjaminsmith 15y agoI'm not sure why you left out R. Stanley Williams in your post there. Leon Chua postulated the existence of a "4th" electrical component but didn't make any progress on it himself. Listen to Williams' main talk on YouTube. I'm pretty sure they've sorted out how to manufacture memristor-based RAM -- and are licensing the process out already.
- anamax 15y agoSee Williams ee380 talk as well - http://www.stanford.edu/class/ee380/fall-schedule-20112012.html http://www.stanford.edu/class/ee380/fall-schedule-20112012.h... .
- dwiel 15y agoI'm excited to see cheap memristor devices that provide access to their computational ability.
- zokier 15y agoIs there any info about discrete memristors, will there ever be such things, or will all products be only integrated solutions? By discrete memristor I mean part comparable to an individual resistor or transistor. Something elementary, which the electronics-geek in me could play with.
- hwillis 15y agoMemristor-like components have existed since 1960 (http://en.wikipedia.org/wiki/ADALINE http://en.wikipedia.org/wiki/ADALINE). There is no demand for a discrete component so I doubt anyone would start making them. You could make an analogous device with a microcontroller, but that kind of defeats the purpose. Anyway its an elementary circuit element, so its behavior is fully described and not super exciting.
- cheatercheater 15y agoWeren't those super-expensive? You know, the reason resistors are basic elements is among others that they're cheap.. I think a simple SiO layer, which is what this newest memristor tech is based on, could be super cheap. Even if you can't build "big memristors", you could just parallel thousands of them in a single package. Then, they would start being approachable. Besides, tiny capacitance hasn't stopped anyone from using the likes of varicaps, and huge inductance never stopped anyone from using an inductor. They have their place. I, for one, want to see a discrete Memristor in all shapes and sizes. If we don't try it, and don't experiment with it, we might be shutting out 1/4 of all electronics. Luckily, a lot of electronics companies do feel their responsibility as educators. That's why we have samples (I'll teach you to use my chip, and if you become an important circuit designer you'll use my chips in your designs), that's why we have lots of antiquated chips still in production (stuff like OTAs which is of interest only to miniscule hobbyist groups), that's why we can still buy devices in units. I'm looking forward to it.
- anamax 15y agoAccording to Williams, you can't make big memristors - the effect is due to micro mechanisms. Given that, it doesn't make much sense to make "single" memristors. See http://www.stanford.edu/class/ee380/fall-schedule-20112012.html http://www.stanford.edu/class/ee380/fall-schedule-20112012.h... .
- haberman 15y agoMemristors promise to flatten part of the memory hierarchy, merging non-volatile storage and RAM. But the interesting question to me as a systems programmer is whether they will ever merge cache with everything else too. This question is really important because if there were no cache there would no longer be any benefit to compactness and locality in memory -- data structures distributed across large areas of the address space would be just as efficient as ones that are well-localized. To be honest this idea worries me a little. The performance advantage of small and local data structures is one of the main natural forces that encourages software to be small and simple. Software tends to grow over time, both in size and complexity, especially when more people are involved. Unchecked I fear that there would be no natural counterbalance to this tendency. Put another way, I'm actually a bit glad that Eclipse is horribly slow, because it's an easy-to-observe symptom of the fact that it's a horribly complex stack of software. If software like Eclipse could get by with acceptable performance because it had fast access to vast swaths of memory, it would be that much harder for an upstart competitor in this space (like Light Table) to be disruptive, because Eclipise would perform well enough that competing on speed doesn't impress. I'm probably oversimplifying a bit, but I do think it generally good for programmers when simpler software also has better performance naturally. But even if Memristors could be as fast as SRAM, could you out enough of it close enough to the CPU that it truly flattens the memory hierarchy completely? This is where I hit the limits of my knowledge of computer architecture.
- glhaynes 15y agoI don't quite understand the argument - if there's no problem with increased size, why should we worry about size? People from the 1960s would be shocked to hear how large our software is today already, but since we have the capacity to run it successfully, I'm glad that we've freed up programmers to work with more productivity. As far as complexity: there will always be costs to complexity in terms of agility and reliability. And using less compact data structures often leads to less complex code, anyway.
- haberman 15y ago> As far as complexity: there will always be costs to complexity in terms of agility and reliability. Yes, but I worry about a world where only the programmers bear the cost of the complexity. If reduced complexity does not benefit the user, it becomes harder to justify time spent on reducing complexity. > And using less compact data structures often leads to less complex code, anyway. I disagree, unless you're talking about extreme cases like fancy structure packing. More compact data structures mean less program state. Less program state means less complicated state changes and less redundancy. Litmus test: if your program has entered a bad state, how much data do you have to inspect to discover what the inconsistency is? And how much code do you have to inspect to figure out how it happened?