On Sat, Oct 22, 2016 at 1:00 PM, jd1008 <jd1008(a)gmail.com> wrote:
Parallel server processes:
The server process might be coded so that for each request, it forks a child
process to serve the request.
Now, child processes have to compete for a lock on the list of files to be
served, one of the children will succeed
I honestly can't think of any good reason to spawn multiple children
that compete for a lock to do work, when the process that's starting
them *should* have adequate information about which clients are active
and which are idle, and can use that information to select a client on
which to start the process.
I'd also point out that this is a well-solved problem. There are
quite a few very good parallelization schedulers already available
(particularly for HTC purposes), so there's no need to write one for
this purpose.