"Paul J. Reder" wrote:
>
> Well since no one has commented, and I know how much everyone loves code
> I'm going to go ahead and start implementing this in four phases:
May I suggest another additional phase. In which you add an extra hook
that would create this?? This hook could then also being used by
management
module to spwan off processes that then also have access to the
scoreboard
info.
What I mean here is some patch that I sent a time ago. I know the patch
was not a good solution, but the idea is what counts here (IMHO).
>
> 1. Just update the data structures and minimal code to work with data
> structure changes. No other code changes. This mostly amounts to
> adding some extra as yet unused fields.
> 2. Add in code to update the data structure linkages (next pointers).
> This would still use the existing algorithms for using indexes into
> the allocated array and would still expect contiguous space. But the
> beginnings of the linked lists would be established.
> 3. Finish changing the code to remove any contiguous space requirements.
> All linked list work and use of worker_score pointers would be
> implemented here. This is the first big step.
> 4. Alter the worker creation and cleanup logic to take advantage
> of the new non-contiguous freedom provided in the previous steps.
>
--
address: Covalent Technologies, 645 Howard St, San Francisco, CA - 94105
phone: +1-415-536-5221 fax:+1-415-536-5210
personal website: http://www.lisanza.net/
Harrie
