Nodal reduction
Overview
A Nodal Space includes a process called Nodal Reduction which is an execution model, or runtime environment which uses generic organisational concepts to manage the interactions over time within categorised collections of data and functions.
When designing applications or organisations for the nodal reduction environment, the idea is to describe as little as possible in terms of local data and functions, and as much as possible in terms of nodally-reducable structure, called processes. Nodal processes are totally reusable and independent of the target language, platform or OS-environment.
The Reduction Algorithm
The reduction algorithm divides available execution up into Quanta which are considered as the indivisiable "atoms" of change. They have no definite rules about the amount of time they can take to execute, but should be generally infinitesimal compared to the macro scale. Any looping or iteration-based functionality should be implimented in terms of reducable structure (process). Top level nodal reduction is implimented as an infinite execute-quantum loop within the context of the Root node of the local Nodal Space.
Each node has both associative content and a possible local state. The associations are in the form of nodeRef:nodeRef pairs similar in concept to the key:value pairs of associative arrays, and the state is in a form specific to the local runtime environment (if there is no state, it will be returned as the local environments representation of null). One of the associations, called Next, is specific to nodal reduction, and allows each node to exhibit a loop (singly-linked-circular list) which contains as values references to all its child-nodes which currently undergoing execution.
Consumption and rotation of the loops...
Notes
- Also known as Entropy, Consumption, Execution
- Not using dual-quanta-model or energy-via-class concepts
- See also
