4
5
6
90030min. 7
8
9
10
11
12
13
14
15
for (i = 0; i < num_branch; i++) { result = search(argv[1], i, &value[i]); } grpc_call_async for (i = 0; i < num_branch; i++ ) grpc_function_handle_default (&handles[i], ; for (i = 0; i < num_branch; i++) { grpc_call_async(&handles[i], argv[1], i, &value[i]): } grpc_wait_all grpc_wait_all(); 16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37 d d W r W d r d
38
39
40
41
42
43
20021220033 12 December 2003.1 January 2003.2 February 2003.3 March AIST Today 2002.12 Vol.2 No.12 23