Difference between revisions of "Nodal reduction"
m |
m |
||
| Line 7: | Line 7: | ||
=== The Reduction Algorithm === | === The Reduction Algorithm === | ||
| − | The reduction algorithm divides available execution up into ''[[Quantum| | + | The reduction algorithm divides available execution up into ''[[Quantum|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 [[associations|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 [[Wikipedia:Asscoiative array|associative arrays]], and the ''state'' is in a form specific to the local [[Wikipedia:Runtime|runtime]] environment (if there is no state, it will be returned as the local environments representation of ''null''). | Each [[node]] has both [[associations|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 [[Wikipedia:Asscoiative array|associative arrays]], and the ''state'' is in a form specific to the local [[Wikipedia:Runtime|runtime]] environment (if there is no state, it will be returned as the local environments representation of ''null''). | ||
| − | Using an association called ''[[Next]]'', allows the formation of ''[[loop]]s'' ([[Wikipedia:Linked list|singly-linked-circular lists]]) within the local [[Nodal Space]]. By combining this with another association called ''[[Now]]'' allows the formation of a ''loop-tree'' starting at the [[root]] node, where following the ''now'' associations from root takes us down into another node, which is part of a loop. Every traversal of a ''now'' takes us to an item in a loop. The loop may contain zero items, but the idea here is that [[now]]'s always lead to items in loops, even though other associations may lead to other nodal structure which may or may not be a loop. | + | Using an association called ''[[Next]]'', allows the formation of ''[[loop]]s'' of nodes ([[Wikipedia:Linked list|singly-linked-circular lists]]) within the local [[Nodal Space]]. By combining this with another association called ''[[Now]]'' allows the formation of a ''loop-tree'' starting at the [[root]] node, where following the ''now'' associations from root takes us down into another node, which is part of a loop. Every traversal of a ''now'' takes us to an item in a loop. The loop may contain zero items, but the idea here is that [[now]]'s always lead to items in loops, even though other associations may lead to other nodal structure which may or may not be a loop. |
When a node receives a quantum of execution, it first checks if the ''[[state]]'' of the node is locally executable (e.g. it is a function reference), and if so it executes it and exits. That quantum is then considered consumed, and the next quantum is executed starting at the [[root]] node again. If the state is not executable, then the quantum is passed (execution is passed to) the nodes [[now]] association. If there is no [[now]] association, the quantum is passed back to the [[Root]] node unspent. | When a node receives a quantum of execution, it first checks if the ''[[state]]'' of the node is locally executable (e.g. it is a function reference), and if so it executes it and exits. That quantum is then considered consumed, and the next quantum is executed starting at the [[root]] node again. If the state is not executable, then the quantum is passed (execution is passed to) the nodes [[now]] association. If there is no [[now]] association, the quantum is passed back to the [[Root]] node unspent. | ||
Revision as of 22:24, 12 May 2006
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).
Using an association called Next, allows the formation of loops of nodes (singly-linked-circular lists) within the local Nodal Space. By combining this with another association called Now allows the formation of a loop-tree starting at the root node, where following the now associations from root takes us down into another node, which is part of a loop. Every traversal of a now takes us to an item in a loop. The loop may contain zero items, but the idea here is that now's always lead to items in loops, even though other associations may lead to other nodal structure which may or may not be a loop.
When a node receives a quantum of execution, it first checks if the state of the node is locally executable (e.g. it is a function reference), and if so it executes it and exits. That quantum is then considered consumed, and the next quantum is executed starting at the root node again. If the state is not executable, then the quantum is passed (execution is passed to) the nodes now association. If there is no now association, the quantum is passed back to the Root node unspent.
The process of traversing down a now association also involves an active (but non-entropic and reversable) change to the structure. It involves following the now, then before beginning the quantum consumption phase, it gets the node-reference in the next association and overwrites the now association of the parent which we just followed to get here. This means that the next time we follow that same now we will arrive at the next item in this loop. In other words, the nodal reduction process is rotating the loops in the tree, so that all of them will get execution focus.
Notes
- Also known as Entropy, Consumption, Execution
- Not using dual-quanta-model or energy-via-class concepts
- See also
