arma-thesis

commit cf40ca271660966560e98639deaa35cca5a269a7
parent 76494c64a0f35f00553f0d52dc07bf01e134f8b3
Author: Ivan Gankevich <igankevich@ya.ru>
Date:   Mon,  6 Feb 2017 17:14:37 +0300

Add tree hierarchy example graph.

Diffstat:
phd-diss-ru.org
 | 
37
+++++++++++++++++++++++++++++++++----
phd-diss.org
 | 
46
++++++++++++++++++++++++++++++++++++++++++++++

2 files changed, 79 insertions(+), 4 deletions(-)
diff --git a/phd-diss-ru.org b/phd-diss-ru.org
@@ -2586,16 +2586,45 @@ cite:lantz2010network,handigol2012reproducible,heller2013reproducible, где
 # TODO
 #+end_src
 
-#+caption: Зависимость времени объединения узлов в кластер в зависимости от их количества.
+#+caption: Зависимость времени объединения узлов в кластер от их количества.
 #+RESULTS: fig:bootstrap-local
 
 #+name: fig:tree-hierarchy-11
-#+begin_src R
-# TODO
+#+begin_src dot :exports results :file build/tree-hierarchy-11-ru.pdf
+digraph {
+
+  node [fontsize=14,margin="0.055,0",shape=box,style=rounded]
+  graph [nodesep="0.15",ranksep="0.20",rankdir="BT"]
+  edge [arrowsize=0.66]
+
+  m1 [label="127.0.0.1"]
+  m2 [label="127.0.0.2"]
+  m3 [label="127.0.0.3"]
+  m4 [label="127.0.0.4"]
+  m5 [label="127.0.0.5"]
+  m6 [label="127.0.0.6"]
+  m7 [label="127.0.0.7"]
+  m8 [label="127.0.0.8"]
+  m9 [label="127.0.0.9"]
+  m10 [label="127.0.0.10"]
+  m11 [label="127.0.0.11"]
+
+  m2->m1
+  m3->m1
+  m4->m2
+  m5->m2
+  m6->m3
+  m7->m3
+  m8->m4
+  m9->m4
+  m10->m5
+  m11->m5
+}
 #+end_src
 
-#+caption: Древовидная иерархия для 11 узлов.
+#+caption: Древовидная иерархия для 11 узлов для ветвления равного 2.
 #+RESULTS: fig:tree-hierarchy-11
+[[file:build/tree-hierarchy-11-ru.pdf]]
 
 *** Алгоритм восстановления после сбоев
 **** Введение.
diff --git a/phd-diss.org b/phd-diss.org
@@ -2401,6 +2401,52 @@ principal only, and inefficient scan of all network by each node does not occur.
 
 **** Evaluation results.
 
+#+name: fig:bootstrap-local
+#+begin_src R
+# TODO
+#+end_src
+
+#+caption: Зависимость времени объединения узлов в кластер от их количества.
+#+RESULTS: fig:bootstrap-local
+
+#+name: fig:tree-hierarchy-11
+#+begin_src dot :exports results :file build/tree-hierarchy-11.pdf
+digraph {
+
+  node [fontsize=14,margin="0.055,0",shape=box,style=rounded]
+  graph [nodesep="0.15",ranksep="0.20",rankdir="BT"]
+  edge [arrowsize=0.66]
+
+  m1 [label="127.0.0.1"]
+  m2 [label="127.0.0.2"]
+  m3 [label="127.0.0.3"]
+  m4 [label="127.0.0.4"]
+  m5 [label="127.0.0.5"]
+  m6 [label="127.0.0.6"]
+  m7 [label="127.0.0.7"]
+  m8 [label="127.0.0.8"]
+  m9 [label="127.0.0.9"]
+  m10 [label="127.0.0.10"]
+  m11 [label="127.0.0.11"]
+
+  m2->m1
+  m3->m1
+  m4->m2
+  m5->m2
+  m6->m3
+  m7->m3
+  m8->m4
+  m9->m4
+  m10->m5
+  m11->m5
+}
+#+end_src
+
+#+caption: Tree hierarchy for 11 nodes with fan-out equals 2.
+#+RESULTS: fig:tree-hierarchy-11
+[[file:build/tree-hierarchy-11.pdf]]
+
+
 *** Fail over algorithm
 **** Introduction.
 Fault tolerance of data processing pipelines is one of the top concerns in