Version française
Home     About     Download     Resources     Contact us    

This site is updated infrequently. For up-to-date information, please visit the new OCaml website at

Browse thread
Faking concurrency using Unix forks and pipes
[ Home ] [ Index: by date | by threads ]
[ Search: ]

[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: 2007-05-30 (17:46)
From: Pablo Polvorin <pablo.polvorin@g...>
Subject: Re: [Caml-list] Faking concurrency using Unix forks and pipes
> 1. Shared memory and locks should be  much faster
> for synchronization than  marshalling between processes.

as long as i don't have to use ugly locks in my code, that will be ok.
But I think that the Erlang approach is simpler and more elegant than
the use of locks - critical regions. Also, as already mentioned, it
offers an easy transition from multicore to distributed computing,
where shared memory isn't available.

2007/5/30, Jon Harrop <>:
> 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?

> 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.
> --
> Dr Jon D Harrop, Flying Frog Consultancy Ltd.
> OCaml for Scientists
> _______________________________________________
> Caml-list mailing list. Subscription management:
> Archives:
> Beginner's list:
> Bug reports:

Pablo Polvorin