Graph-oriented programming
Graph-oriented programming (GOP) is used to represent complex processes in distributed systems . Due to the limited scope of GOP, this technique is used to represent the structure of the system in a simple and understandable manner as a logical graph . GOP is independent of any programming language and platform .
The graph consists of so-called nodes ( nodes ) and transactions which show from one node to another or to itself. The nodes symbolize local programs that can be distributed on different machines. A transaction represents a relationship between two nodes. A process is made up of nodes and transactions and thus represents a directed graph .
The programmer has to independently translate the logical graph into a source code using low-level primitives . For this purpose, the graph is first created which shows the structure and the relationship between the local programs in the distributed system. The graph is then converted into program code.
Individual evidence
- ↑ Archive link ( Memento of the original from July 28, 2014 in the Internet Archive ) Info: The archive link was inserted automatically and has not yet been checked. Please check the original and archive link according to the instructions and then remove this notice.
- ↑ http://www.springer.com/computer/swe/book/978-3-540-20054-3
- ↑ http://doc.javanb.com/jboss-jbmp-3-0-4-userguide/graphorientedprogramming.html
- ↑ http://www.springer.com/computer/swe/book/978-1-4020-7448-6
