-
Notifications
You must be signed in to change notification settings - Fork 0
/
tea.f90
741 lines (541 loc) · 24 KB
/
tea.f90
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
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
!Crown Copyright 2014 AWE.
!
! This file is part of TeaLeaf.
!
! TeaLeaf is free software: you can redistribute it and/or modify it under
! the terms of the GNU General Public License as published by the
! Free Software Foundation, either version 3 of the License, or (at your option)
! any later version.
!
! TeaLeaf is distributed in the hope that it will be useful, but
! WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
! FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more
! details.
!
! You should have received a copy of the GNU General Public License along with
! TeaLeaf. If not, see http://www.gnu.org/licenses/.
!> @brief Communication Utilities
!> @author David Beckingsale, Wayne Gaudin
!> @details Contains all utilities required to run TeaLeaf in a distributed
!> environment, including initialisation, mesh decompostion, reductions and
!> halo exchange using explicit buffers.
!>
!> Note the halo exchange is currently coded as simply as possible and no
!> optimisations have been implemented, such as post receives before sends or packing
!> buffers with multiple data fields. This is intentional so the effect of these
!> optimisations can be measured on large systems, as and when they are added.
!>
!> Even without these modifications TeaLeaf weak scales well on moderately sized
!> systems of the order of 10K cores.
MODULE tea_module
USE data_module
USE definitions_module
USE pack_module
!USE MPI
IMPLICIT NONE
include "mpif.h"
CONTAINS
SUBROUTINE tea_barrier
INTEGER :: err
CALL MPI_BARRIER(mpi_cart_comm,err)
END SUBROUTINE tea_barrier
SUBROUTINE tea_abort
INTEGER :: ierr,err
CALL MPI_ABORT(mpi_cart_comm,ierr,err)
END SUBROUTINE tea_abort
SUBROUTINE tea_finalize
INTEGER :: err
! IF(use_trilinos_kernels) THEN
! CALL finalise_trilinos()
! ENDIF
CLOSE(g_out)
CALL FLUSH(0)
CALL FLUSH(6)
CALL FLUSH(g_out)
CALL MPI_FINALIZE(err)
END SUBROUTINE tea_finalize
SUBROUTINE tea_init_comms
IMPLICIT NONE
INTEGER :: err,rank,size
INTEGER, dimension(3) :: periodic
! not periodic
data periodic/0, 0, 0/
mpi_dims = 0
rank=0
size=1
CALL MPI_INIT(err)
CALL MPI_COMM_SIZE(mpi_comm_world,size,err)
! Create comm and get coords
CALL MPI_DIMS_CREATE(size, 3, mpi_dims, err)
CALL MPI_CART_CREATE(mpi_comm_world, 3, mpi_dims, periodic, 1, mpi_cart_comm, err)
CALL MPI_COMM_RANK(mpi_cart_comm,rank,err)
CALL MPI_COMM_SIZE(mpi_cart_comm,size,err)
CALL MPI_CART_COORDS(mpi_cart_comm, rank, 3, mpi_coords, err)
parallel%parallel=.TRUE.
parallel%task=rank
IF(rank.EQ.0) THEN
parallel%boss=.TRUE.
ENDIF
parallel%boss_task=0
parallel%max_task=size
END SUBROUTINE tea_init_comms
SUBROUTINE tea_get_num_chunks(count)
IMPLICIT NONE
INTEGER :: count
! Should be changed so there can be more than one chunk per mpi task
count=parallel%max_task
END SUBROUTINE tea_get_num_chunks
SUBROUTINE tea_decompose(x_cells,y_cells,z_cells,left,right,bottom,top,back,front)
! This decomposes the mesh into a number of chunks.
! The number of chunks may be a multiple of the number of mpi tasks
! Picks split with minimal surface area to volume ratio
IMPLICIT NONE
INTEGER :: x_cells,y_cells,z_cells
INTEGER, dimension(1:) :: left,right,top,bottom,back,front
INTEGER :: c,delta_x,delta_y,delta_z
INTEGER :: chunk_x,chunk_y,chunk_z,mod_x,mod_y,mod_z
INTEGER :: err
! 1 chunk
c = 1
! Get destinations/sources
CALL mpi_cart_shift(mpi_cart_comm, 0, 1, &
chunks(c)%chunk_neighbours(chunk_bottom), &
chunks(c)%chunk_neighbours(chunk_top), &
err)
CALL mpi_cart_shift(mpi_cart_comm, 1, 1, &
chunks(c)%chunk_neighbours(chunk_left), &
chunks(c)%chunk_neighbours(chunk_right), &
err)
CALL mpi_cart_shift(mpi_cart_comm, 2, 1, &
chunks(c)%chunk_neighbours(chunk_back), &
chunks(c)%chunk_neighbours(chunk_front), &
err)
WHERE (chunks(c)%chunk_neighbours .EQ. mpi_proc_null)
chunks(c)%chunk_neighbours = external_face
END WHERE
chunk_y = mpi_dims(1)
chunk_x = mpi_dims(2)
chunk_z = mpi_dims(3)
delta_x=x_cells/chunk_x
delta_y=y_cells/chunk_y
delta_z=z_cells/chunk_z
mod_x=MOD(x_cells,chunk_x)
mod_y=MOD(y_cells,chunk_y)
mod_z=MOD(z_cells,chunk_z)
left(c) = mpi_coords(2)*delta_x + 1
if (mpi_coords(2) .le. mod_x) then
left(c) = left(c) + mpi_coords(2)
else
left(c) = left(c) + mod_x
endif
right(c) = left(c)+delta_x - 1
if (mpi_coords(2) .lt. mod_x) then
right(c) = right(c) + 1
endif
bottom(c) = mpi_coords(1)*delta_y + 1
if (mpi_coords(1) .le. mod_y) then
bottom(c) = bottom(c) + mpi_coords(1)
else
bottom(c) = bottom(c) + mod_y
endif
top(c) = bottom(c)+delta_y - 1
if (mpi_coords(1) .lt. mod_y) then
top(c) = top(c) + 1
endif
back(c) = mpi_coords(3)*delta_z + 1
if (mpi_coords(3) .le. mod_z) then
back(c) = back(c) + mpi_coords(3)
else
back(c) = back(c) + mod_z
endif
front(c) = back(c)+delta_z - 1
if (mpi_coords(3) .lt. mod_z) then
front(c) = front(c) + 1
endif
IF(parallel%boss)THEN
WRITE(g_out,*)
WRITE(g_out,*)"Decomposing the mesh into ",chunk_x," by ",chunk_y," by ",chunk_z," chunks"
WRITE(g_out,*)
ENDIF
END SUBROUTINE tea_decompose
SUBROUTINE tea_allocate_buffers(chunk)
IMPLICIT NONE
INTEGER :: chunk
INTEGER :: bt_size, lr_size, fb_size
INTEGER,parameter :: num_buffered=6
INTEGER :: allocate_extra_size
allocate_extra_size = max(2, halo_exchange_depth)
lr_size = num_buffered*(chunks(chunk)%field%y_max &
+ 2*allocate_extra_size)*(chunks(chunk)%field%z_max &
+ 2*allocate_extra_size)*halo_exchange_depth
bt_size = num_buffered*(chunks(chunk)%field%x_max &
+ 2*allocate_extra_size)*(chunks(chunk)%field%z_max &
+ 2*allocate_extra_size)*halo_exchange_depth
fb_size = num_buffered*(chunks(chunk)%field%x_max &
+ 2*allocate_extra_size)*(chunks(chunk)%field%y_max &
+ 2*allocate_extra_size)*halo_exchange_depth
! Unallocated buffers for external boundaries caused issues on some systems so they are now
! all allocated
IF(parallel%task.EQ.chunks(chunk)%task)THEN
!IF(chunks(chunk)%chunk_neighbours(chunk_left).NE.external_face) THEN
ALLOCATE(chunks(chunk)%left_snd_buffer(lr_size))
ALLOCATE(chunks(chunk)%left_rcv_buffer(lr_size))
!ENDIF
!IF(chunks(chunk)%chunk_neighbours(chunk_right).NE.external_face) THEN
ALLOCATE(chunks(chunk)%right_snd_buffer(lr_size))
ALLOCATE(chunks(chunk)%right_rcv_buffer(lr_size))
!ENDIF
!IF(chunks(chunk)%chunk_neighbours(chunk_bottom).NE.external_face) THEN
ALLOCATE(chunks(chunk)%bottom_snd_buffer(bt_size))
ALLOCATE(chunks(chunk)%bottom_rcv_buffer(bt_size))
!ENDIF
!IF(chunks(chunk)%chunk_neighbours(chunk_top).NE.external_face) THEN
ALLOCATE(chunks(chunk)%top_snd_buffer(bt_size))
ALLOCATE(chunks(chunk)%top_rcv_buffer(bt_size))
!ENDIF
!IF(chunks(chunk)%chunk_neighbours(chunk_back).NE.external_face) THEN
ALLOCATE(chunks(chunk)%back_snd_buffer(fb_size))
ALLOCATE(chunks(chunk)%back_rcv_buffer(fb_size))
!ENDIF
!IF(chunks(chunk)%chunk_neighbours(chunk_front).NE.external_face) THEN
ALLOCATE(chunks(chunk)%front_snd_buffer(fb_size))
ALLOCATE(chunks(chunk)%front_rcv_buffer(fb_size))
!ENDIF
ENDIF
chunks(chunk)%left_snd_buffer = 0
chunks(chunk)%right_snd_buffer = 0
chunks(chunk)%bottom_snd_buffer = 0
chunks(chunk)%top_snd_buffer = 0
chunks(chunk)%back_snd_buffer = 0
chunks(chunk)%front_snd_buffer = 0
chunks(chunk)%left_rcv_buffer = 0
chunks(chunk)%right_rcv_buffer = 0
chunks(chunk)%bottom_rcv_buffer = 0
chunks(chunk)%top_rcv_buffer = 0
chunks(chunk)%back_rcv_buffer = 0
chunks(chunk)%front_rcv_buffer = 0
END SUBROUTINE tea_allocate_buffers
SUBROUTINE tea_exchange(fields,depth)
IMPLICIT NONE
INTEGER :: fields(NUM_FIELDS),depth, chunk,err,field
INTEGER,DIMENSION(NUM_FIELDS) :: left_right_offset,bottom_top_offset,back_front_offset
INTEGER :: end_pack_index_left_right, end_pack_index_bottom_top,end_pack_index_back_front
INTEGER :: message_count_lr, message_count_ud, message_count_fb
INTEGER :: exchange_size_lr, exchange_size_ud, exchange_size_fb
INTEGER, dimension(4) :: request_lr, request_ud, request_fb
INTEGER, dimension(MPI_STATUS_SIZE,4) :: status_lr, status_ud, status_fb
LOGICAL :: test_complete
! Assuming 1 patch per task, this will be changed
chunk = 1
IF (ALL(chunks(chunk)%chunk_neighbours .eq. external_face)) return
exchange_size_lr = depth*(chunks(chunk)%field%y_max+2*depth)*(chunks(chunk)%field%z_max+2*depth)
exchange_size_ud = depth*(chunks(chunk)%field%x_max+2*depth)*(chunks(chunk)%field%z_max+2*depth)
exchange_size_fb = depth*(chunks(chunk)%field%x_max+2*depth)*(chunks(chunk)%field%y_max+2*depth)
request_lr = 0
message_count_lr = 0
request_ud = 0
message_count_ud = 0
request_fb = 0
message_count_fb = 0
end_pack_index_left_right=0
end_pack_index_bottom_top=0
end_pack_index_back_front=0
left_right_offset = 0
bottom_top_offset = 0
back_front_offset = 0
DO field=1,NUM_FIELDS
IF(fields(field).EQ.1) THEN
left_right_offset(field)=end_pack_index_left_right
bottom_top_offset(field)=end_pack_index_bottom_top
back_front_offset(field)=end_pack_index_back_front
end_pack_index_left_right=end_pack_index_left_right + exchange_size_lr
end_pack_index_bottom_top=end_pack_index_bottom_top + exchange_size_ud
end_pack_index_back_front=end_pack_index_back_front + exchange_size_fb
ENDIF
ENDDO
IF(chunks(chunk)%chunk_neighbours(chunk_left).NE.external_face) THEN
! do left exchanges
CALL tea_pack_buffers(chunk, fields, depth, CHUNK_LEFT, &
chunks(chunk)%left_snd_buffer, left_right_offset)
!send and recv messagse to the left
CALL tea_send_recv_message_left(chunks(chunk)%left_snd_buffer, &
chunks(chunk)%left_rcv_buffer, &
chunk,end_pack_index_left_right, &
1, 2, &
request_lr(message_count_lr+1), request_lr(message_count_lr+2))
message_count_lr = message_count_lr + 2
ENDIF
IF(chunks(chunk)%chunk_neighbours(chunk_right).NE.external_face) THEN
! do right exchanges
CALL tea_pack_buffers(chunk, fields, depth, CHUNK_RIGHT, &
chunks(chunk)%right_snd_buffer, left_right_offset)
!send message to the right
CALL tea_send_recv_message_right(chunks(chunk)%right_snd_buffer, &
chunks(chunk)%right_rcv_buffer, &
chunk,end_pack_index_left_right, &
2, 1, &
request_lr(message_count_lr+1), request_lr(message_count_lr+2))
message_count_lr = message_count_lr + 2
ENDIF
! IF (depth .eq. 1) THEN
! test_complete = .false.
! ! don't have to transfer now
! CALL MPI_TESTALL(message_count_lr, request_lr, test_complete, status_lr, err)
! ELSE
test_complete = .true.
!make a call to wait / sync
CALL MPI_WAITALL(message_count_lr,request_lr,status_lr,err)
! ENDIF
IF (test_complete .eqv. .true.) THEN
!unpack in left direction
IF(chunks(chunk)%chunk_neighbours(chunk_left).NE.external_face) THEN
CALL tea_unpack_buffers(chunk, fields, depth, CHUNK_LEFT, &
chunks(chunk)%left_rcv_buffer, left_right_offset)
ENDIF
!unpack in right direction
IF(chunks(chunk)%chunk_neighbours(chunk_right).NE.external_face) THEN
CALL tea_unpack_buffers(chunk, fields, depth, CHUNK_RIGHT, &
chunks(chunk)%right_rcv_buffer, left_right_offset)
ENDIF
ENDIF
IF(chunks(chunk)%chunk_neighbours(chunk_bottom).NE.external_face) THEN
! do bottom exchanges
CALL tea_pack_buffers(chunk, fields, depth, CHUNK_BOTTOM, &
chunks(chunk)%bottom_snd_buffer, bottom_top_offset)
!send message downwards
CALL tea_send_recv_message_bottom(chunks(chunk)%bottom_snd_buffer, &
chunks(chunk)%bottom_rcv_buffer, &
chunk,end_pack_index_bottom_top, &
3, 4, &
request_ud(message_count_ud+1), request_ud(message_count_ud+2))
message_count_ud = message_count_ud + 2
ENDIF
IF(chunks(chunk)%chunk_neighbours(chunk_top).NE.external_face) THEN
! do top exchanges
CALL tea_pack_buffers(chunk, fields, depth, CHUNK_TOP, &
chunks(chunk)%top_snd_buffer, bottom_top_offset)
!send message upwards
CALL tea_send_recv_message_top(chunks(chunk)%top_snd_buffer, &
chunks(chunk)%top_rcv_buffer, &
chunk,end_pack_index_bottom_top, &
4, 3, &
request_ud(message_count_ud+1), request_ud(message_count_ud+2))
message_count_ud = message_count_ud + 2
ENDIF
!need to make a call to wait / sync
CALL MPI_WAITALL(message_count_ud,request_ud,status_ud,err)
!unpack in top direction
IF( chunks(chunk)%chunk_neighbours(chunk_top).NE.external_face ) THEN
CALL tea_unpack_buffers(chunk, fields, depth, CHUNK_TOP, &
chunks(chunk)%top_rcv_buffer, bottom_top_offset)
ENDIF
!unpack in bottom direction
IF(chunks(chunk)%chunk_neighbours(chunk_bottom).NE.external_face) THEN
CALL tea_unpack_buffers(chunk, fields, depth, CHUNK_BOTTOM, &
chunks(chunk)%bottom_rcv_buffer, bottom_top_offset)
ENDIF
IF(chunks(chunk)%chunk_neighbours(chunk_back).NE.external_face) THEN
! do back exchanges
CALL tea_pack_buffers(chunk, fields, depth, CHUNK_BACK, &
chunks(chunk)%back_snd_buffer, back_front_offset)
!send message downwards
CALL tea_send_recv_message_back(chunks(chunk)%back_snd_buffer, &
chunks(chunk)%back_rcv_buffer, &
chunk,end_pack_index_back_front, &
5, 6, &
request_fb(message_count_fb+1), request_fb(message_count_fb+2))
message_count_fb = message_count_fb + 2
ENDIF
IF(chunks(chunk)%chunk_neighbours(chunk_front).NE.external_face) THEN
! do front exchanges
CALL tea_pack_buffers(chunk, fields, depth, CHUNK_FRONT, &
chunks(chunk)%front_snd_buffer, back_front_offset)
!send message upwards
CALL tea_send_recv_message_front(chunks(chunk)%front_snd_buffer, &
chunks(chunk)%front_rcv_buffer, &
chunk,end_pack_index_back_front, &
6, 5, &
request_fb(message_count_fb+1), request_fb(message_count_fb+2))
message_count_fb = message_count_fb + 2
ENDIF
!need to make a call to wait / sync
CALL MPI_WAITALL(message_count_fb,request_fb,status_fb,err)
!unpack in front direction
IF( chunks(chunk)%chunk_neighbours(chunk_front).NE.external_face ) THEN
CALL tea_unpack_buffers(chunk, fields, depth, CHUNK_FRONT, &
chunks(chunk)%front_rcv_buffer, back_front_offset)
ENDIF
!unpack in back direction
IF(chunks(chunk)%chunk_neighbours(chunk_back).NE.external_face) THEN
CALL tea_unpack_buffers(chunk, fields, depth, CHUNK_BACK, &
chunks(chunk)%back_rcv_buffer, back_front_offset)
ENDIF
END SUBROUTINE tea_exchange
SUBROUTINE tea_send_recv_message_left(left_snd_buffer, left_rcv_buffer, &
chunk, total_size, &
tag_send, tag_recv, &
req_send, req_recv)
REAL(KIND=8) :: left_snd_buffer(:), left_rcv_buffer(:)
INTEGER :: left_task
INTEGER :: chunk
INTEGER :: total_size, tag_send, tag_recv, err
INTEGER :: req_send, req_recv
left_task =chunks(chunk)%chunk_neighbours(chunk_left)
CALL MPI_ISEND(left_snd_buffer,total_size,MPI_DOUBLE_PRECISION,left_task,tag_send &
,mpi_cart_comm,req_send,err)
CALL MPI_IRECV(left_rcv_buffer,total_size,MPI_DOUBLE_PRECISION,left_task,tag_recv &
,mpi_cart_comm,req_recv,err)
END SUBROUTINE tea_send_recv_message_left
SUBROUTINE tea_send_recv_message_right(right_snd_buffer, right_rcv_buffer, &
chunk, total_size, &
tag_send, tag_recv, &
req_send, req_recv)
IMPLICIT NONE
REAL(KIND=8) :: right_snd_buffer(:), right_rcv_buffer(:)
INTEGER :: right_task
INTEGER :: chunk
INTEGER :: total_size, tag_send, tag_recv, err
INTEGER :: req_send, req_recv
right_task=chunks(chunk)%chunk_neighbours(chunk_right)
CALL MPI_ISEND(right_snd_buffer,total_size,MPI_DOUBLE_PRECISION,right_task,tag_send, &
mpi_cart_comm,req_send,err)
CALL MPI_IRECV(right_rcv_buffer,total_size,MPI_DOUBLE_PRECISION,right_task,tag_recv, &
mpi_cart_comm,req_recv,err)
END SUBROUTINE tea_send_recv_message_right
SUBROUTINE tea_send_recv_message_top(top_snd_buffer, top_rcv_buffer, &
chunk, total_size, &
tag_send, tag_recv, &
req_send, req_recv)
IMPLICIT NONE
REAL(KIND=8) :: top_snd_buffer(:), top_rcv_buffer(:)
INTEGER :: top_task
INTEGER :: chunk
INTEGER :: total_size, tag_send, tag_recv, err
INTEGER :: req_send, req_recv
top_task=chunks(chunk)%chunk_neighbours(chunk_top)
CALL MPI_ISEND(top_snd_buffer,total_size,MPI_DOUBLE_PRECISION,top_task,tag_send, &
mpi_cart_comm,req_send,err)
CALL MPI_IRECV(top_rcv_buffer,total_size,MPI_DOUBLE_PRECISION,top_task,tag_recv, &
mpi_cart_comm,req_recv,err)
END SUBROUTINE tea_send_recv_message_top
SUBROUTINE tea_send_recv_message_bottom(bottom_snd_buffer, bottom_rcv_buffer, &
chunk, total_size, &
tag_send, tag_recv, &
req_send, req_recv)
IMPLICIT NONE
REAL(KIND=8) :: bottom_snd_buffer(:), bottom_rcv_buffer(:)
INTEGER :: bottom_task
INTEGER :: chunk
INTEGER :: total_size, tag_send, tag_recv, err
INTEGER :: req_send, req_recv
bottom_task=chunks(chunk)%chunk_neighbours(chunk_bottom)
CALL MPI_ISEND(bottom_snd_buffer,total_size,MPI_DOUBLE_PRECISION,bottom_task,tag_send &
,mpi_cart_comm,req_send,err)
CALL MPI_IRECV(bottom_rcv_buffer,total_size,MPI_DOUBLE_PRECISION,bottom_task,tag_recv &
,mpi_cart_comm,req_recv,err)
END SUBROUTINE tea_send_recv_message_bottom
SUBROUTINE tea_send_recv_message_back(back_snd_buffer, back_rcv_buffer, &
chunk, total_size, &
tag_send, tag_recv, &
req_send, req_recv)
IMPLICIT NONE
REAL(KIND=8) :: back_snd_buffer(:), back_rcv_buffer(:)
INTEGER :: back_task
INTEGER :: chunk
INTEGER :: total_size, tag_send, tag_recv, err
INTEGER :: req_send, req_recv
back_task=chunks(chunk)%chunk_neighbours(chunk_back)
CALL MPI_ISEND(back_snd_buffer,total_size,MPI_DOUBLE_PRECISION,back_task,tag_send, &
mpi_cart_comm,req_send,err)
CALL MPI_IRECV(back_rcv_buffer,total_size,MPI_DOUBLE_PRECISION,back_task,tag_recv, &
mpi_cart_comm,req_recv,err)
END SUBROUTINE tea_send_recv_message_back
SUBROUTINE tea_send_recv_message_front(front_snd_buffer, front_rcv_buffer, &
chunk, total_size, &
tag_send, tag_recv, &
req_send, req_recv)
IMPLICIT NONE
REAL(KIND=8) :: front_snd_buffer(:), front_rcv_buffer(:)
INTEGER :: front_task
INTEGER :: chunk
INTEGER :: total_size, tag_send, tag_recv, err
INTEGER :: req_send, req_recv
front_task=chunks(chunk)%chunk_neighbours(chunk_front)
CALL MPI_ISEND(front_snd_buffer,total_size,MPI_DOUBLE_PRECISION,front_task,tag_send &
,mpi_cart_comm,req_send,err)
CALL MPI_IRECV(front_rcv_buffer,total_size,MPI_DOUBLE_PRECISION,front_task,tag_recv &
,mpi_cart_comm,req_recv,err)
END SUBROUTINE tea_send_recv_message_front
SUBROUTINE tea_sum(value)
! Only sums to the master
IMPLICIT NONE
REAL(KIND=8) :: value
REAL(KIND=8) :: total
INTEGER :: err
total=value
CALL MPI_REDUCE(value,total,1,MPI_DOUBLE_PRECISION,MPI_SUM,0,mpi_cart_comm,err)
value=total
END SUBROUTINE tea_sum
SUBROUTINE tea_allsum2(value1, value2)
! Global reduction for PCG solver
IMPLICIT NONE
REAL(KIND=8) :: value1, value2
REAL(KIND=8), DIMENSION(2) :: values, total
REAL(KIND=8) :: dot_product_time, timer
INTEGER :: err
values = (/ value1, value2 /)
total=values
!IF (profiler_on) dot_product_time=timer()
CALL MPI_ALLREDUCE(values,total,2,MPI_DOUBLE_PRECISION,MPI_SUM,mpi_cart_comm,err)
!IF (profiler_on) profiler%dot_product= profiler%dot_product+ (timer() - dot_product_time)
value1=total(1)
value2=total(2)
END SUBROUTINE tea_allsum2
SUBROUTINE tea_allsum(value)
! Global reduction for CG solver
IMPLICIT NONE
REAL(KIND=8) :: value
REAL(KIND=8) :: total
INTEGER :: err
total=value
!IF (profiler_on) dot_product_time=timer()
CALL MPI_ALLREDUCE(value,total,1,MPI_DOUBLE_PRECISION,MPI_SUM,mpi_cart_comm,err)
!IF (profiler_on) profiler%dot_product= profiler%dot_product+ (timer() - dot_product_time)
value=total
END SUBROUTINE tea_allsum
SUBROUTINE tea_min(value)
IMPLICIT NONE
REAL(KIND=8) :: value
REAL(KIND=8) :: minimum
INTEGER :: err
minimum=value
CALL MPI_ALLREDUCE(value,minimum,1,MPI_DOUBLE_PRECISION,MPI_MIN,mpi_cart_comm,err)
value=minimum
END SUBROUTINE tea_min
SUBROUTINE tea_max(value)
IMPLICIT NONE
REAL(KIND=8) :: value
REAL(KIND=8) :: maximum
INTEGER :: err
maximum=value
CALL MPI_ALLREDUCE(value,maximum,1,MPI_DOUBLE_PRECISION,MPI_MAX,mpi_cart_comm,err)
value=maximum
END SUBROUTINE tea_max
SUBROUTINE tea_allgather(value,values)
IMPLICIT NONE
REAL(KIND=8) :: value
REAL(KIND=8) :: values(parallel%max_task)
INTEGER :: err
values(1)=value ! Just to ensure it will work in serial
CALL MPI_ALLGATHER(value,1,MPI_DOUBLE_PRECISION,values,1,MPI_DOUBLE_PRECISION,mpi_cart_comm,err)
END SUBROUTINE tea_allgather
SUBROUTINE tea_check_error(error)
IMPLICIT NONE
INTEGER :: error
INTEGER :: maximum
INTEGER :: err
maximum=error
CALL MPI_ALLREDUCE(error,maximum,1,MPI_INTEGER,MPI_MAX,mpi_cart_comm,err)
error=maximum
END SUBROUTINE tea_check_error
END MODULE tea_module