- SymmetryParticipantDecember 29, 2013 at 6:36 pmPost count: 28
So, a topic that I know I’ve been wondering about regarding the Mill’s memory subsystem. How does it deal with Unix fork calls? The two resulant processes could potentially each have a whole mass of pointers with identical numerical values, and they’ll now have to point to different locations in memory, which would seem to be inconsistant with the Mill’s memory model. Now, forks that aren’t followed by execs are pretty rare but I don’t see that this is something that can just be ignored.
- Joe TaberParticipantDecember 30, 2013 at 12:15 pmPost count: 25
- PeterHParticipantJanuary 2, 2014 at 7:09 pmPost count: 41
Threads, vfork(), page aliasing, and copy on write all appear easy enough with mill mechanisms already described. fork() has the added complication of getting pointers defined by the parent to work with the child address range. My best guess is something along the lines of segments might be used. Done right the segments might be transparent to the application a majority of the time.
- Ivan GodardKeymasterJanuary 2, 2014 at 9:38 pmPost count: 689
As described in the Memory talk, page aliasing and COW work straightforwardly, although with one catch on the Mill: an unwritten COW page will have only one copy in memory because the physical address is aliased, but any lines in cache will be duplicated because the virtual addresses differ even though the data will be the same 🙁
You must be logged in to reply to this topic.