Difference between revisions of "Peer"

From Organic Design wiki
m (Caretaker: Format cat links)
 
(3 intermediate revisions by the same user not shown)
Line 1: Line 1:
[[Category:Glossary]][[Category:Nodal Concepts]]
+
{{glossary}}
{{stub}}
+
[[Organic Design]] is developing a [[w:P2P|P2P]] [[w:distributed computing|distributed]] application to help [[the project]]. The software and all the code libraries which compose the source are all [[w:open source|open source]] [[w:freeware|freeware]] released under the [[GNU:licenses/licenses.html#GPL|GNU GPL licence]]. It comes as a single program called [[peerd]] which runs in the background as a [[w:daemon|daemon]] on Linux/Mac or a [[w:Windows services|service]] on Windows, all the running instances together form a [[w:Peer-to-peer|peer-to-peer]] network called a [[nodal network]].
A peer is any software which implements a [[Nodal Space]] and applies [[Nodal Reduction]] to it, thus becoming part of the global [[Nodal Network]].
 
*All resources available to the network are accessible via a particular peer
 
  
 +
From the application and user perspective the P2P aspect is hidden and instead a persistent [[w:Object Space|object space]] is shared by all peers. The space is a [[w:semantic network|semantic network]] composed of [http://www.w3.org/2000/10/swap/Primer RDF triples], in other words, the objects in the shared space are connected by relationships, and those relationships are also objects in the space.
  
;See also
+
Each peer can serve interface sessions over HTTP to browsers (and later directly to the video output with SDL and OpenGL). A session is an ''instance'' of the interface class (and both the interface and the sessions are objects in the global object-space).
*[[:Category:Peer]]
+
 
*[[:Category:Peers]]
+
At [[w:runtime|runtime]] all peers in the network are equal, which ones are doing what is totally determined by the networks resource allocation. This allocation is done within the constraints set up in the resource instances, for example the local hard-drive of a peer is a resource which can be assigned with a constraint which only allows company content to be stored on it.
 +
 
 +
At any time there is always a great deal of work needing to be done by the network in terms of data processing and content distribution. A resource allocation mechanism is used to balance and reduce the overall workload by connecting the work nodes with the optimal service node. In [[w:grid computing|grid computing]], [[w:middleware|grid middleware]] services are used to schedule these connections in an RDF-based semantic network.
 +
 
 +
== See also ==
 +
*[[Peer-to-peer]]
 +
*[[Platform network]]

Latest revision as of 09:22, 22 July 2011

Glossary.svg This page describes a concept which is part of our glossary

Organic Design is developing a P2P distributed application to help the project. The software and all the code libraries which compose the source are all open source freeware released under the GNU GPL licence. It comes as a single program called peerd which runs in the background as a daemon on Linux/Mac or a service on Windows, all the running instances together form a peer-to-peer network called a nodal network.

From the application and user perspective the P2P aspect is hidden and instead a persistent object space is shared by all peers. The space is a semantic network composed of RDF triples, in other words, the objects in the shared space are connected by relationships, and those relationships are also objects in the space.

Each peer can serve interface sessions over HTTP to browsers (and later directly to the video output with SDL and OpenGL). A session is an instance of the interface class (and both the interface and the sessions are objects in the global object-space).

At runtime all peers in the network are equal, which ones are doing what is totally determined by the networks resource allocation. This allocation is done within the constraints set up in the resource instances, for example the local hard-drive of a peer is a resource which can be assigned with a constraint which only allows company content to be stored on it.

At any time there is always a great deal of work needing to be done by the network in terms of data processing and content distribution. A resource allocation mechanism is used to balance and reduce the overall workload by connecting the work nodes with the optimal service node. In grid computing, grid middleware services are used to schedule these connections in an RDF-based semantic network.

See also