|
182
|
1 package jp.ac.u_ryukyu.ie.cr.tatsuki.jungle.test;
|
|
|
2
|
|
|
3 import fj.Ord;
|
|
|
4 import fj.data.TreeMap;
|
|
|
5 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.DefaultJungle;
|
|
|
6 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.Jungle;
|
|
|
7 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.JungleTree;
|
|
|
8 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.JungleTreeEditor;
|
|
|
9 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.store.NodePath;
|
|
|
10 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.store.impl.DefaultNodePath;
|
|
|
11 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.store.impl.DefaultTreeEditor;
|
|
|
12 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.traverser.DefaultTraverser;
|
|
|
13 import org.xml.sax.SAXException;
|
|
|
14
|
|
|
15 import javax.xml.parsers.ParserConfigurationException;
|
|
|
16 import java.io.*;
|
|
|
17 import java.nio.ByteBuffer;
|
|
|
18 import java.util.Random;
|
|
|
19
|
|
|
20 /**
|
|
|
21 * Created by e115731 on 15/03/20.
|
|
|
22 */
|
|
|
23 public class JungleBenchMark {
|
|
|
24 public static void main(String[] args) throws InterruptedException, IOException, ParserConfigurationException, SAXException {
|
|
|
25
|
|
|
26
|
|
183
|
27 if (args.length < 1) {
|
|
|
28 System.out.println("args[0] = read or find, args[1] = separate or nonSeparate");
|
|
182
|
29 System.exit(0);
|
|
|
30 }
|
|
|
31
|
|
|
32 Runtime rt = Runtime.getRuntime();
|
|
|
33 int cpuNum = rt.availableProcessors();
|
|
|
34
|
|
183
|
35 Jungle jungle = new DefaultJungle(null, "hoge", new DefaultTreeEditor(new DefaultTraverser()));
|
|
|
36 JungleTree trees[] = new JungleTree[cpuNum];
|
|
182
|
37
|
|
183
|
38 if (args[1].equals("separate")){
|
|
|
39 for (int count = 0; count < cpuNum; count++) {
|
|
|
40 JungleTree tree = jungle.createNewTree("tree" + count);
|
|
|
41 JungleTreeEditor editor = tree.getTreeEditor();
|
|
|
42 editor = editor.putAttribute(new DefaultNodePath(), "key", ByteBuffer.wrap(String.valueOf(0).getBytes())).b();
|
|
|
43 JungleTreeEditor newEditor = createTree(0, new DefaultNodePath(), editor);
|
|
|
44 if (newEditor.success().isA()) {
|
|
|
45 System.out.println("success faild");
|
|
|
46 System.exit(1);
|
|
|
47 }
|
|
|
48 trees[count] = tree;
|
|
|
49 }
|
|
|
50 } else {
|
|
|
51 JungleTree tree = jungle.createNewTree("tree" );
|
|
|
52 JungleTreeEditor editor = tree.getTreeEditor();
|
|
|
53 editor = editor.putAttribute(new DefaultNodePath(), "key", ByteBuffer.wrap(String.valueOf(0).getBytes())).b();
|
|
|
54 JungleTreeEditor newEditor = createTree(0, new DefaultNodePath(), editor);
|
|
|
55 if (newEditor.success().isA()) {
|
|
|
56 System.out.println("success faild");
|
|
|
57 System.exit(1);
|
|
|
58 }
|
|
|
59 trees[0] = tree;
|
|
|
60 }
|
|
|
61
|
|
|
62 File file = new File("./time/" + args[1] + "JungleTree" + args[0] + "Time");
|
|
182
|
63
|
|
|
64 PrintWriter pw = new PrintWriter(new BufferedWriter(new FileWriter(file)));
|
|
|
65
|
|
|
66 JungleBenchMarkThread readThread[] = null;
|
|
|
67
|
|
|
68 for (int THREAD_COUNT = 1; THREAD_COUNT <= cpuNum; THREAD_COUNT++) {
|
|
|
69 readThread = new JungleBenchMarkThread[THREAD_COUNT];
|
|
183
|
70 JungleTree tree = null;
|
|
182
|
71 if (args[0].equals("read")) {
|
|
|
72 for (int count = 0; THREAD_COUNT > count; count++) {
|
|
183
|
73 if (args[1].equals("separate"))
|
|
|
74 tree = trees[count];
|
|
|
75 else
|
|
|
76 tree = trees[0];
|
|
182
|
77 readThread[count] = new readTreeAttributeThread(tree);
|
|
|
78 }
|
|
|
79 } else if (args[0].equals("find")) {
|
|
|
80 for (int count = 0; THREAD_COUNT > count; count++) {
|
|
183
|
81 if (args[1].equals("separate"))
|
|
|
82 tree = trees[count];
|
|
|
83 else
|
|
|
84 tree = trees[0];
|
|
182
|
85 readThread[count] = new findTreeAttributeThread(tree);
|
|
|
86 }
|
|
|
87 } else {
|
|
|
88 System.out.println("not allow args");
|
|
|
89 System.exit(0);
|
|
|
90 }
|
|
|
91
|
|
|
92 for (int count = 0; THREAD_COUNT > count; count++) {
|
|
|
93 readThread[count].start();
|
|
|
94 }
|
|
|
95
|
|
|
96 System.out.println("StartThread");
|
|
|
97
|
|
|
98 Thread.sleep(1000);
|
|
|
99 long readCount = 0;
|
|
|
100
|
|
|
101 for (int count = 0; THREAD_COUNT > count; count++) {
|
|
|
102 readCount = readCount + readThread[count].getFindCount();
|
|
|
103 readThread[count].set(false);
|
|
183
|
104 readThread[count] = null;
|
|
182
|
105 }
|
|
|
106
|
|
|
107 pw.println(THREAD_COUNT + " " + readCount);
|
|
|
108 System.out.println(THREAD_COUNT + "readCount = " + readCount);
|
|
183
|
109 System.gc();
|
|
|
110 System.out.println("-------------GC--------------");
|
|
|
111 Thread.sleep(1000);
|
|
182
|
112 }
|
|
|
113
|
|
|
114 pw.close();
|
|
|
115 }
|
|
|
116
|
|
183
|
117 static Integer nodeNum = 1;
|
|
|
118
|
|
182
|
119 public static JungleTreeEditor createTree(int deep, NodePath path, JungleTreeEditor editor) {
|
|
|
120
|
|
|
121 Random rnd = new Random();
|
|
|
122 String value1 = String.valueOf(nodeNum);
|
|
183
|
123 nodeNum++;
|
|
182
|
124 String value2 = String.valueOf(nodeNum);
|
|
183
|
125 nodeNum++;
|
|
182
|
126
|
|
|
127 editor = editor.addNewChildAt(path, 0).b();
|
|
|
128 editor = editor.putAttribute(path.add(0), "key", ByteBuffer.wrap(value1.getBytes())).b();
|
|
|
129 editor = editor.addNewChildAt(path, 1).b();
|
|
|
130 editor = editor.putAttribute(path.add(1), "key", ByteBuffer.wrap(value2.getBytes())).b();
|
|
|
131 deep++;
|
|
|
132
|
|
|
133 if (deep < 10) {
|
|
|
134 editor = createTree(deep, path.add(0), editor);
|
|
|
135 editor = createTree(deep, path.add(1), editor);
|
|
|
136 }
|
|
|
137 return editor;
|
|
|
138 }
|
|
|
139 }
|
