Description
Processing Colonies provide a means of distributing applications across multiple machines.
The mapping of application circuitry (logical) to executable processes (physical) is referred to as accretion. Applications typically have multiple mappings from their top level container's contents to individual processes (see Containers). Each one of these mappings is referred to as an 'Accretion'. Each Accretion will comprises a number of processes, with each process containing some part of the whole application. Each of these processes may then be built as a root-master, sub-master and/or slave executable.
The accretion process allows the whole logical application to be partitioned by functionality into multiple sub-systems, and processing colonies can then be used to improve the performance of each slave-able sub-system. An accreted process is executable if at least one of its component circuits contains a slave-able method.
Scheduling
Examples
