simon/post-scarcity
1
0
Fork 0
Code Issues Pull requests Actions Packages Projects Releases Wiki Activity

Updated parallelism (markdown)

Simon Brooke 2017-09-19 13:02:31 +01:00
parent 0c638e104a
commit 84298b486a
1 changed files with 4 additions and 0 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

4
parallelism.md

@ -35,3 +35,7 @@ If the node which starts the evaluation evaluates the most costly argument itsel
1. Don't hand off anything which evaluates to itself; 1. Don't hand off anything which evaluates to itself;
2. Don't hand off the argument the compiler predicts will be most expensive; 2. Don't hand off the argument the compiler predicts will be most expensive;
3. Only hand off to a slow to reach neighbour arguments the compiler predicts will be very expensive. 3. Only hand off to a slow to reach neighbour arguments the compiler predicts will be very expensive.
Note that there will be different costs here depending whether we have one memory map per node (i.e. each node curates one cons page and its own vector space, and must copy objects from other nodes into its own space before it can compute on them), or one memory map per crystal, in which case nodes on the same crystal do not need to copy data across.
Copying data, especially if it comes from a node further than a proximal neighbour, will be extremely expensive.