4 ms·
Actually, it's the other way around; it sounds like they are talking about having lots of processors literally physically spread amongst the data. That's sort o
by jerf 17y ago
Actually, it's the other way around; it sounds like they are talking about having lots of processors literally physically spread amongst the data. That's sort of more Erlang-y, although it isn't actually Erlang-y either. Erlang pretty deeply assumes homogeneity of the computational units it is accessing. (It does allow you to start a process on a given node, and that's a start, but the VM's strategies for memory management and copying on a given node would have to change quite substantially to cope better. Or map one node to each processor-in-the-memory in which case I'd expect too much copying between nodes to occur without a lot of care taken by the programmer, sort of fighting the language the whole time. Erlang lets you control where processes run, but not directly control where data lives beyond that.) Basically this future seems to be NUMA writ large, and while an "Erlang-inspired" language may be the way forward, Erlang itself would not make this transition without substantial changes. (Might be feasible, though.)
But Javascript as it stands today is even worse off, as are most languages. We don't really have much that could cope with this right now in a clean way. (Anyone know a language that really handles NUMA well? And I do mean a language, not a library for C or something. Something slick, not something that merely "permits" working with it.)
- paulbaumgart 17y agoI agree that there's no technical reason for artificially limiting yourself to a single (but really fast) "computational unit". But I wonder whether it will be worth the trouble (at least to the majority) if you can basically get away with only worrying about one processor, and that one processor is no longer limited in its clock rate by the current leaking, massively heat dissipating MOSFETs we have today.
- wingo 17y agoConnection machine lisp. http://scholar.google.com/scholar?cluster=14034330201935018123&hl=en&as_sdt=2000 http://scholar.google.com/scholar?cluster=140343302019350181...
- btilly 17y agoAnyone know a language that really handles NUMA well? Depending on what you mean by well, any language that offers fork() as a primitive does work. The trick is that this allows you to create 2 copies of a process that share little enough that a scheduler can safely move them from one machine to another. By contrast with threading you have the problem that the scheduler cannot know when it is safe to schedule two threads on distant CPUs. Of course this only lets you scale embarrassingly parallel problems. For another approach that could be made to work reasonably well, try Go. Its central idea is that you pass messages to the processing job, and not vice versa. Figuring out how to schedule threads is a complex task, but run-time scheduling heuristics should do a reasonable job of that for most problems. (Writing algorithms that reliably avoid having bottlenecks will be an interesting challenge.) And a third approach to watch is Parallel Haskell. Because of the guarantees it offers, the opportunities to rewrite the program at run-time based on what is appropriate are extremely interesting.
- warfangle 17y agoIt's even more different than that. It's a collection of nodes, any of which can be either CPU transistors, bitkeepers, or both, at any given time - and change with the problem space. While we may be able to target it with Erlang or JavaScript or whathaveyou eventually, it's going to need a completely different kind of instruction set than what any CPU currently has.