Browse thread
Faking concurrency using Unix forks and pipes
[
Home
]
[ Index:
by date
|
by threads
]
[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
| Date: | -- (:) |
| From: | Richard Jones <rich@a...> |
| Subject: | Re: [Caml-list] Faking concurrency using Unix forks and pipes |
On Wed, May 30, 2007 at 09:54:32AM +0100, Jon Harrop wrote: > On Wednesday 30 May 2007 09:13:00 Erik de Castro Lopo wrote: > > How much does a concurrent GC actually buy in comparison to > > multiple processes each with their own GC and a robust way > > of passing data between processes? > > 1. Shared memory and locks should be much faster for synchronization than > marshalling between processes. > > 2. Forking results in multiple GCs redundantly traversing the same heap and, > worst case, it may end up copying the entire heap in the child process in > order to deallocate it. Fixed: http://merjis.com/developers/ancient Rich. -- Richard Jones Red Hat