3 ms·

> If the majority of your code is map/reduce that's great for you who said it was? (it isn’t.) you asked for examples, and i gave the most recent one. > You n

> If the majority of your code is map/reduce that's great for you who said it was? (it isn’t.) you asked for examples, and i gave the most recent one. > You need to split up your workload, schedule the work across the cores, pass the actual data as messages to whatever 'task' abstraction you're using, and unless the garbage collector has fancy tricks, this will mean having to deep-copy the data to preserve thread safety. you’re making a huge amount of assumptions and supposed “costs” here based upon the rather limiting nature of most programming languages when it comes to concurrency. most of the multicore programming i do is with actors with a data flow language. multicore programming is so trivial you don’t even think about it.

yawaramin 8y ago
> who said it was? (it isn’t.) you asked for examples, and i gave the most recent one. OK, but then, outside of that kind of use case, most applications are not trivially parallelizable like that. > most of the multicore programming i do is with actors with a data flow language. multicore programming is so trivial you don’t even think about it. Maybe I miscommunicated, but I don't mean that you literally are doing all these things, but that something is–some combination of the language, the runtime, and the developer. My point is that no matter who is doing it, these things have costs–runtime performance, memory use, limits on the usable data structures and programming techniques.