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 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215 1216 1217 1218 1219 1220 1221 1222 1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248 1249 1250 1251 1252 1253 1254 1255 1256 1257 1258 1259 1260 1261 1262 1263 1264 1265 1266 1267 1268 1269 1270 1271 1272 1273 1274 1275 1276 1277 1278 1279 1280 1281 1282 1283 1284 1285 1286 1287 1288 1289 1290 1291 1292 1293 1294 1295 1296 1297 1298 1299 1300 1301 1302 1303 1304 1305 1306 1307 1308 1309 1310 1311 1312 1313 1314 1315 1316 1317 1318 1319 1320 1321 1322 1323 1324 1325 1326 1327 1328 1329 1330 1331 1332 1333 1334 1335
|
/* $Source: bitbucket.org:berkeleylab/gasnet.git/tests/testnbr.c $
* Description: MG-like Neighbor exchange
* Copyright 2005, Christian Bell <csbell@cs.berkeley.edu>
* Terms of use are as specified in license.txt
*/
/************************************************************
* testnbr.c:
* NAS MG modelled microbenchmark to measure the cost of nbr ghost cell
* exchanges. The benchmark replicates ghost exchanges over all dimensions
* (two of which generate strided data communication).
*
*************************************************************/
#include <gasnetex.h>
#include <math.h>
uintptr_t maxsegmentsz;
#ifndef TEST_SEGSZ
#define TEST_SEGSZ_EXPR ((uintptr_t)maxsegmentsz)
#endif
#include "test.h"
static gex_Client_t myclient;
static gex_EP_t myep;
static gex_TM_t myteam;
static gex_Segment_t mysegment;
typedef struct {
int datasize;
int iters;
int dims;
int axis;
int category;
uint64_t time;
double max_throughput;
} stat_struct_t;
uintptr_t topalloc = 0;
FILE *nbr_fp;
int maxlevel = 4;
int myproc;
int nprocs;
#define CACHELINE_SZ 128
#define POWER_OF_TWO(P) (((P)&((P)-1)) == 0)
#define PX_SZ (nb->dims[2]*nb->dims[1])
#define PY_SZ (nb->dims[2]*nb->dims[0])
#define PZ_SZ (nb->dims[1]*nb->dims[0])
#define AX 0
#define AY 1
#define AZ 2
#define AALL 3
#define LINEARIZEPROC(nb,k,j,i) (k*(nb)->procGrid[1]*(nb)->procGrid[0] + \
j*(nb)->procGrid[0] + i)
#define GHOST_TYPE_PUT 0
#define GHOST_TYPE_AMLONG 1
#define GHOST_DIR_UPPER 0
#define GHOST_DIR_LOWER 1
#define GP_BLOCK(x) do { gex_Event_t h = (x); \
if ((h) != GEX_EVENT_INVALID) gex_Event_Wait(h); } while (0)
/*
* Memory requirements for this test differ according to the type of ghost
* exchange being performed. They all have the per-processor data grid size
* memory requirement based on the level of the grid.
*
* Over all axes x,y,z planes along the z axis (xy) planes are contiguous in
* memory. This requires exchanges along the x and y axes to have some form
* of non-contiguous communication.
*
*
* The following types of ghost exchanges are done:
*
* 1. UPC (Parry's MG)
* * Over each dimension, pack boundary plane in a buffer, send the buffer
* and signal the nbr with a put.
* * Each processor spins on the signal waiting to unpack the buffer back
* into local computation data.
* * Memory reqs:
*
* 2. Non-blocking GASNet (similar to UPC version)
*
* 2. GASNet Active-Messages, AMLong
* * Pack into buffer send AMLong.
* * Receiver runs handler, unpacks the data and increments a counter
*/
typedef
struct _nbr_t {
int dimsz; /* global dimension size */
/* 0 => yz plane
* 1 => xz plane
* 2 => xy plane (contiguous)
*/
int procGrid[3];
int idGrid[3];
/* Upper and Lower nbrs in each dimension (grid id) */
int idGridUpper[3];
int idGridLower[3];
/* Upper and Lower nbrs in each dimension (GASNet node ids) */
gex_Rank_t nodeidUpper[3];
gex_Rank_t nodeidLower[3];
/* Cache dims in all Lower nbrs */
int dimsLower[3];
/* blocks per grid element in each dimension */
int elemsPerDim;
int dims[3];
int facesz[3]; /* Face sz for each axis in elements */
uintptr_t totalSize;
/* Different mechanisms for Ghost exchanges */
double *Ldata; /* Local computation data */
uintptr_t *Dir; /* Remote computation data, flattened 3d cube */
uintptr_t *Diryz; /* Target for yz boundary exchanges */
uintptr_t *Dirxz; /* Target for xz boundary exchanges */
uintptr_t *DirSync; /* Target sync locations for notifies */
uintptr_t *DirSyncComm3; /* Target sync after comm3 phase */
/* Target communication buffers for non-contiguous planes */
double *yzBuffer;
double *xzBuffer;
/* xyBuffer requires no packing */
/* Arrays into communicaiton buffers, for low/up nbr in each dim */
double *dimBufs[3][2];
/* Two local communication buffers for non-contiguous planes */
double *yzCommBuffer;
double *xzCommBuffer;
/* For AM-long based updates XXX *not* cache friendly for floating funcs */
int amdims[3][2];
/* Loop iterations to kill time */
int64_t loopiters;
/* For computing medians at node 0 */
stat_struct_t *stats0;
}
nbr_t;
/* Only one-level for now */
nbr_t Nbr;
#define AREF(nb,k,j,i) (nb->Ldata[(k)*(nb)->dims[1]*(nb)->dims[0] + \
(j)*(nb)->dims[0] + i])
#define NBR_SYNC_LEN (1 + CACHELINE_SZ/sizeof(int))
#define NBR_SYNC_OFF(axis,id,phase) (NBR_SYNC_LEN*(4*(axis)+2*(id)+(phase)))
#define NBR_SYNCADDR(base,axis,id,phase) \
(((volatile int*)(base)) + NBR_SYNC_OFF(axis,id,phase))
void setupGrid(nbr_t *nb, int level);
void allocMultiGrid(nbr_t *nb);
void initNbr(nbr_t *nb);
void freeNbr(nbr_t *nb);
void estimateMemSegment(nbr_t *nb, uintptr_t *local, uintptr_t *segment);
void ghostExchUPCMG (nbr_t *nb, int iters, int axis, int pairwise_sync);
void ghostExchGASNetNonBlock(nbr_t *nb, int iters, int axis, int pairwise_sync);
void ghostExchAMLong (nbr_t *nb, int iters, int axis);
gex_Event_t ge_put (nbr_t *nb, int type, int dir, int axis, int *flag);
gex_Event_t ge_notify(nbr_t *nb, int dir, int axis);
void ge_wait (nbr_t *nb, int dir, int axis);
void ge_unpack(nbr_t *nb, double *src, size_t destp, int axis);
void pairwise_signal_nbrs(nbr_t *nb, gex_Event_t *h_nbr, int axis_in, int phase);
void pairwise_wait_nbrs (nbr_t *nb, gex_Event_t *h_nbr, int axis_in, int phase);
#define hidx_ghostReqHandler 201
static
void ghostReqHandler(gex_Token_t token, void *buf, size_t nbytes,
int axis, int destp)
{
double *src = (double *)buf;
int face = (destp != 0);
if (axis != AZ)
ge_unpack(&Nbr, src, destp, axis);
Nbr.amdims[axis][face] = 1;
return;
}
gex_AM_Entry_t htable[] = {
{ hidx_ghostReqHandler, (gex_AM_Fn_t)ghostReqHandler, GEX_FLAG_AM_REQUEST|GEX_FLAG_AM_LONG, 2, NULL, NULL }
};
#define init_stat \
GASNETT_TRACE_SETSOURCELINE(__FILE__,__LINE__), _init_stat
#define update_stat \
GASNETT_TRACE_SETSOURCELINE(__FILE__,__LINE__), _update_stat
#define print_stat \
GASNETT_TRACE_SETSOURCELINE(__FILE__,__LINE__), _print_stat
void _init_stat(nbr_t *nb, stat_struct_t *st, int axis, int dims, int sz)
{
memset(st, 0, sizeof(*st)); /* prevent valgrind warnings about struct padding */
st->iters = 0;
st->dims = dims;
st->datasize = sz;
st->axis = axis;
st->time = 0;
if (st->axis != AALL)
st->category = (nb->nodeidUpper[axis] != myproc) +
(nb->nodeidLower[axis] != myproc);
else
st->category = 3;
}
void _update_stat(stat_struct_t *st, uint64_t temptime, int iters)
{
st->iters += iters;
st->time += temptime;
}
void _print_stat(nbr_t *nb, int myproc, stat_struct_t *st, const char *name)
{
int i,c;
float cattimes[4] = { 0.0 };
int catcount[4] = { 0 };
double stdev[4];
double ttime;
/* Update statistics at zero.
* If we are doing a per-axis test, we separate the printed values
* within three categories based on the type of nbr updates that
* were completed.
*
* Updates to Upper/Lower nbr can be
* 1. Global/Global (both updates required communication)
* 2. Global/Local or Local/Global (only one update req'd comm).
* 3. Local/Local (no updates required communication)
* 4. Don't care (either local/global)
*/
gex_RMA_PutBlocking(myteam, 0, nb->stats0 + myproc, st, sizeof(stat_struct_t), 0);
BARRIER();
if (myproc)
return;
/* Find average in each category of face updates */
for (i = 0; i < nprocs; i++) {
c = nb->stats0[i].category;
assert(c >= 0 && c <= 3);
cattimes[c] += ((float)nb->stats0[i].time) / nb->stats0[i].iters;
catcount[c]++;
}
/* Calculate average */
for (i = 0; i < 4; i++) {
if (catcount[i] > 0)
cattimes[i] /= (float) catcount[i];
else
cattimes[i] = .0;
}
/* Calculate stdev for each category*/
for (c = 0; c < 4; c++) {
if (catcount[c] < 2)
stdev[c] = .0;
else {
double sumsq = .0;
double devmean = .0;
double procavg;
double divm;
for (i = 0; i < nprocs; i++) {
if (nb->stats0[i].category != c)
continue;
procavg = ((double)nb->stats0[i].time)/nb->stats0[i].iters;
devmean = (double)cattimes[c] - procavg;
sumsq += devmean*devmean;
}
divm = sumsq / (catcount[c]-1);
stdev[c] = sqrt(divm);
}
}
if (catcount[3] > 0) {
/* Don't care about various global/local distinctions */
printf("DIM %4i fullexch %8i byte : %5i iters, %9.2f +/- %8.2f us ave (%s)\n",
st->dims, st->datasize, st->iters, cattimes[3], stdev[3], name);
}
else {
printf("DIM %4i axis %c %8i byte : %5i iters, %9.2f +/- %8.2f us ave (%s)\n",
st->dims, 'x'+st->axis, st->datasize, st->iters, cattimes[2], stdev[2], name
);
}
if (nbr_fp != NULL) {
int cat = catcount[3] > 0 ? 3 : 2;
fprintf(nbr_fp, "%-11s %c %4i %8i %9.2f %8.2f ",
name, cat == 3 ? 'F' : st->axis + 'x', st->dims, st->datasize,
cattimes[cat], stdev[cat]);
for (i = 0; i < nprocs; i++) {
if (nb->stats0[i].category != cat) {
ttime = .0;
}
else
ttime = ((float)nb->stats0[i].time) / nb->stats0[i].iters;
fprintf(nbr_fp, " %9.2f", ttime);
}
fprintf(nbr_fp, "\n");
fflush(nbr_fp);
}
fflush(stdout);
}
int level_dims[][20] = {
{ 16,32,48,64,80,96,112,128,0 },
{ 16,32,48,64,80,96,112,128,144,160,176,192,208,224,240,256,0 },
{ 32,64,96,128,160,192,224,256,288,320,352,384,416,448,480,512,0 },
{ 64,128,192,256,320,384,448,512,576,640,704,768,832,896,960,1024,0 }
};
int
main(int argc, char **argv)
{
int level = 0, i;
int alldimensions = 1;
int upctestonly = 0;
char *nbrf;
uintptr_t insegsz, outsegsz;
int iters = 150;
int dim;
int maxdim = 0;
int axis;
int argn = 1;
int help = 0;
/* call startup */
GASNET_Safe(gex_Client_Init(&myclient, &myep, &myteam, "testnbr", &argc, &argv, 0));
/* get SPMD info */
myproc = gex_TM_QueryRank(myteam);
nprocs = gex_TM_QuerySize(myteam);
/* XXX parse args: iters min max */
while (argc > argn && *argv[argn] == '-') {
char c = argv[argn][1];
if (c == 'f')
alldimensions = 0;
else if (c == 'm')
upctestonly = 1;
else
help = 1;
argn++;
}
if (argc > argn) {
iters = atoi(argv[argn++]);
if (!iters) help = 1;
}
if (argc > argn) {
level = atoi(argv[argn++]);
if (!(level >= 0 && level < 4)) help = 1;
}
for (i = 0; i < level_dims[level][i]; i++)
maxdim = MAX(level_dims[level][i], maxdim);
/* setup max grid we intend to use, so we can get enough
* memory per proc at startup */
if (help || !POWER_OF_TWO(nprocs)) maxsegmentsz = PAGESZ;
else {
setupGrid(&Nbr, maxdim);
estimateMemSegment(&Nbr, &insegsz, &outsegsz);
maxsegmentsz = outsegsz + PAGESZ*nprocs;
}
GASNET_Safe(gex_Segment_Attach(&mysegment, myteam, TEST_SEGSZ_REQUEST));
GASNET_Safe(gex_EP_RegisterHandlers(myep, htable, sizeof(htable)/sizeof(gex_AM_Entry_t)));
test_init("testnbr",1, "[-f] [-m] [iters] [level]\n\n"
"-f run full nbr exchange (NAS MG) instead of per axis\n"
"-m run UPC version of GASNet MG test only\n"
"[iters] How many iterations per exchange (default = 150)\n"
"[level] select level of dimensions (default level = 0)\n"
" level=0 dims=<16,32,48,64,80,96,112,128>\n"
" level=1 dims=<16,32,48,64, .. 128,160,192,224,256>\n"
" level=2 dims=<32,64,96,128, .. 320,352,384,416,448,480,512>\n"
" level=3 dims=<32,64,96,128, .. 928,960,992,1024>\n\n"
);
if (help) test_usage();
if (!POWER_OF_TWO(nprocs)) {
MSG0("WARNING: This test requires a power of two number of processes. Test skipped.\n");
gasnet_exit(0); /* exit 0 to prevent false negatives */
}
TEST_SET_WAITMODE(1);
initNbr(&Nbr);
BARRIER();
/* Run test over all axes:
* 0 -> x: yz planes
* 1 -> y: xz planes
* 2 -> z: xy planes
* 3 -> x,y,z Full MG-like Neighbor exchange
*/
/* We may want to gather extended info in a file */
if (!myproc && (nbrf = gasnet_getenv("NBRTEST_FILE")) != NULL) {
nbr_fp = fopen(nbrf, "w");
if (nbr_fp == NULL) {
fprintf(stderr, "Can't open NBRTEST_FILE %s\n", nbrf);
gasnet_exit(1);
}
printf("Saving extended output to %s\n", nbrf);
}
else
nbr_fp = NULL;
if (!myproc) {
printf("\ntestnbr running %d %s"
" (%d procs over processor grid = %2i x %2i x %2i)\n",
iters, alldimensions ? "ghost exchanges per axis" :
"full (NAS MG-like) ghost exchanges",
nprocs, Nbr.procGrid[0], Nbr.procGrid[1], Nbr.procGrid[2]);
printf(
"\nReported times are the medians across all processors only"
" for ghost exchanges that incur network communication\n");
}
BARRIER();
if (alldimensions) {
for (axis = 0; axis <= 2; axis++) {
if (!myproc) {
if (axis == 2)
printf("\nExchange over 'z' contiguous axis, grid = %d procs\n",
Nbr.procGrid[2]);
else
printf("\nExchange over '%c' non-contiguous axis, grid = "
"%d procs (DIM%s x stride %s)\n", 'x' + axis,
Nbr.procGrid[axis], axis==0 ? "^2" : "",
axis==0 ? "DIM" : "1");
fflush(stdout);
}
BARRIER();
for (i = 0; level_dims[level][i] != 0; i++) {
dim = level_dims[level][i];
setupGrid(&Nbr, dim);
allocMultiGrid(&Nbr);
BARRIER();
/* In the alldimensions test, run only the non-blocking
* pairwise and the AMLong versions */
ghostExchUPCMG(&Nbr, 1, axis, 0); /* Dry run */
ghostExchUPCMG(&Nbr, iters, axis, 0);
}
BARRIER();
if (upctestonly)
continue;
for (i = 0; level_dims[level][i] != 0; i++) {
dim = level_dims[level][i];
setupGrid(&Nbr, dim);
allocMultiGrid(&Nbr);
BARRIER();
/* In the alldimensions test, run only the non-blocking
* pairwise and the AMLong versions */
ghostExchGASNetNonBlock(&Nbr, 1, axis, 1); /* Dry run */
ghostExchGASNetNonBlock(&Nbr, iters, axis, 1);
}
BARRIER();
for (i = 0; level_dims[level][i] != 0; i++) {
dim = level_dims[level][i];
setupGrid(&Nbr, dim);
allocMultiGrid(&Nbr);
BARRIER();
ghostExchAMLong(&Nbr, 1, axis); /* Dry run */
ghostExchAMLong(&Nbr, iters, axis);
}
}
}
else {
axis = 3; /* Full ghost exchange, no individual axis */
BARRIER();
for (i = 0; level_dims[level][i] != 0; i++) {
dim = level_dims[level][i];
setupGrid(&Nbr, dim);
allocMultiGrid(&Nbr);
BARRIER();
ghostExchUPCMG(&Nbr, 1, axis, 0); /* Dry run */
ghostExchUPCMG(&Nbr, iters, axis, 0);
}
BARRIER();
if (!upctestonly) {
for (i = 0; level_dims[level][i] != 0; i++) {
dim = level_dims[level][i];
setupGrid(&Nbr, dim);
allocMultiGrid(&Nbr);
BARRIER();
ghostExchGASNetNonBlock(&Nbr, 1, axis, 1); /* Dry run */
ghostExchGASNetNonBlock(&Nbr, iters, axis, 1);
}
BARRIER();
for (i = 0; level_dims[level][i] != 0; i++) {
dim = level_dims[level][i];
setupGrid(&Nbr, dim);
allocMultiGrid(&Nbr);
BARRIER();
ghostExchAMLong(&Nbr, 1, axis); /* Dry run */
ghostExchAMLong(&Nbr, iters, axis);
}
}
}
freeNbr(&Nbr);
BARRIER();
if (nbr_fp != NULL)
fclose(nbr_fp);
gasnet_exit(0);
return 0;
}
void
setupGrid(nbr_t *nb, int dimsz)
{
int t_grid = 1;
int axis;
int elemsPerDim, totelemsPerDim;
nb->procGrid[0] = 1;
nb->procGrid[1] = 1;
nb->procGrid[2] = 1;
/* setup the processor grid */
while (t_grid*2 <= nprocs) {
nb->procGrid[0] *= 2;
t_grid *= 2;
if (t_grid*2 <= nprocs) {
nb->procGrid[1] *= 2;
t_grid *= 2;
if (t_grid*2 <= nprocs) {
nb->procGrid[2] *= 2;
t_grid *= 2;
}
}
}
assert(t_grid == nprocs);
/* Setup the proc id in the grid */
t_grid = myproc;
nb->idGrid[0] = (myproc % (nb->procGrid[0]*nb->procGrid[1]))
% nb->procGrid[0];
nb->idGrid[1] = (myproc % (nb->procGrid[0]*nb->procGrid[1]))
/ nb->procGrid[0];
nb->idGrid[2] = myproc/(nb->procGrid[0]*nb->procGrid[1]);
/* Setup the number of blocks per grid element in each dimension. Total
* elements per dimension contains an extra two boundary elements */
nb->elemsPerDim = elemsPerDim = dimsz;/*(2<<(unsigned)level);*/
totelemsPerDim = elemsPerDim + 2;
nb->totalSize = 1;
/* Setup lower and upper nbrs in each dimension */
for (axis = 0; axis <= 2; axis++) {
int blocksz = elemsPerDim / nb->procGrid[axis];
/* We don't handle corner cases, yet */
assert_always(blocksz > 0);
assert_always(elemsPerDim > nb->procGrid[axis]);
assert_always(elemsPerDim % nb->procGrid[axis] == 0);
nb->idGridUpper[axis] =
nb->idGrid[axis] == nb->procGrid[axis]-1
? 0 : nb->idGrid[axis]+1;
nb->idGridLower[axis] =
nb->idGrid[axis] == 0
? nb->procGrid[axis]-1 : nb->idGrid[axis]-1;
/* Now map the grid onto actual nodes */
switch (axis) {
case 0: /* X axis */
nb->nodeidUpper[0] = LINEARIZEPROC(nb,
nb->idGrid[2],nb->idGrid[1],nb->idGridUpper[0]);
nb->nodeidLower[0] = LINEARIZEPROC(nb,
nb->idGrid[2],nb->idGrid[1],nb->idGridLower[0]);
break;
case 1: /* Y axis */
nb->nodeidUpper[1] = LINEARIZEPROC(nb,
nb->idGrid[2],nb->idGridUpper[1],nb->idGrid[0]);
nb->nodeidLower[1] = LINEARIZEPROC(nb,
nb->idGrid[2],nb->idGridLower[1],nb->idGrid[0]);
break;
case 2: /* Z axis */
nb->nodeidUpper[2] = LINEARIZEPROC(nb,
nb->idGridUpper[2],nb->idGrid[1],nb->idGrid[0]);
nb->nodeidLower[2] = LINEARIZEPROC(nb,
nb->idGridLower[2],nb->idGrid[1],nb->idGrid[0]);
break;
default:
break;
}
/* Don't forget boundary elements in each dimension */
blocksz += 2;
/* XXX assumption of equal block distribution */
nb->dimsLower[axis] = blocksz;
nb->totalSize *= (long) blocksz;
nb->dims[axis] = blocksz;
}
nb->facesz[0] = nb->dims[1]*nb->dims[2];
nb->facesz[1] = nb->dims[0]*nb->dims[2];
nb->facesz[2] = nb->dims[0]*nb->dims[1];
nb->dimsz = dimsz;
if (0) {
fprintf(stdout,
"%2d> level %2d [%1d,%1d,%1d] in grid [%1d,%1d,%1d] has "
"[%1d,%1d],[%1d,%1d],[%1d,%1d] OR"
"[%1d,%1d],[%1d,%1d],[%1d,%1d]\n",
myproc, dimsz,
nb->idGrid[0], nb->idGrid[1], nb->idGrid[2],
nb->procGrid[0], nb->procGrid[1], nb->procGrid[2],
nb->idGridLower[0], nb->idGridUpper[0],
nb->idGridLower[1], nb->idGridUpper[1],
nb->idGridLower[2], nb->idGridUpper[2],
(int)(nb->nodeidLower[0]), (int)(nb->nodeidUpper[0]),
(int)(nb->nodeidLower[1]), (int)(nb->nodeidUpper[1]),
(int)(nb->nodeidLower[2]), (int)(nb->nodeidUpper[2]));
}
}
/*
* Estimate segment memory requirements for parry's ghost */
void
estimateMemSegment(nbr_t *nb, uintptr_t *local, uintptr_t *segment)
{
uintptr_t outseg = 0;
uintptr_t inseg = 0;
outseg += /* local xz and yz comm buffers, 2 boundaries each */
(nb->dims[0]*nb->dims[2]*2 + nb->dims[1]*nb->dims[2]*2) *
sizeof(double);
outseg += /* per-processor directories: Dir, Dirxy, Dirxz,
Diryz, DirSync, DirSyncComm3 */
nprocs*6*sizeof(uintptr_t);
inseg += /* sync flags for each cube face, on a separate cache line */
(sizeof(int)*8*2*2*NBR_SYNC_LEN);
inseg += /* xz,yz and xy target comm buffers, 2 boundaries each */
(PX_SZ+PY_SZ+PZ_SZ)*2*sizeof(double);
inseg += /* comm buffers for non-contiguous planes */
(PX_SZ+PY_SZ)*2*sizeof(double);
inseg += /* Actual computation data, page aligned */
alignup((uintptr_t)(nb->totalSize * sizeof(double)), PAGESZ);
inseg += /* room for stats */
sizeof(stat_struct_t) * nprocs;
*local = outseg;
*segment = inseg;
return;
}
void
freeNbr(nbr_t *nb)
{
free(nb->Dir);
free(nb->Diryz);
free(nb->Dirxz);
free(nb->DirSync);
free(nb->DirSyncComm3);
}
void
initNbr(nbr_t *nb)
{
nb->Dir = (uintptr_t *) calloc(nprocs, sizeof(uintptr_t));
nb->Diryz = (uintptr_t *) calloc(nprocs, sizeof(uintptr_t));
nb->Dirxz = (uintptr_t *) calloc(nprocs, sizeof(uintptr_t));
nb->DirSync = (uintptr_t *) calloc(nprocs, sizeof(uintptr_t));
nb->DirSyncComm3 = (uintptr_t *) calloc(nprocs, sizeof(uintptr_t));
return;
}
/*
* Carve out our segment according to the grid dimensions currently set in Nb
*/
void
allocMultiGrid(nbr_t *nb)
{
int i;
char *segaddr;
for (i = 0; i < nprocs; i++) {
/* segaddr points to beginning of shared GASNet segment */
segaddr = (char *) TEST_SEG(i);
/* Common to parry and amlong approaches */
nb->Dir[i] = (uintptr_t) segaddr;
segaddr += alignup(nb->totalSize * sizeof(double), PAGESZ);
nb->Diryz[i] = (uintptr_t) segaddr;
segaddr += 2*PX_SZ*sizeof(double);
nb->Dirxz[i] = (uintptr_t) segaddr;
segaddr += 2*PY_SZ*sizeof(double);
if (myproc == i) {
nb->dimBufs[0][0] = nb->yzBuffer = (double *) nb->Diryz[i];
nb->dimBufs[0][1] = nb->dimBufs[0][0] + PX_SZ;
nb->dimBufs[1][0] = nb->xzBuffer = (double *) nb->Dirxz[i];
nb->dimBufs[1][1] = nb->dimBufs[1][0] + PY_SZ;
nb->Ldata = (double *) nb->Dir[i];
}
if (myproc == i)
nb->yzCommBuffer = (double *) segaddr;
segaddr += 2*PX_SZ*sizeof(double);
if (myproc == i)
nb->xzCommBuffer = (double *) segaddr;
segaddr += 2*PY_SZ*sizeof(double) ;
/* Dirsync requires counters on separate cache lines */
segaddr += NBR_SYNC_LEN*sizeof(int);
nb->DirSync[i] = (uintptr_t) segaddr;
segaddr += 8*NBR_SYNC_LEN*sizeof(int);
nb->DirSyncComm3[i] = (uintptr_t) segaddr;
segaddr += 8*NBR_SYNC_LEN*sizeof(int);
if (i == 0) {/* save address for stats at 0 */
/* No allocator to give us word alignement */
segaddr = alignup_ptr(segaddr,8);
nb->stats0 = (stat_struct_t *) segaddr;
segaddr += sizeof(stat_struct_t)*nprocs;
}
if (myproc == i) {
topalloc = (uintptr_t) segaddr;
if (topalloc >= (uintptr_t) TEST_SEG(myproc) + TEST_SEGSZ) {
fprintf(stderr, "DIM %d too large for segment\n", nb->dimsz);
gasnet_exit(1);
}
}
}
}
void
ge_unpack(nbr_t *nb, double *src, size_t destp, int axis)
{
int n,i,j,k;
int dk = nb->dims[2];
int dj = nb->dims[1];
int di = nb->dims[0];
n=0;
switch (axis) {
case 0: /* X axis, yz plane, n * stride n */
for (k=0; k < dk; k++)
for (j = 0; j < dj; j++)
AREF(nb,k,j,destp) = src[n++];
break;
case 1: /* Y axis, xz plane, n * stride 1 */
for (k=0; k < dk; k++)
for (i=0; i < di; i++)
AREF(nb,k,destp,i) = src[n++];
break;
case 2: /* Z axis, xy plane, 1 * stride 1 */
break;
default:
break;
}
return;
}
/*
* if (axis == AALL), do all axis (full ghost exchange)
*/
void
ghostExchUPCMGOrig(nbr_t *nb, int iters, int axis_in, int pairwise_sync)
{
int i, j, axis;
int axis_tot;
uint64_t begin, end;
stat_struct_t stcomm3;
int axes[3];
gex_Event_t hput;
if (axis_in == AALL) {
axes[0] = 0; axes[1] = 1; axes[2] = 2;
axis_tot = 3;
init_stat(nb, &stcomm3, axis_in, nb->dimsz, (PX_SZ+PY_SZ+PZ_SZ)*sizeof(double)*2);
}
else {
axes[0] = axis_in;
axis_tot = 1;
init_stat(nb, &stcomm3, axis_in, nb->dimsz, nb->facesz[axis_in]*sizeof(double)*2);
}
BARRIER();
for (i = 0; i < iters; i++) {
begin = TIME();
for (j = 0; j < axis_tot; j++) {
axis = axes[j];
/* Send data to upper and lower nbr, in turn */
hput = ge_put(nb, GHOST_TYPE_PUT, GHOST_DIR_UPPER, axis, NULL);
if (hput != GEX_EVENT_INVALID) {
gex_Event_Wait(hput);
gex_Event_Wait( ge_notify(nb, GHOST_DIR_UPPER, axis) );
ge_wait(nb, GHOST_DIR_UPPER, axis);
}
hput = ge_put(nb, GHOST_TYPE_PUT, GHOST_DIR_LOWER, axis, NULL);
if (hput != GEX_EVENT_INVALID) {
gex_Event_Wait(hput);
gex_Event_Wait( ge_notify(nb, GHOST_DIR_LOWER, axis) );
ge_wait(nb, GHOST_DIR_LOWER, axis);
}
}
end = TIME();
BARRIER(); /* don't include the barrier time */
update_stat(&stcomm3, (end-begin), 1);
}
if (iters > 1) {
print_stat(nb, myproc, &stcomm3, "UPC-MG");
}
BARRIER();
return;
}
/*
* if (axis == AALL), do all axis (full ghost exchange)
*/
void
ghostExchUPCMG(nbr_t *nb, int iters, int axis_in, int pairwise_sync)
{
int i, j, axis;
int axis_tot;
uint64_t begin, end;
stat_struct_t stcomm3;
int axes[3];
gex_Event_t hput1, hput2;
if (axis_in == AALL) {
axes[0] = 0; axes[1] = 1; axes[2] = 2;
axis_tot = 3;
init_stat(nb, &stcomm3, axis_in, nb->dimsz, (PX_SZ+PY_SZ+PZ_SZ)*sizeof(double)*2);
}
else {
axes[0] = axis_in;
axis_tot = 1;
init_stat(nb, &stcomm3, axis_in, nb->dimsz, nb->facesz[axis_in]*sizeof(double)*2);
}
BARRIER();
for (i = 0; i < iters; i++) {
begin = TIME();
for (j = 0; j < axis_tot; j++) {
axis = axes[j];
/* Send data to upper and lower nbr, in turn */
hput1 = ge_put(nb, GHOST_TYPE_PUT, GHOST_DIR_UPPER, axis, NULL);
hput2 = ge_put(nb, GHOST_TYPE_PUT, GHOST_DIR_LOWER, axis, NULL);
if (hput1 != GEX_EVENT_INVALID) {
gex_Event_Wait(hput1);
gex_Event_Wait( ge_notify(nb, GHOST_DIR_UPPER, axis) );
}
if (hput2 != GEX_EVENT_INVALID) {
gex_Event_Wait(hput2);
gex_Event_Wait( ge_notify(nb, GHOST_DIR_LOWER, axis) );
}
if (hput1 != GEX_EVENT_INVALID)
ge_wait(nb, GHOST_DIR_LOWER, axis);
if (hput2 != GEX_EVENT_INVALID)
ge_wait(nb, GHOST_DIR_UPPER, axis);
}
end = TIME();
BARRIER(); /* don't include the barrier time */
update_stat(&stcomm3, (end-begin), 1);
}
if (iters > 1) {
print_stat(nb, myproc, &stcomm3, "UPC-MG");
}
BARRIER();
return;
}
/*
* Parry uses UPC-level shared directories to propagate the location of
* per-thread communication buffers.
*/
void
ghostExchGASNetNonBlock(nbr_t *nb, int iters, int axis_in, int pairwise_sync)
{
unsigned int i, j, axis, face;
volatile int *syncflag;
uint64_t begin, end;
stat_struct_t stcomm3;
gex_Event_t hput[2];
gex_Event_t sput[6];
int axes[3];
int axis_tot;
int sfaces, sfacedone[2];
int rfaces, rfacedone[2];
int sent;
if (axis_in == AALL) {
/* Here we start with axis 'z' since it's the contiguous one and will
* overlap subsequent non-contiguous axis that require packing */
axes[0] = 0; axes[1] = 1; axes[2] = 2;
axis_tot = 3;
init_stat(nb, &stcomm3, axis_in, nb->dimsz, (PX_SZ+PY_SZ+PZ_SZ)*sizeof(double)*2);
}
else {
axes[0] = axis_in;
axis_tot = 1;
init_stat(nb, &stcomm3, axis_in, nb->dimsz, nb->facesz[axis_in]*sizeof(double)*2);
}
BARRIER();
for (i = 0; i < iters; i++) {
sent = 0;
begin = TIME();
for (j = 0; j < axis_tot; j++) {
axis = axes[j];
/* Both lower and upper faces can proceed independently */
hput[1] = ge_put(nb, GHOST_TYPE_PUT, GHOST_DIR_LOWER, axis, NULL);
hput[0] = ge_put(nb, GHOST_TYPE_PUT, GHOST_DIR_UPPER, axis, NULL);
/* Mark locally completed puts as done */
rfacedone[0] = sfacedone[0] = (hput[0] == GEX_EVENT_INVALID);
rfacedone[1] = sfacedone[1] = (hput[1] == GEX_EVENT_INVALID);
rfaces = sfaces = sfacedone[0] + sfacedone[1];
/*
* Poll until either one of these conditions are fulfilled:
* 1. A notify is received (other proc is done with update)
* 2. A non-blocking put is completed.
*/
while (!(sfaces == 2 && rfaces == 2)) {
/* Any of upper or lower face is complete ? */
for (face=0; face<2; face++) {
if (rfacedone[face])
continue;
syncflag = NBR_SYNCADDR(nb->DirSync[myproc], axis, !face, 0);
if (*syncflag != 0) {
/* Unless the axis is contiguous, unpack data */
if (axis != AZ) {
ge_unpack(nb, nb->dimBufs[axis][face],
face ? nb->dims[axis]-1 : 0, axis);
}
*syncflag = 0;
rfacedone[face] = 1;
rfaces++;
}
}
/* Any of *our* ghost exchanges complete ? */
gasnet_AMPoll();
if (gex_Event_TestSome(hput, 2, 0) == GASNET_ERR_NOT_READY)
continue;
/* Which face has completed */
for (face=0; face<2; face++) {
/* Unless the face is done or not ready, skip it */
if (sfacedone[face] || hput[face] != GEX_EVENT_INVALID)
continue;
sput[sent] = ge_notify(nb, face ? GHOST_DIR_LOWER
: GHOST_DIR_UPPER, axis);
sfacedone[face] = 1;
sfaces++;
sent++;
}
/* Try to progress events in sput[] */
gasnet_AMPoll();
gex_Event_TestAll(sput, sent, 0);
}
/* When the loop ends, we've received face updates from both
* nbrs */
}
end = TIME();
update_stat(&stcomm3, (end-begin), 1);
/* We don't time the sync here since it's essentially free. The notify
* is simply a non-blocking signal, we don't care when it completes
* locally.
*/
gex_Event_WaitAll(sput, sent, 0);
BARRIER();
}
if (iters > 1) {
print_stat(nb, myproc, &stcomm3, "GASNet-NB");
}
BARRIER();
return;
}
/*
* Pairwise sync with nbrs.
*
* It's currently unused in all three versions of nbr exchanges.
*/
void
pairwise_signal_nbrs(nbr_t *nb, gex_Event_t *h_nbr, int axis_in, int phase)
{
int i, axis, axis_tot;
int axes[3];
int destup, destdown;
if (axis_in == AALL) {
axis_tot = 3;
axes[0] = 0; axes[1] = 1; axes[2] = 2;
}
else {
axis_tot = 1;
axes[0] = axis_in;
}
for (i = 0; i < axis_tot; i++) {
axis = axes[i];
destup = nb->nodeidUpper[axis];
destdown = nb->nodeidLower[axis];
h_nbr[i*2+0] = gex_RMA_PutNBVal(myteam, destup,
(void *) NBR_SYNCADDR(nb->DirSyncComm3[destup], axis, 1, phase),
1, sizeof(int), 0);
h_nbr[i*2+1] = gex_RMA_PutNBVal(myteam, destdown,
(void *) NBR_SYNCADDR(nb->DirSyncComm3[destdown], axis, 0, phase),
1, sizeof(int), 0);
}
}
void
pairwise_wait_nbrs(nbr_t *nb, gex_Event_t *h_nbr, int axis_in, int phase)
{
int i, axis, axis_tot;
int nfaces;
int faces = 0;
int axes[3];
volatile int *syncflag;
if (axis_in == AALL) {
nfaces = 6;
axes[0] = 0; axes[1] = 1; axes[2] = 2;
axis_tot = 3;
}
else {
nfaces = 2;
axes[0] = axis_in;
axis_tot = 1;
}
/* Reap our previous phase handles and poll on local signals */
gex_Event_WaitAll(h_nbr, nfaces, 0);
do {
faces = 0;
gasnet_AMPoll();
for (i = 0; i < axis_tot; i++) {
axis = axes[i];
syncflag = NBR_SYNCADDR(nb->DirSyncComm3[myproc], axis, 0, phase);
if (*syncflag) faces++;
syncflag = NBR_SYNCADDR(nb->DirSyncComm3[myproc], axis, 1, phase);
if (*syncflag) faces++;
}
} while (faces < nfaces);
/* Reset signal locations for current phase */
for (i = 0; i < axis_tot; i++) {
axis = axes[i];
syncflag = NBR_SYNCADDR(nb->DirSyncComm3[myproc], axis, 0, phase);
*syncflag = 0;
syncflag = NBR_SYNCADDR(nb->DirSyncComm3[myproc], axis, 1, phase);
*syncflag = 0;
}
}
void
ghostExchAMLong(nbr_t *nb, int iters, int axis_in)
{
int i, j, axis, axis_tot;
size_t maxmsg = 0;
int axes[3];
uint64_t begin, end;
stat_struct_t stcomm3;
if (axis_in == AALL) {
axes[0] = 0; axes[1] = 1; axes[2] = 2;
axis_tot = 3;
init_stat(nb, &stcomm3, axis_in, nb->dimsz, (PX_SZ+PY_SZ+PZ_SZ)*sizeof(double)*2);
}
else {
axes[0] = axis_in;
axis_tot = 1;
init_stat(nb, &stcomm3, axis_in, nb->dimsz, nb->facesz[axis_in]*sizeof(double)*2);
}
/* skip this test if dimensions are larger than AMLong. This test does not
* require global coordination since the dimensions are split up equally. */
for (i = 0; i < axis_tot; i++)
maxmsg = MAX(maxmsg, nb->facesz[i]*sizeof(double));
if (maxmsg > gex_AM_MaxRequestLong(myteam,GEX_RANK_INVALID,GEX_EVENT_NOW,0,2)) {
if (!myproc) {
printf("Skipping AMLong with dim=%d (%"PRIuPTR" > AMMaxLongRequest())\n",
nb->dimsz, (uintptr_t)maxmsg);
fflush(stdout);
}
return;
}
BARRIER();
for (i = 0; i < iters; i++) {
nb->amdims[0][0] = nb->amdims[0][1] =
nb->amdims[1][0] = nb->amdims[1][1] =
nb->amdims[2][0] = nb->amdims[2][1] = 0;
BARRIER();
begin = TIME();
for (j = 0; j < axis_tot; j++) {
axis = axes[j];
ge_put(nb, GHOST_TYPE_AMLONG, GHOST_DIR_UPPER, axis,
&nb->amdims[axis][0]);
ge_put(nb, GHOST_TYPE_AMLONG, GHOST_DIR_LOWER, axis,
&nb->amdims[axis][1]);
/* Wait until the face update is completed */
while (!(nb->amdims[axis][0] && nb->amdims[axis][1]))
gasnet_AMPoll();
nb->amdims[axis][0] = nb->amdims[axis][1] = 0;
}
end = TIME();
update_stat(&stcomm3, (end-begin), 1);
BARRIER();
}
if (iters > 1) {
print_stat(nb, myproc, &stcomm3, "AMLongAsync");
}
BARRIER();
return;
}
gex_Event_t
ge_put(nbr_t *nb, int type, int dir, int axis, int *flag)
{
int n=0,i,j,k;
int dk = nb->dims[2];
int dj = nb->dims[1];
int di = nb->dims[0];
double *src, *dest;
int srcp, destp;
size_t len;
gex_Rank_t node;
if (dir == GHOST_DIR_UPPER) {
node = nb->nodeidUpper[axis];
srcp = nb->dims[axis]-2;
destp = 0;
}
else { /* GHOST_DIR_LOWER */
node = nb->nodeidLower[axis];
srcp = 1;
destp = nb->dimsLower[axis]-1;
}
/* take care of both axes that require packing */
switch(axis) {
case AX:
if (node == myproc) {
for (k=0; k < dk; k++)
for (j=0; j < dj; j++)
AREF(nb,k,j,destp) = AREF(nb,k,j,srcp);
goto local_copy;
}
else {
for (k = 0; k < dk; k++)
for (j = 0; j < dj; j++)
nb->yzCommBuffer[n++] = AREF(nb,k,j,srcp);
src = nb->yzCommBuffer;
dest = (double *) nb->Diryz[node] + (destp!=0)*PX_SZ;
len = PX_SZ*sizeof(double);
/* send packed buf */
}
break;
case AY:
if (node == myproc) {
for (k = 0; k < dk; k++)
for (i = 0; i < di; i++)
AREF(nb,k,destp,i) = AREF(nb,k,srcp,i);
goto local_copy;
}
else {
for (k = 0; k < dk; k++)
for (i = 0; i < di; i++)
nb->xzCommBuffer[n++] = AREF(nb,k,srcp,i);
src = nb->xzCommBuffer;
dest = (double *) nb->Dirxz[node] + (destp!=0)*PY_SZ;
len = PY_SZ*sizeof(double);
/* send packed buf */
}
break;
case AZ:
src = (double *) nb->Ldata + srcp*dj*di;
dest = (double *) nb->Dir[node] + destp*PZ_SZ;
len = PZ_SZ*sizeof(double);
if (node == myproc) {
memcpy(dest,src,PZ_SZ*sizeof(double));
goto local_copy;
}
break;
default:
FATALERR("Unrecognized axis in ge_put");
}
if (type == GHOST_TYPE_AMLONG) {
/* By now, send an AMLong with data */
// TODO-EX: Restore "Async" nature of this when lc_opt=handle is supported
// TODO-EX: was "gasnet_AMRequestLongAsync2(node,hidx_ghostReqHandler,src,len,dest, axis,destp)"
gex_AM_RequestLong2(myteam,node,hidx_ghostReqHandler,src,len,dest,GEX_EVENT_NOW,0,axis,destp);
return GEX_EVENT_INVALID;
}
else {
return gex_RMA_PutNB(myteam, node, dest, src, len, GEX_EVENT_DEFER, 0);
}
local_copy:
if (type == GHOST_TYPE_AMLONG)
*flag = 1;
return GEX_EVENT_INVALID;
}
gex_Event_t
ge_notify(nbr_t *nb, int dir, int axis)
{
int islower = (dir == GHOST_DIR_LOWER);
int node = islower ? nb->nodeidLower[axis] : nb->nodeidUpper[axis];
volatile int *syncflag = NBR_SYNCADDR(nb->DirSync[node], axis, islower, 0);
if (node == myproc) {
*syncflag = 1;
return GEX_EVENT_INVALID;
}
else
return gex_RMA_PutNBVal(myteam, node, (void *)syncflag, 1, sizeof(int), 0);
}
void
ge_wait(nbr_t *nb, int dir, int axis)
{
int islower = (dir == GHOST_DIR_LOWER);
volatile int *syncaddr = NBR_SYNCADDR(nb->DirSync[myproc], axis, islower, 0);
int destp = islower ? nb->dims[axis]-1 : 0;
double *src = nb->dimBufs[axis][dir];
while (*syncaddr == 0)
{ gasnet_AMPoll(); }
/* Unless the axis is contiguous, unpack received data */
if (axis != AZ)
ge_unpack(nb, src, destp, axis);
*syncaddr = 0;
return;
}
|