The primary processes are Root and Node. Root holds the base data and then sends a different subset of the data to each Node process. The Node process then evaluates its subset and returns the outcome to the Root as a feedback object. The Root then recombines the data from all the Nodes into the main data structure. It then determines whether the required termination condition has been reached. If not the process is repeated. At each stage the current state of the data object can be output though this can be disabled.
Author, Licence and Copyright statement author Jon Kerridge School of Computing Edinburgh Napier University Merchiston Campus, Colinton Road Edinburgh EH10 5DT Author contact: j.kerridge (at) napier.ac.uk Copyright Jon Kerridge Edinburgh Napier University * Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License.
Class | Description |
---|---|
BasicDandC | BasicDandC provides a simple Divide and Conquer architecture that can be used in many cases. |
Node | Node is a fundamental process that reads an inputObject, processes it and then writes the processed object to the Root process in the D&C process network. |
Root | Root is part of the Divide and Conquer process architecture and is intended to operate in conjunction with a Node process. |