[Haskell-cafe] Haskell-Cafe Digest, Vol 158, Issue 29

Joachim Durchholz jo at durchholz.org
Mon Oct 31 20:54:54 UTC 2016

Am 31.10.2016 um 05:07 schrieb Richard A. O'Keefe:
> But even when communication is disguised as memory accessing,
> it's still communication, it still *costs* like communication,
> and if you want high performance, you had better *measure* it
> as communication.

And you need to control memory coherence, i.e. you need to define what 
data goes together with what processes.

In an ideal world, the compiler would be smart enough to do that for you.
I have been reading fantasies that FPLs with their immutable data 
structures are better suited for this kind of automation; has compiler 
research progressed enough to make that a realistic option?

Without that, you'd code explicit multithreading, which means that 
communication does not look like memory access at all.

More information about the Haskell-Cafe mailing list