-
Notifications
You must be signed in to change notification settings - Fork 0
/
dijkstra_ithaca_gfortran_output.txt
139 lines (106 loc) · 3.63 KB
/
dijkstra_ithaca_gfortran_output.txt
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
2 July 2010 2:11:16.224 PM
DIJKSTRA_OPEN_MP:
FORTRAN77 version
Use Dijkstra's algorithm to determine the minimum
distance from node 1 to each node in a graph,
given the distances between each pair of nodes.
Although a very small example is considered, we
demonstrate the use of OpenMP directives
for parallel execution.
Distance matrix:
0 40 15 *** *** ***
40 0 20 10 25 6
15 20 0 100 *** ***
*** 10 100 0 *** ***
*** 25 *** *** 0 8
*** 6 *** *** 8 0
P 0 : Parallel region begins with 1 threads.
P 0 : First= 1 Last= 6
P 0 : Connecting node 3
P 0 : Connecting node 2
P 0 : Connecting node 6
P 0 : Connecting node 4
P 0 : Connecting node 5
P 0 : Exiting parallel region.
Minimum distances from node 1:
1 0
2 35
3 15
4 45
5 49
6 41
DIJKSTRA_OPEN_MP:
Normal end of execution.
2 July 2010 2:11:16.224 PM
2 July 2010 2:11:16.228 PM
DIJKSTRA_OPEN_MP:
FORTRAN77 version
Use Dijkstra's algorithm to determine the minimum
distance from node 1 to each node in a graph,
given the distances between each pair of nodes.
Although a very small example is considered, we
demonstrate the use of OpenMP directives
for parallel execution.
Distance matrix:
0 40 15 *** *** ***
40 0 20 10 25 6
15 20 0 100 *** ***
*** 10 100 0 *** ***
*** 25 *** *** 0 8
*** 6 *** *** 8 0
P 1 : Parallel region begins with 2 threads.
P 0 : First= 1 Last= 3
P 1 : First= 4 Last= 6
P 1 : Connecting node 3
P 1 : Connecting node 2
P 1 : Connecting node 6
P 1 : Connecting node 4
P 1 : Connecting node 5
P 1 : Exiting parallel region.
Minimum distances from node 1:
1 0
2 35
3 15
4 45
5 49
6 41
DIJKSTRA_OPEN_MP:
Normal end of execution.
2 July 2010 2:11:16.229 PM
2 July 2010 2:11:16.233 PM
DIJKSTRA_OPEN_MP:
FORTRAN77 version
Use Dijkstra's algorithm to determine the minimum
distance from node 1 to each node in a graph,
given the distances between each pair of nodes.
Although a very small example is considered, we
demonstrate the use of OpenMP directives
for parallel execution.
Distance matrix:
0 40 15 *** *** ***
40 0 20 10 25 6
15 20 0 100 *** ***
*** 10 100 0 *** ***
*** 25 *** *** 0 8
*** 6 *** *** 8 0
P 0 : Parallel region begins with 4 threads.
P 0 : First= 1 Last= 1
P 2 : First= 4 Last= 4
P 1 : First= 2 Last= 3
P 3 : First= 5 Last= 6
P 0 : Connecting node 3
P 1 : Connecting node 2
P 0 : Connecting node 6
P 0 : Connecting node 4
P 2 : Connecting node 5
P 1 : Exiting parallel region.
Minimum distances from node 1:
1 0
2 35
3 15
4 45
5 49
6 41
DIJKSTRA_OPEN_MP:
Normal end of execution.
2 July 2010 2:11:16.233 PM