-
Notifications
You must be signed in to change notification settings - Fork 0
/
CalcStats_mgpu.cu
2484 lines (1985 loc) · 84.8 KB
/
CalcStats_mgpu.cu
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
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
// includes, system
#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <complex.h>
// includes, project
#include <cuda_runtime.h>
#include <device_launch_parameters.h>
#include <cufft.h>
#include <cuComplex.h>
#include <helper_functions.h>
#include <helper_cuda.h>
#include <timer.h>
// include parameters for DNS
#include "DNS_PARAMETERS.h"
#define size_Stats (nt/n_save + 1)
#define nu ( 1.0/((double)Re) )
#define RAD 1
int divUp(int a, int b) { return (a + b - 1) / b; }
__device__
int idxClip(int idx, int idxMax){
return idx > (idxMax - 1) ? (idxMax - 1) : (idx < 0 ? 0 : idx);
}
__device__
int flatten(int col, int row, int stack, int width, int height, int depth){
return idxClip(stack, depth) + idxClip(row, height)*depth + idxClip(col, width)*depth*height;
// Note: using column-major indexing format
}
void displayDeviceProps(int numGPUs){
int i, driverVersion = 0, runtimeVersion = 0;
for( i = 0; i<numGPUs; ++i)
{
cudaSetDevice(i);
cudaDeviceProp deviceProp;
cudaGetDeviceProperties(&deviceProp, i);
printf(" Device name: %s\n", deviceProp.name);
cudaDriverGetVersion(&driverVersion);
cudaRuntimeGetVersion(&runtimeVersion);
printf(" CUDA Driver Version / Runtime Version %d.%d / %d.%d\n", driverVersion/1000, (driverVersion%100)/10, runtimeVersion/1000, (runtimeVersion%100)/10);
printf(" CUDA Capability Major/Minor version number: %d.%d\n", deviceProp.major, deviceProp.minor);
char msg[256];
SPRINTF(msg, " Total amount of global memory: %.0f MBytes \n",
(float)deviceProp.totalGlobalMem/1048576.0f);
printf("%s", msg);
printf(" (%2d) Multiprocessors, (%3d) CUDA Cores/MP: %d CUDA Cores\n",
deviceProp.multiProcessorCount,
_ConvertSMVer2Cores(deviceProp.major, deviceProp.minor),
_ConvertSMVer2Cores(deviceProp.major, deviceProp.minor) * deviceProp.multiProcessorCount);
printf("\n");
}
return;
}
void writeDouble(double v, FILE *f) {
fwrite((void*)(&v), sizeof(v), 1, f);
return;
}
void writeStats( const char* name, double *in, double val ) {
int i;
char title[0x100];
// snprintf(title, sizeof(title), SaveLocation, (int) NX, (int) Re, name, val);
snprintf(title, sizeof(title), SaveLocation, name, val);
printf("Writing data to %s \n", title);
FILE *out = fopen(title, "wb");
for (i = 0; i <= size_Stats; ++i){
writeDouble(in[i], out);
}
fclose(out);
}
double readDouble(FILE *f){
double v;
int flag = fread((void*)(&v), sizeof(double), 1, f);
if(flag == 1)
return v;
else{
return 0;
}
}
void loadData(int nGPUs, int *start_x, int *NX_per_GPU, const int iter, const char *name, double **var)
{ // Function to read in velocity data into multiple GPUs
int i, j, k, n, idx, N;
char title[0x100];
snprintf(title, sizeof(title), DataLocation, name, iter);
printf("Reading data from %s \n", title);
FILE *file = fopen(title, "rb");
N = readDouble(file)/sizeof(double);
printf("The size of N is %d\n",N);
for (n = 0; n < nGPUs; ++n){
printf("Reading data for GPU %d\n",n);
for (i = 0; i < NX_per_GPU[n]; ++i){
for (j = 0; j < NY; ++j){
for (k = 0; k < NZ; ++k){
idx = k + 2*NZ2*j + 2*NZ2*NY*i;
var[n][idx] = readDouble(file);
}
}
}
}
fclose(file);
return;
}
void splitData(int numGPUs, int size, int *size_per_GPU, int *start_idx) {
int i, n;
if(size % numGPUs == 0){
for (i=0;i<numGPUs;++i){
size_per_GPU[i] = size/numGPUs;
start_idx[i] = i*size_per_GPU[i];
}
}
else {
printf("Warning: number of GPUs is not an even multiple of the data size\n");
n = size/numGPUs;
for(i=0; i<(numGPUs-1); ++i){
size_per_GPU[i] = n;
start_idx[i] = i*size_per_GPU[i];
}
size_per_GPU[numGPUs-1] = n + size % numGPUs;
start_idx[numGPUs-1] = (numGPUs-1)*size_per_GPU[numGPUs-2];
}
}
void importFields_mgpu(int nGPUs, int *start_x, int *NX_per_GPU, const int iter, double **h_u, double **h_v, double **h_w, double **h_z, cufftDoubleReal **u, cufftDoubleReal **v, cufftDoubleReal **w, cufftDoubleReal **z)
{ // Import data from file
int n;
// Import data from file to CPU memory
loadData(nGPUs, start_x, NX_per_GPU, iter, "u", h_u);
loadData(nGPUs, start_x, NX_per_GPU, iter, "v", h_v);
loadData(nGPUs, start_x, NX_per_GPU, iter, "w", h_w);
loadData(nGPUs, start_x, NX_per_GPU, iter, "z", h_z);
// Copy data from host to device (from CPU memory distributed across GPU memory)
printf("Copy results to GPU memory...\n");
for(n=0; n<nGPUs; ++n){
cudaSetDevice(n);
cudaDeviceSynchronize();
checkCudaErrors( cudaMemcpyAsync(u[n], h_u[n], sizeof(complex double)*NX_per_GPU[n]*NY*NZ2, cudaMemcpyDefault) );
checkCudaErrors( cudaMemcpyAsync(v[n], h_v[n], sizeof(complex double)*NX_per_GPU[n]*NY*NZ2, cudaMemcpyDefault) );
checkCudaErrors( cudaMemcpyAsync(w[n], h_w[n], sizeof(complex double)*NX_per_GPU[n]*NY*NZ2, cudaMemcpyDefault) );
checkCudaErrors( cudaMemcpyAsync(z[n], h_z[n], sizeof(complex double)*NX_per_GPU[n]*NY*NZ2, cudaMemcpyDefault) );
}
}
void importF(const int iter, const char *name, double *var)
{ // Function to read in velocity data
int i;
double N;
// Read in data
char title[0x100];
// snprintf(title, sizeof(title), Datalocation, (int) NX, (int) Re, name, iter); // Concatenate filepath and filename
snprintf(title, sizeof(title), DataLocation, name, iter);
printf("Reading data from %s \n", title);
FILE *file = fopen(title, "rb"); // Open file for reading binary data
N = readDouble(file)/sizeof(double); // number of double elements in the file
printf("The size of N is %d\n", (int)N);
for (i = 0; i < (int)N; ++i){
var[i] = readDouble(file); // read in each data point in series
}
fclose(file);
return;
}
__global__
void waveNumber_kernel(double *waveNum)
{ // Creates the wavenumber vectors used in Fourier space
const int i = blockIdx.x * blockDim.x + threadIdx.x;
if (i >= NX) return;
if (i < NX/2)
waveNum[i] = (double)i;
else
waveNum[i] = (double)i - NX;
return;
}
void initializeWaveNumbers(int nGPUs, double **waveNum)
{ // Initialize wavenumbers in Fourier space
int n;
for (n = 0; n<nGPUs; ++n){
cudaSetDevice(n);
waveNumber_kernel<<<divUp(NX,TX), TX>>>(waveNum[n]);
}
printf("Wave domain setup complete..\n");
return;
}
void plan2dFFT(int nGPUs, int *NX_per_GPU, size_t *worksize_f, size_t *worksize_i, cufftDoubleComplex **workspace, cufftHandle *plan, cufftHandle *invplan){
// This function plans a 2-dimensional FFT to operate on the X and Y directions (assumes X-direction is contiguous in memory)
int result;
int n;
for(n = 0; n<nGPUs; ++n){
cudaSetDevice(n);
//Create plan for 2-D cuFFT, set cuFFT parameters
int rank = 2;
int size[] = {NY,NZ};
int inembed[] = {NY,2*NZ2}; // inembed measures distance between dimensions of data
int onembed[] = {NY,NZ2}; // Uses half the domain for a R2C transform
int istride = 1; // istride is distance between consecutive elements
int ostride = 1;
int idist = NY*2*NZ2; // idist is the total length of one signal
int odist = NY*NZ2;
int batch = NX_per_GPU[n]; // # of 2D FFTs to perform
// Create empty plan handles
cufftCreate(&plan[n]);
cufftCreate(&invplan[n]);
// Disable auto allocation of workspace memory for cuFFT plans
result = cufftSetAutoAllocation(plan[n], 0);
if ( result != CUFFT_SUCCESS){
printf("CUFFT error: cufftSetAutoAllocation failed on line %d, Error code %d\n", __LINE__, result);
return; }
result = cufftSetAutoAllocation(invplan[n], 0);
if ( result != CUFFT_SUCCESS){
printf("CUFFT error: cufftSetAutoAllocation failed on line %d, Error code %d\n", __LINE__, result);
return; }
// Plan Forward 2DFFT
result = cufftMakePlanMany(plan[n], rank, size, inembed, istride, idist, onembed, ostride, odist, CUFFT_D2Z, batch, &worksize_f[n]);
if ( result != CUFFT_SUCCESS){
fprintf(stderr, "CUFFT error: cufftPlanforward 2D failed");
printf(", Error code %d\n", result);
return;
}
// Plan inverse 2DFFT
result = cufftMakePlanMany(invplan[n], rank, size, onembed, ostride, odist, inembed, istride, idist, CUFFT_Z2D, batch, &worksize_i[n]);
if ( result != CUFFT_SUCCESS){
fprintf(stderr, "CUFFT error: cufftPlanforward 2D failed");
printf(", Error code %d\n", result);
return;
}
printf("The workspace size required for the forward transform is %lu.\n", worksize_f[n]);
printf("The workspace size required for the inverse transform is %lu.\n", worksize_i[n]);
// Assuming that both workspaces are the same size (seems to be generally true), then the two workspaces can share an allocation
// Allocate workspace memory
checkCudaErrors( cudaMalloc(&workspace[n], worksize_f[n]) );
// Set cuFFT to use allocated workspace memory
result = cufftSetWorkArea(plan[n], workspace[n]);
if ( result != CUFFT_SUCCESS){
printf("CUFFT error: ExecD2Z failed on line %d, Error code %d\n", __LINE__, result);
return; }
result = cufftSetWorkArea(invplan[n], workspace[n]);
if ( result != CUFFT_SUCCESS){
printf("CUFFT error: ExecD2Z failed on line %d, Error code %d\n", __LINE__, result);
return; }
}
return;
}
void plan1dFFT(int nGPUs, cufftHandle *plan){
// This function plans a 1-dimensional FFT to operate on the Z direction (assuming Z-direction is contiguous in memory)
int result;
int n;
for(n = 0; n<nGPUs; ++n){
cudaSetDevice(n);
//Create plan for cuFFT, set cuFFT parameters
int rank = 1; // Dimensionality of the FFT - constant at rank 1
int size[] = {NX}; // size of each rank
int inembed[] = {0}; // inembed measures distance between dimensions of data
int onembed[] = {0}; // For complex to complex transform, input and output data have same dimensions
int istride = NZ2; // istride is distance between consecutive elements
int ostride = NZ2;
int idist = 1; // idist is the total length of one signal
int odist = 1;
int batch = NZ2; // # of 1D FFTs to perform (assuming data has been transformed previously in the Z-Y directions)
// Plan Forward 1DFFT
result = cufftPlanMany(&plan[n], rank, size, inembed, istride, idist, onembed, ostride, odist, CUFFT_Z2Z, batch);
if ( result != CUFFT_SUCCESS){
fprintf(stderr, "CUFFT error: cufftPlanforward failed");
return;
}
}
return;
}
__global__
void scaleKernel_mgpu(int start_x, cufftDoubleReal *f)
{
const int i = blockIdx.x * blockDim.x + threadIdx.x;
const int j = blockIdx.y * blockDim.y + threadIdx.y;
const int k = blockIdx.z * blockDim.z + threadIdx.z;
if (( (i + start_x) >= NX) || (j >= NY) || (k >= NZ)) return;
const int idx = flatten( i, j, k, NX, NY, 2*NZ2);
f[idx] = f[idx] / ( (double)NX*NY*NZ );
return;
}
__global__
void organizeData(cufftDoubleComplex *in, cufftDoubleComplex *out, int N, int j)
{// Function to grab non-contiguous chunks of data and make them contiguous
const int k = blockIdx.x * blockDim.x + threadIdx.x;
if(k >= NZ2) return;
for(int i=0; i<N; ++i){
// printf("For thread %d, indexing begins at local index of %d, which maps to temp at location %d\n", k, (k+ NZ*j), k);
out[k + i*NZ2] = in[k + NZ2*j + i*NY*NZ2];
}
return;
}
void transpose_xy_mgpu(cufftDoubleComplex **src, cufftDoubleComplex **dst, cufftDoubleComplex **temp, int nGPUs)
{ // Transpose x and y directions (for a z-contiguous 1d array distributed across multiple GPUs)
// This function loops through GPUs (instead of looping through all x,y) to do the transpose. Requires extra conversion to calculate the local index at the source location.
// printf("Taking Transpose...\n");
int n, j, local_idx_dst, dstNum;
for(j=0; j<NY; ++j){
for(n=0; n<nGPUs; ++n){
cudaSetDevice(n);
dstNum = j*nGPUs/NY;
// Open kernel that grabs all data
organizeData<<<divUp(NZ2,TX), TX>>>(src[n], temp[n], NX/nGPUs, j);
local_idx_dst = n*NX/nGPUs*NZ2 + (j - dstNum*NY/nGPUs)*NZ2*NX;
checkCudaErrors( cudaMemcpyAsync(&dst[dstNum][local_idx_dst], temp[n], sizeof(cufftDoubleComplex)*NZ2*NX/nGPUs, cudaMemcpyDeviceToDevice) );
}
}
return;
}
void Execute1DFFT_Forward(cufftHandle plan, int NY_per_GPU, cufftDoubleComplex *f, cufftDoubleComplex *fhat)
{
cufftResult result;
// Loop through each slab in the Y-direction
// Perform forward FFT
for(int i=0; i<NY_per_GPU; ++i){
result = cufftExecZ2Z(plan, &f[i*NZ2*NX], &fhat[i*NZ2*NX], CUFFT_FORWARD);
if ( result != CUFFT_SUCCESS){
fprintf(stderr, "CUFFT error: ExecZ2Z failed, error code %d\n",(int)result);
return;
}
}
return;
}
void Execute1DFFT_Inverse(cufftHandle plan, int NY_per_GPU, cufftDoubleComplex *fhat, cufftDoubleComplex *f)
{
cufftResult result;
// Loop through each slab in the Y-direction
// Perform forward FFT
for(int i=0; i<NY_per_GPU; ++i){
result = cufftExecZ2Z(plan, &fhat[i*NZ2*NX], &f[i*NZ2*NX], CUFFT_INVERSE);
if ( result != CUFFT_SUCCESS){
fprintf(stderr, "CUFFT error: ExecZ2Z failed, error code %d\n",(int)result);
return;
}
}
return;
}
void forwardTransform(cufftHandle *p_1d, cufftHandle *p_2d, int nGPUs, int *NX_per_GPU, int *start_x, int *NY_per_GPU, int *start_y, cufftDoubleComplex **f_t, cufftDoubleComplex **temp, cufftDoubleReal **f )
{ // Transform from physical to wave domain
int RESULT, n;
// Take FFT in Z and Y directions
for(n = 0; n<nGPUs; ++n){
cudaSetDevice(n);
RESULT = cufftExecD2Z(p_2d[n], f[n], (cufftDoubleComplex *)f[n]);
if ( RESULT != CUFFT_SUCCESS){
printf("CUFFT error: ExecD2Z failed on line %d, Error code %d\n", __LINE__, RESULT);
return; }
// printf("Taking 2D forward FFT on GPU #%2d\n",n);
}
// Transpose X and Y dimensions
transpose_xy_mgpu((cufftDoubleComplex **)f, f_t, temp, nGPUs);
// Take FFT in X direction (which has been transposed to what used to be the Y dimension)
for(n = 0; n<nGPUs; ++n){
cudaSetDevice(n);
Execute1DFFT_Forward(p_1d[n], NY_per_GPU[n], f_t[n], (cufftDoubleComplex *)f[n]);
// printf("Taking 1D forward FFT on GPU #%2d\n",n);
}
// Results remain in transposed coordinates
// printf("Forward Transform Completed...\n");
return;
}
void inverseTransform(cufftHandle *invp_1d, cufftHandle *invp_2d, int nGPUs, int *NX_per_GPU, int *start_x, int *NY_per_GPU, int *start_y, cufftDoubleComplex **f_t, cufftDoubleComplex **temp, cufftDoubleComplex **f)
{ // Transform variables from wavespace to the physical domain
int RESULT, n;
// Data starts in transposed coordinates, x,y flipped
// Take FFT in X direction (which has been transposed to what used to be the Y dimension)
for(n = 0; n<nGPUs; ++n){
cudaSetDevice(n);
Execute1DFFT_Inverse(invp_1d[n], NY_per_GPU[n], f[n], f_t[n]);
// printf("Taking 1D inverse FFT on GPU #%2d\n",n);
}
// Transpose X and Y directions
transpose_xy_mgpu(f_t, f, temp, nGPUs);
for(n = 0; n<nGPUs; ++n){
cudaSetDevice(n);
// Take inverse FFT in Z and Y direction
RESULT = cufftExecZ2D(invp_2d[n], f[n], (cufftDoubleReal *)f[n]);
if ( RESULT != CUFFT_SUCCESS){
printf("CUFFT error: ExecD2Z failed on line %d, Error code %d\n", __LINE__, RESULT);
return; }
// printf("Taking 2D inverse FFT on GPU #%2d\n",n);
}
for(n = 0; n<nGPUs; ++n){
cudaSetDevice(n);
const dim3 blockSize(TX, TY, TZ);
const dim3 gridSize(divUp(NX_per_GPU[n], TX), divUp(NY, TY), divUp(NZ, TZ));
scaleKernel_mgpu<<<gridSize, blockSize>>>(start_x[n], (cufftDoubleReal *)f[n]);
}
// printf("Scaled Inverse Transform Completed...\n");
return;
}
/*
__global__
void surfaceIntegral_kernel(double *F, int w, int h, int d, double ref, double *Q, double *surfInt_Q) {
extern __shared__ double s_F[];
double dFdx, dFdy, dFdz, dChidx, dChidy, dChidz;
// global indices
const int i = blockIdx.x * blockDim.x + threadIdx.x; // column
const int j = blockIdx.y * blockDim.y + threadIdx.y; // row
const int k = blockIdx.z * blockDim.z + threadIdx.z; // stack
if ((i >= w) || (j >= h) || (k >= d)) return;
const int idx = flatten(i, j, k, w, h, d);
// local width and height
const int s_w = blockDim.x + 2 * RAD;
const int s_h = blockDim.y + 2 * RAD;
const int s_d = blockDim.z + 2 * RAD;
// local indices
const int s_i = threadIdx.x + RAD;
const int s_j = threadIdx.y + RAD;
const int s_k = threadIdx.z + RAD;
const int s_idx = flatten(s_i, s_j, s_k, s_w, s_h, s_d);
// Creating arrays in shared memory
// Regular cells
s_F[s_idx] = F[idx];
//Halo Cells
if (threadIdx.x < RAD) {
s_F[flatten(s_i - RAD, s_j, s_k, s_w, s_h, s_d)] =
F[flatten(i - RAD, j, k, w, h, d)];
s_F[flatten(s_i + blockDim.x, s_j, s_k, s_w, s_h, s_d)] =
F[flatten(i + blockDim.x, j, k, w, h, d)];
}
if (threadIdx.y < RAD) {
s_F[flatten(s_i, s_j - RAD, s_k, s_w, s_h, s_d)] =
F[flatten(i, j - RAD, k, w, h, d)];
s_F[flatten(s_i, s_j + blockDim.y, s_k, s_w, s_h, s_d)] =
F[flatten(i, j + blockDim.y, k, w, h, d)];
}
if (threadIdx.z < RAD) {
s_F[flatten(s_i, s_j, s_k - RAD, s_w, s_h, s_d)] =
F[flatten(i, j, k - RAD, w, h, d)];
s_F[flatten(s_i, s_j, s_k + blockDim.z, s_w, s_h, s_d)] =
F[flatten(i, j, k + blockDim.z, w, h, d)];
}
__syncthreads();
// Boundary Conditions
// Making problem boundaries periodic
if (i == 0){
s_F[flatten(s_i - 1, s_j, s_k, s_w, s_h, s_d)] =
F[flatten(w, j, k, w, h, d)];
}
if (i == w - 1){
s_F[flatten(s_i + 1, s_j, s_k, s_w, s_h, s_d)] =
F[flatten(0, j, k, w, h, d)];
}
if (j == 0){
s_F[flatten(s_i, s_j - 1, s_k, s_w, s_h, s_d)] =
F[flatten(i, h, k, w, h, d)];
}
if (j == h - 1){
s_F[flatten(s_i, s_j + 1, s_k, s_w, s_h, s_d)] =
F[flatten(i, 0, k, w, h, d)];
}
if (k == 0){
s_F[flatten(s_i, s_j, s_k - 1, s_w, s_h, s_d)] =
F[flatten(i, j, d, w, h, d)];
}
if (k == d - 1){
s_F[flatten(s_i, s_j, s_k + 1, s_w, s_h, s_d)] =
F[flatten(i, j, 0, w, h, d)];
}
// __syncthreads();
// Calculating dFdx and dFdy
// Take derivatives
dFdx = ( s_F[flatten(s_i + 1, s_j, s_k, s_w, s_h, s_d)] -
s_F[flatten(s_i - 1, s_j, s_k, s_w, s_h, s_d)] ) / (2.0*dx);
dFdy = ( s_F[flatten(s_i, s_j + 1, s_k, s_w, s_h, s_d)] -
s_F[flatten(s_i, s_j - 1, s_k, s_w, s_h, s_d)] ) / (2.0*dx);
dFdz = ( s_F[flatten(s_i, s_j, s_k + 1, s_w, s_h, s_d)] -
s_F[flatten(s_i, s_j, s_k - 1, s_w, s_h, s_d)] ) / (2.0*dx);
__syncthreads();
// Test to see if z is <= Zst, which sets the value of Chi
s_F[s_idx] = (s_F[s_idx] <= ref);
// Test Halo Cells to form Chi
if (threadIdx.x < RAD) {
s_F[flatten(s_i - RAD, s_j, s_k, s_w, s_h, s_d)] = (s_F[flatten(s_i - RAD, s_j, s_k, s_w, s_h, s_d)] <= ref);
s_F[flatten(s_i + blockDim.x, s_j, s_k, s_w, s_h, s_d)] = (s_F[flatten(s_i + blockDim.x, s_j, s_k, s_w, s_h, s_d)] <= ref);
}
if (threadIdx.y < RAD) {
s_F[flatten(s_i, s_j - RAD, s_k, s_w, s_h, s_d)] = (s_F[flatten(s_i, s_j - RAD, s_k, s_w, s_h, s_d)] <= ref);
s_F[flatten(s_i, s_j + blockDim.y, s_k, s_w, s_h, s_d)] = (s_F[flatten(s_i, s_j + blockDim.y, s_k, s_w, s_h, s_d)] <= ref);
}
if (threadIdx.z < RAD) {
s_F[flatten(s_i, s_j, s_k - RAD, s_w, s_h, s_d)] = (s_F[flatten(s_i, s_j, s_k - RAD, s_w, s_h, s_d)] <= ref);
s_F[flatten(s_i, s_j, s_k + blockDim.z, s_w, s_h, s_d)] = (s_F[flatten(s_i, s_j, s_k + blockDim.z, s_w, s_h, s_d)] <= ref);
}
__syncthreads();
// Take derivatives
dChidx = ( s_F[flatten(s_i + 1, s_j, s_k, s_w, s_h, s_d)] -
s_F[flatten(s_i - 1, s_j, s_k, s_w, s_h, s_d)] ) / (2.0*dx);
dChidy = ( s_F[flatten(s_i, s_j + 1, s_k, s_w, s_h, s_d)] -
s_F[flatten(s_i, s_j - 1, s_k, s_w, s_h, s_d)] ) / (2.0*dx);
dChidz = ( s_F[flatten(s_i, s_j, s_k + 1, s_w, s_h, s_d)] -
s_F[flatten(s_i, s_j, s_k - 1, s_w, s_h, s_d)] ) / (2.0*dx);
__syncthreads();
// Compute Length contribution for each thread
if (dFdx == 0 && dFdy == 0 && dFdz == 0){
s_F[s_idx] = 0.0;
}
else if (dChidx == 0 && dChidy == 0 && dChidz == 0){
s_F[s_idx] = 0.0;
}
else{
s_F[s_idx] = -Q[idx]*(dFdx * dChidx + dFdy * dChidy + dFdz * dChidz) / sqrtf(dFdx * dFdx + dFdy * dFdy + dFdz * dFdz);
}
// __syncthreads();
// Add length contribution from each thread into block memory
if (threadIdx.x == 0 && threadIdx.y == 0 && threadIdx.z == 0){
double local_Q = 0.0;
for (int q = 1; q <= blockDim.x; ++q) {
for (int r = 1; r <= blockDim.y; ++r){
for (int s = 1; s <= blockDim.z; ++s){
int local_idx = flatten(q, r, s, s_w, s_h, s_d);
local_Q += s_F[local_idx];
}
}
}
__syncthreads();
atomicAdd(surfInt_Q, local_Q*dx*dx*dx);
}
return;
}
__global__
void multIk(cufftDoubleComplex *f, cufftDoubleComplex *fIk, double *waveNum, const int dir)
{ // Function to multiply the function fhat by i*k
const int i = blockIdx.x * blockDim.x + threadIdx.x;
const int j = blockIdx.y * blockDim.y + threadIdx.y;
const int k = blockIdx.z * blockDim.z + threadIdx.z;
if ((i >= NX) || (j >= NY) || (k >= NZ2)) return;
const int idx = flatten(i, j, k, NX, NY, NZ2);
// i*k*(a + bi) = -k*b + i*k*a
// Create temporary variables to store real and complex parts
double a = f[idx].x;
double b = f[idx].y;
if(dir == 1){ // Takes derivative in 1 direction (usually x)
fIk[idx].x = -waveNum[i]*b/((double)NN);
fIk[idx].y = waveNum[i]*a/((double)NN);
}
if(dir == 2){ // Takes derivative in 2 direction (usually y)
fIk[idx].x = -waveNum[j]*b/((double)NN);
fIk[idx].y = waveNum[j]*a/((double)NN);
}
if(dir == 3){
fIk[idx].x = -waveNum[k]*b/((double)NN);
fIk[idx].y = waveNum[k]*a/((double)NN);
}
return;
}
// __global__
// void multIk_inplace(cufftDoubleComplex *f, double *waveNum, const int dir)
// { // Function to multiply the function fhat by i*k
// const int i = blockIdx.x * blockDim.x + threadIdx.x;
// const int j = blockIdx.y * blockDim.y + threadIdx.y;
// const int k = blockIdx.z * blockDim.z + threadIdx.z;
// if ((i >= NX) || (j >= NY) || (k >= NZ2)) return;
// const int idx = flatten(i, j, k, NX, NY, NZ2);
// // i*k*(a + bi) = -k*b + i*k*a
// // Create temporary variables to store real and complex parts
// double a = f[idx].x;
// double b = f[idx].y;
// if(dir == 1){ // Takes derivative in 1 direction (usually x)
// f[idx].x = -waveNum[i]*b/((double)NN);
// f[idx].y = waveNum[i]*a/((double)NN);
// }
// if(dir == 2){ // Takes derivative in 2 direction (usually y)
// f[idx].x = -waveNum[j]*b/((double)NN);
// f[idx].y = waveNum[j]*a/((double)NN);
// }
// if(dir == 3){
// f[idx].x = -waveNum[k]*b/((double)NN);
// f[idx].y = waveNum[k]*a/((double)NN);
// }
// return;
// }
__global__
void multIk2(cufftDoubleComplex *f, cufftDoubleComplex *fIk2, double *waveNum, const int dir)
{ // Function to multiply the function fhat by i*k
const int i = blockIdx.x * blockDim.x + threadIdx.x;
const int j = blockIdx.y * blockDim.y + threadIdx.y;
const int k = blockIdx.z * blockDim.z + threadIdx.z;
if ((i >= NX) || (j >= NY) || (k >= NZ2)) return;
const int idx = flatten(i, j, k, NX, NY, NZ2);
// i*k*(a + bi) = -k*b + i*k*a
if(dir == 1){ // Takes derivative in 1 direction (usually x)
fIk2[idx].x = -waveNum[i]*waveNum[i]*f[idx].x/((double)NN);
fIk2[idx].y = -waveNum[i]*waveNum[i]*f[idx].y/((double)NN);
}
if(dir == 2){ // Takes derivative in 2 direction (usually y)
fIk2[idx].x = -waveNum[j]*waveNum[j]*f[idx].x/((double)NN);
fIk2[idx].y = -waveNum[j]*waveNum[j]*f[idx].y/((double)NN);
}
if(dir == 3){
fIk2[idx].x = -waveNum[k]*waveNum[k]*f[idx].x/((double)NN);
fIk2[idx].y = -waveNum[k]*waveNum[k]*f[idx].y/((double)NN);
}
return;
}
// void fftDerivative(cufftHandle invp, double *waveNum, cufftDoubleComplex *fhat, cufftDoubleComplex *fphat, cufftDoubleReal *fp, int dir)
// {// Function to calculate derivatives of a function
// // Initialize result variable for error-checking
// cufftResult result;
// // Set kernel variables
// const dim3 blockSize(TX, TY, TZ);
// const dim3 gridSize(divUp(NX, TX), divUp(NY, TY), divUp(NZ2, TZ));
// // Multiply complex function by i*k (derivative in Fourier Space)
// // This function also scales the field in preparation for the next transform
// multIk<<<gridSize, blockSize>>>(fhat, fphat, waveNum, dir);
// // Take inverse transform to get function back to physical space
// result = cufftExecZ2D(invp, fphat, fp );
// if ( result != CUFFT_SUCCESS){
// fprintf(stderr, "CUFFT error: ExecZ2D failed, error code %d\n",(int)result);
// return;
// }
// return;
// }
void fftDer(cufftHandle p, cufftHandle invp, double *waveNum, cufftDoubleReal *f, cufftDoubleComplex *fhat, cufftDoubleReal *fp, int dir)
{// Function to calculate derivatives of a function
// Initialize result variable for error-checking
cufftResult result;
// Set kernel variables
const dim3 blockSize(TX, TY, TZ);
const dim3 gridSize(divUp(NX, TX), divUp(NY, TY), divUp(NZ2, TZ));
// Take fourier transform to get function to wave space
result = cufftExecD2Z(p, f, fhat );
if ( result != CUFFT_SUCCESS){
fprintf(stderr, "CUFFT error: ExecZ2D failed, error code %d\n",(int)result);
return;
}
// Multiply complex function by i*k (derivative in Fourier Space)
// This function also scales the field in preparation for the next transform
multIk<<<gridSize, blockSize>>>(fhat, fhat, waveNum, dir);
// Take inverse transform to get function back to physical space
result = cufftExecZ2D(invp, fhat, fp );
if ( result != CUFFT_SUCCESS){
fprintf(stderr, "CUFFT error: ExecZ2D failed, error code %d\n",(int)result);
return;
}
return;
}
void fft2ndDer(cufftHandle p, cufftHandle invp, double *waveNum, cufftDoubleReal *f, cufftDoubleComplex *fhat, cufftDoubleReal *fp, int dir)
{// Function to calculate derivatives of a function
// Initialize result variable for error-checking
cufftResult result;
// Set kernel variables
const dim3 blockSize(TX, TY, TZ);
const dim3 gridSize(divUp(NX, TX), divUp(NY, TY), divUp(NZ2, TZ));
// Take fourier transform to get function to wave space
result = cufftExecD2Z(p, f, fhat );
if ( result != CUFFT_SUCCESS){
fprintf(stderr, "CUFFT error: ExecZ2D failed, error code %d\n",(int)result);
return;
}
// Multiply complex function by i*k (derivative in Fourier Space)
// This function also scales the field in preparation for the next transform
multIk2<<<gridSize, blockSize>>>(fhat, fhat, waveNum, dir);
// Take inverse transform to get function back to physical space
result = cufftExecZ2D(invp, fhat, fp );
if ( result != CUFFT_SUCCESS){
fprintf(stderr, "CUFFT error: ExecZ2D failed, error code %d\n",(int)result);
return;
}
return;
}
void fft2ndDerivative(cufftHandle invp, double *waveNum, cufftDoubleComplex *fhat, cufftDoubleComplex *fphat, cufftDoubleReal *fp, int dir)
{// Function to calculate derivatives of a function
// Initialize result variable for error-checking
cufftResult result;
// Set kernel variables
const dim3 blockSize(TX, TY, TZ);
const dim3 gridSize(divUp(NX, TX), divUp(NY, TY), divUp(NZ2, TZ));
// Multiply complex function by i*k (derivative in Fourier Space)
// This function also scales the field in preparation for the next transform
multIk2<<<gridSize, blockSize>>>(fhat, fphat, waveNum, dir);
// Take inverse transform to get function back to physical space
result = cufftExecZ2D(invp, fphat, fp);
if ( result != CUFFT_SUCCESS){
fprintf(stderr, "CUFFT error: ExecZ2D failed, error code %d\n",(int)result);
return;
}
return;
}
__global__
void magnitude(cufftDoubleReal *f1, cufftDoubleReal *f2, cufftDoubleReal *f3, cufftDoubleReal *mag){
// Function to calculate the magnitude of a 3D vector field
const int i = blockIdx.x * blockDim.x + threadIdx.x;
const int j = blockIdx.y * blockDim.y + threadIdx.y;
const int k = blockIdx.z * blockDim.z + threadIdx.z;
if ((i >= NX) || (j >= NY) || (k >= NZ)) return;
const int idx = flatten(i, j, k, NX, NY, NZ);
// Magnitude of a 3d vector field = sqrt(f1^2 + f2^2 + f3^2)
mag[idx] = sqrt(f1[idx]*f1[idx] + f2[idx]*f2[idx] + f3[idx]*f3[idx]);
return;
}
__global__
void mult3AndAdd(cufftDoubleReal *f1, cufftDoubleReal *f2, cufftDoubleReal *f3, cufftDoubleReal *f4, const int flag)
{ // Function to multiply 3 functions and add (or subtract) the result to a 4th function
const int i = blockIdx.x * blockDim.x + threadIdx.x;
const int j = blockIdx.y * blockDim.y + threadIdx.y;
const int k = blockIdx.z * blockDim.z + threadIdx.z;
if ((i >= NX) || (j >= NY) || (k >= NZ)) return;
const int idx = flatten(i, j, k, NX, NY, NZ);
if ( flag == 1 ){
f4[idx] = f4[idx] + f1[idx]*f2[idx]*f3[idx];
}
else if ( flag == 0 ){
f4[idx] = f4[idx] - f1[idx]*f2[idx]*f3[idx];
}
else{
printf("Multipy and Add function failed: please designate 1 (plus) or 0 (minus).\n");
}
return;
}
__global__
void mult2AndAdd(cufftDoubleReal *f1, cufftDoubleReal *f2, cufftDoubleReal *f3, const int flag)
{ // Function to multiply 3 functions and add (or subtract) the result to a 4th function
const int i = blockIdx.x * blockDim.x + threadIdx.x;
const int j = blockIdx.y * blockDim.y + threadIdx.y;
const int k = blockIdx.z * blockDim.z + threadIdx.z;
if ((i >= NX) || (j >= NY) || (k >= NZ)) return;
const int idx = flatten(i, j, k, NX, NY, NZ);
if ( flag == 1 ){
f3[idx] = f3[idx] + f1[idx]*f2[idx];
}
else if ( flag == 0 ){
f3[idx] = f3[idx] - f1[idx]*f2[idx];
}
else{
printf("Multipy and Add function failed: please designate 1 (plus) or 0 (minus).\n");
}
return;
}
__global__
void multiplyOrDivide(cufftDoubleReal *f1, cufftDoubleReal *f2, cufftDoubleReal *f3, const int flag){
// This function either multiplies two functions or divides two functions, depending on which flag is passed. The output is stored in the first array passed to the function.
const int i = blockIdx.x * blockDim.x + threadIdx.x;
const int j = blockIdx.y * blockDim.y + threadIdx.y;
const int k = blockIdx.z * blockDim.z + threadIdx.z;
if ((i >= NX) || (j >= NY) || (k >= NZ)) return;
const int idx = flatten(i, j, k, NX, NY, NZ);
if ( flag == 1 ){
f3[idx] = f1[idx]*f2[idx];
}
else if ( flag == 0 ){
f3[idx] = f1[idx]/f2[idx];
}
else{
printf("Multipy or Divide function failed: please designate 1 (multiply) or 0 (divide).\n");
}
return;
}
__global__
void calcTermIV_kernel(cufftDoubleReal *gradZ, cufftDoubleReal *IV){
const int i = blockIdx.x * blockDim.x + threadIdx.x;
const int j = blockIdx.y * blockDim.y + threadIdx.y;
const int k = blockIdx.z * blockDim.z + threadIdx.z;
if ((i >= NX) || (j >= NY) || (k >= NZ)) return;
const int idx = flatten(i, j, k, NX, NY, NZ);
IV[idx] = 1.0/(gradZ[idx]*gradZ[idx])*IV[idx];
return;
}
void calcTermIV(cufftHandle p, cufftHandle invp, double *k, cufftDoubleReal *u, cufftDoubleReal *v, cufftDoubleReal *w, cufftDoubleReal *s, double *T4){
// Function to calculate the 4th term at each grid point in the dSigmadt equation
// The equation for Term IV is:
// IV = -( nx*nx*dudx + nx*ny*dudy + nx*nz*dudz + ny*nx*dvdx + ny*ny*dvdy ...
// + ny*nz*dvdz + nz*nx*dwdx + nz*ny*dwdy + nz*nz*dwdz),
// where nx = -dsdx/grads, ny = -dsdy/grads, nz = -dsdz/grads,
// and grads = sqrt(dsdx^2 + dsdy^2 + dsdz^2).
// Allocate temporary variables
cufftDoubleReal *dsdx, *dsdy, *dsdz, *grads;
cufftDoubleComplex *temp_c;
// cufftResult result;
cudaMallocManaged(&dsdx, sizeof(cufftDoubleReal)*NN);
cudaMallocManaged(&dsdy, sizeof(cufftDoubleReal)*NN);
cudaMallocManaged(&dsdz, sizeof(cufftDoubleReal)*NN);
cudaMallocManaged(&grads, sizeof(cufftDoubleReal)*NN); // Variable to hold the magnitude of gradient of s as well as other temporary variables
cudaMallocManaged(&temp_c, sizeof(cufftDoubleComplex)*NX*NY*NZ2);
// Set kernel variables
const dim3 blockSize(TX, TY, TZ);
const dim3 gridSize(divUp(NX, TX), divUp(NY, TY), divUp(NZ, TZ));
// Initialize T4 to zero
cudaMemset(T4, 0.0, sizeof(double)*NX*NY*NZ);
// Calculate derivatives of scalar field
// dsdx
fftDer(p, invp, k, s, temp_c, dsdx, 1);
// dsdy
fftDer(p, invp, k, s, temp_c, dsdy, 2);
// dsdz
fftDer(p, invp, k, s, temp_c, dsdz, 3);
// Approach: calculate each of the 9 required terms for Term IV separately and add them to the running total
// 1st term: nx*nx*dudx
// Take derivative to get dudx
fftDer(p, invp, k, u, temp_c, grads, 1);
// Multiply by nx*nx and add to Term IV
mult3AndAdd<<<gridSize, blockSize>>>(dsdx, dsdx, grads, T4, 0);
// 2nd term: nx*ny*dudy
// Take derivative to get dudy
fftDer(p, invp, k, u, temp_c, grads, 2);
// Multiply by nx*ny and add to Term IV
mult3AndAdd<<<gridSize, blockSize>>>(dsdx, dsdy, grads, T4, 0);
// 3rd term: nx*nz*dudz
// Take derivative to get dudz
fftDer(p, invp, k, u, temp_c, grads, 3);
// Multiply by nx*nz and add to Term IV