/dports/net/mpich/mpich-3.4.3/src/mpi/coll/algorithms/treealgo/ |
H A D | treeutil.c | 29 ct->nranks = nranks; in MPII_Treeutil_tree_kary_init() 34 MPIR_Assert(nranks >= 0); in MPII_Treeutil_tree_kary_init() 36 if (nranks == 0) in MPII_Treeutil_tree_kary_init() 39 lrank = (rank + (nranks - root)) % nranks; in MPII_Treeutil_tree_kary_init() 46 if (val >= nranks) in MPII_Treeutil_tree_kary_init() 78 ct->nranks = nranks; in MPII_Treeutil_tree_knomial_1_init() 83 if (nranks == 0) in MPII_Treeutil_tree_knomial_1_init() 86 lrank = (rank + (nranks - root)) % nranks; in MPII_Treeutil_tree_knomial_1_init() 173 ct->nranks = nranks; in MPII_Treeutil_tree_knomial_2_init() 178 if (nranks <= 0) in MPII_Treeutil_tree_knomial_2_init() [all …]
|
/dports/net/mpich/mpich-3.4.3/src/mpi/coll/iallreduce/ |
H A D | iallreduce_tsp_ring_algos.h | 24 int nranks, is_inplace, rank; in MPIR_TSP_Iallreduce_sched_intra_ring() local 37 nranks = MPIR_Comm_size(comm); in MPIR_TSP_Iallreduce_sched_intra_ring() 47 for (i = 0; i < nranks; i++) in MPIR_TSP_Iallreduce_sched_intra_ring() 51 for (i = 0; i < nranks; i++) { in MPIR_TSP_Iallreduce_sched_intra_ring() 52 cnts[i] = (count + nranks - 1) / nranks; in MPIR_TSP_Iallreduce_sched_intra_ring() 61 for (i = 1; i < nranks; i++) in MPIR_TSP_Iallreduce_sched_intra_ring() 76 src = (nranks + rank - 1) % nranks; in MPIR_TSP_Iallreduce_sched_intra_ring() 77 dst = (rank + 1) % nranks; in MPIR_TSP_Iallreduce_sched_intra_ring() 79 for (i = 0; i < nranks - 1; i++) { in MPIR_TSP_Iallreduce_sched_intra_ring() 80 recv_rank = (nranks + rank - 2 - i) % nranks; in MPIR_TSP_Iallreduce_sched_intra_ring() [all …]
|
H A D | iallreduce_tsp_recexch_reduce_scatter_recexch_allgatherv_algos.h | 33 int nranks, rank; in MPIR_TSP_Iallreduce_sched_intra_recexch_reduce_scatter_recexch_allgatherv() local 54 nranks = MPIR_Comm_size(comm); in MPIR_TSP_Iallreduce_sched_intra_recexch_reduce_scatter_recexch_allgatherv() 69 if (nranks == 1) { in MPIR_TSP_Iallreduce_sched_intra_recexch_reduce_scatter_recexch_allgatherv() 77 MPII_Recexchalgo_get_neighbors(rank, nranks, &k, &step1_sendto, in MPIR_TSP_Iallreduce_sched_intra_recexch_reduce_scatter_recexch_allgatherv() 111 MPIR_CHKLMEM_MALLOC(cnts, int *, sizeof(int) * nranks, mpi_errno, "cnts", MPL_MEM_COLL); in MPIR_TSP_Iallreduce_sched_intra_recexch_reduce_scatter_recexch_allgatherv() 112 MPIR_CHKLMEM_MALLOC(displs, int *, sizeof(int) * nranks, mpi_errno, "displs", MPL_MEM_COLL); in MPIR_TSP_Iallreduce_sched_intra_recexch_reduce_scatter_recexch_allgatherv() 114 rem = nranks - p_of_k; in MPIR_TSP_Iallreduce_sched_intra_recexch_reduce_scatter_recexch_allgatherv() 116 for (i = 0; i < nranks; i++) in MPIR_TSP_Iallreduce_sched_intra_recexch_reduce_scatter_recexch_allgatherv() 126 for (i = 1; i < nranks; i++) { in MPIR_TSP_Iallreduce_sched_intra_recexch_reduce_scatter_recexch_allgatherv() 133 step2_nphases, step2_nbrs, rank, nranks, in MPIR_TSP_Iallreduce_sched_intra_recexch_reduce_scatter_recexch_allgatherv() [all …]
|
/dports/science/dakota/dakota-6.13.0-release-public.src-UI/packages/external/C3/benchmarks/dmrgprod/ |
H A D | dmrgprod.c | 40 size_t nranks = 40; in main() local 43 double * results = calloc_double(nranks*4); in main() 44 for (jj = 0; jj < nranks; jj++){ in main() 103 results[nranks+jj] = time; in main() 104 results[2*nranks+jj] = time2; in main() 105 results[3*nranks+jj] = mrank; in main() 134 size_t nranks = 20; in main() local 139 for (jj = 0; jj < nranks; jj++){ in main() 194 results[2*nranks+jj] = mrank; in main() 197 results[3*nranks+jj] = time2; in main() [all …]
|
/dports/net/mpich/mpich-3.4.3/src/mpi/coll/iallgather/ |
H A D | iallgather_tsp_recexch_algos.h | 13 int MPIR_TSP_Iallgather_sched_intra_recexch_data_exchange(int rank, int nranks, int k, int p_of_k, in MPIR_TSP_Iallgather_sched_intra_recexch_data_exchange() argument 26 partner = MPII_Recexchalgo_reverse_digits_step2(rank, nranks, k); in MPIR_TSP_Iallgather_sched_intra_recexch_data_exchange() 29 MPII_Recexchalgo_get_count_and_offset(rank, 0, k, nranks, &count, &offset); in MPIR_TSP_Iallgather_sched_intra_recexch_data_exchange() 39 MPII_Recexchalgo_get_count_and_offset(partner, 0, k, nranks, &count, &offset); in MPIR_TSP_Iallgather_sched_intra_recexch_data_exchange() 93 int **step2_nbrs, int rank, int nranks, int k, in MPIR_TSP_Iallgather_sched_intra_recexch_step2() argument 119 rank_for_offset = MPII_Recexchalgo_reverse_digits_step2(rank, nranks, k); in MPIR_TSP_Iallgather_sched_intra_recexch_step2() 135 rank_for_offset = MPII_Recexchalgo_reverse_digits_step2(nbr, nranks, k); in MPIR_TSP_Iallgather_sched_intra_recexch_step2() 183 MPIR_TSP_sched_isend(recvbuf, recvcount * nranks, recvtype, step1_recvfrom[i], in MPIR_TSP_Iallgather_sched_intra_recexch_step3() 208 int nranks, rank; in MPIR_TSP_Iallgather_sched_intra_recexch() local 230 nranks = MPIR_Comm_size(comm); in MPIR_TSP_Iallgather_sched_intra_recexch() [all …]
|
/dports/net/mpich/mpich-3.4.3/src/mpi/coll/ialltoallw/ |
H A D | ialltoallw_tsp_blocked_algos.h | 23 int nranks, rank; in MPIR_TSP_Ialltoallw_sched_intra_blocked() local 31 nranks = MPIR_Comm_size(comm); in MPIR_TSP_Ialltoallw_sched_intra_blocked() 35 bblock = nranks; in MPIR_TSP_Ialltoallw_sched_intra_blocked() 43 for (i = 0; i < nranks; i += bblock) { in MPIR_TSP_Ialltoallw_sched_intra_blocked() 44 comm_block = nranks - i < bblock ? nranks - i : bblock; in MPIR_TSP_Ialltoallw_sched_intra_blocked() 48 dst = (rank + j + i) % nranks; in MPIR_TSP_Ialltoallw_sched_intra_blocked() 60 dst = (rank - j - i + nranks) % nranks; in MPIR_TSP_Ialltoallw_sched_intra_blocked()
|
/dports/net/mpich/mpich-3.4.3/src/mpi/coll/iallgatherv/ |
H A D | iallgatherv_tsp_recexch_algos.h | 13 int MPIR_TSP_Iallgatherv_sched_intra_recexch_data_exchange(int rank, int nranks, int k, int p_of_k, in MPIR_TSP_Iallgatherv_sched_intra_recexch_data_exchange() argument 29 partner = MPII_Recexchalgo_reverse_digits_step2(rank, nranks, k); in MPIR_TSP_Iallgatherv_sched_intra_recexch_data_exchange() 33 MPII_Recexchalgo_get_count_and_offset(rank, 0, k, nranks, &count, &offset); in MPIR_TSP_Iallgatherv_sched_intra_recexch_data_exchange() 47 MPII_Recexchalgo_get_count_and_offset(partner, 0, k, nranks, &count, &offset); in MPIR_TSP_Iallgatherv_sched_intra_recexch_data_exchange() 133 rank_for_offset = MPII_Recexchalgo_reverse_digits_step2(rank, nranks, k); in MPIR_TSP_Iallgatherv_sched_intra_recexch_step2() 152 rank_for_offset = MPII_Recexchalgo_reverse_digits_step2(nbr, nranks, k); in MPIR_TSP_Iallgatherv_sched_intra_recexch_step2() 198 for (i = 0; i < nranks; i++) in MPIR_TSP_Iallgatherv_sched_intra_recexch_step3() 225 int nranks, rank; in MPIR_TSP_Iallgatherv_sched_intra_recexch() local 241 nranks = MPIR_Comm_size(comm); in MPIR_TSP_Iallgatherv_sched_intra_recexch() 253 if (nranks == 1) { /*If only one rank, copy sendbuf to recvbuf and return */ in MPIR_TSP_Iallgatherv_sched_intra_recexch() [all …]
|
H A D | iallgatherv_tsp_ring_algos.h | 24 int nranks, is_inplace, rank; in MPIR_TSP_Iallgatherv_sched_intra_ring() local 34 nranks = MPIR_Comm_size(comm); in MPIR_TSP_Iallgatherv_sched_intra_ring() 50 for (i = 1; i < nranks; i++) { in MPIR_TSP_Iallgatherv_sched_intra_ring() 76 src = (nranks + rank - 1) % nranks; in MPIR_TSP_Iallgatherv_sched_intra_ring() 77 dst = (rank + 1) % nranks; in MPIR_TSP_Iallgatherv_sched_intra_ring() 84 for (i = 0; i < nranks - 1; i++) { in MPIR_TSP_Iallgatherv_sched_intra_ring() 85 recv_rank = (rank - i - 1 + nranks) % nranks; /* Rank whose data you're receiving */ in MPIR_TSP_Iallgatherv_sched_intra_ring() 86 send_rank = (rank - i + nranks) % nranks; /* Rank whose data you're sending */ in MPIR_TSP_Iallgatherv_sched_intra_ring()
|
/dports/net/mpich/mpich-3.4.3/src/mpi/coll/ialltoallv/ |
H A D | ialltoallv_tsp_blocked_algos.h | 24 int nranks, rank; in MPIR_TSP_Ialltoallv_sched_intra_blocked() local 38 nranks = MPIR_Comm_size(comm); in MPIR_TSP_Ialltoallv_sched_intra_blocked() 52 bblock = nranks; in MPIR_TSP_Ialltoallv_sched_intra_blocked() 55 for (i = 0; i < nranks; i += bblock) { in MPIR_TSP_Ialltoallv_sched_intra_blocked() 56 comm_block = nranks - i < bblock ? nranks - i : bblock; in MPIR_TSP_Ialltoallv_sched_intra_blocked() 60 dst = (rank + j + i) % nranks; in MPIR_TSP_Ialltoallv_sched_intra_blocked() 68 dst = (rank - j - i + nranks) % nranks; in MPIR_TSP_Ialltoallv_sched_intra_blocked()
|
/dports/net/mpich2/mpich2-1.5/src/armci/tests/ |
H A D | test_puts_gets_dla.c | 15 int i, j, rank, nranks, peer, bufsize, errors; in main() local 24 MPI_Comm_size(MPI_COMM_WORLD, &nranks); in main() 26 shr_bvec = (double **) malloc(sizeof(double *) * nranks); in main() 27 src_bvec = (double **) malloc(sizeof(double *) * nranks); in main() 28 dst_bvec = (double **) malloc(sizeof(double *) * nranks); in main() 50 peer = (rank+1) % nranks; in main() 85 const double expected = (1.0 + rank) + (1.0 + ((rank+nranks-1)%nranks)) + (ITERATIONS); in main()
|
H A D | test_accs_dla.c | 15 int i, j, rank, nranks, peer, bufsize, errors, total_errors; in main() local 24 MPI_Comm_size(MPI_COMM_WORLD, &nranks); in main() 26 buf_bvec = (double **) malloc(sizeof(double *) * nranks); in main() 27 src_bvec = (double **) malloc(sizeof(double *) * nranks); in main() 60 peer = (rank+1) % nranks; in main() 84 … const double expected = (1.0 + rank) + scaling * (1.0 + ((rank+nranks-1)%nranks)) * (ITERATIONS); in main()
|
H A D | test_puts.c | 15 int i, j, rank, nranks, peer, bufsize, errors; in main() local 23 MPI_Comm_size(MPI_COMM_WORLD, &nranks); in main() 25 buffer = (double **) malloc(sizeof(double *) * nranks); in main() 43 peer = (rank+1) % nranks; in main() 67 const double expected = (1.0 + rank) + (1.0 + ((rank+nranks-1)%nranks)) + (ITERATIONS); in main()
|
H A D | test_puts_gets.c | 15 int i, j, rank, nranks, peer, bufsize, errors; in main() local 23 MPI_Comm_size(MPI_COMM_WORLD, &nranks); in main() 25 buffer = (double **) malloc(sizeof(double *) * nranks); in main() 44 peer = (rank+1) % nranks; in main() 77 const double expected = (1.0 + rank) + (1.0 + ((rank+nranks-1)%nranks)) + (ITERATIONS); in main()
|
H A D | test_accs.c | 15 int i, j, rank, nranks, peer, bufsize, errors, total_errors; in main() local 24 MPI_Comm_size(MPI_COMM_WORLD, &nranks); in main() 26 buffer = (double **) malloc(sizeof(double *) * nranks); in main() 56 peer = (rank+1) % nranks; in main() 80 … const double expected = (1.0 + rank) + scaling * (1.0 + ((rank+nranks-1)%nranks)) * (ITERATIONS); in main()
|
/dports/math/vtk8/VTK-8.2.0/IO/ParallelXML/Testing/Python/ |
H A D | testParallelMultiBlockWriter.py | 11 nranks = 1 variable 14 nranks = contr.GetNumberOfProcesses() 92 writer.SetInputDataObject(createMB(rank, nranks)) 107 expected_file_count = nranks + nranks + (nranks*nranks)
|
/dports/math/vtk9/VTK-9.1.0/IO/ParallelXML/Testing/Python/ |
H A D | testParallelMultiBlockWriter.py | 11 nranks = 1 variable 14 nranks = contr.GetNumberOfProcesses() 107 writer.SetInputDataObject(createMB(rank, nranks)) 122 expected_file_count = nranks + nranks + 2*(nranks*nranks)
|
/dports/net/mpich/mpich-3.4.3/src/mpi/coll/ireduce_scatter/ |
H A D | ireduce_scatter_tsp_recexch_algos.h | 50 int rank, int nranks, int sink_id, in MPIR_TSP_Ireduce_scatter_sched_intra_recexch_step2() argument 79 (is_dist_halving) ? MPII_Recexchalgo_reverse_digits_step2(dst, nranks, k) : dst; in MPIR_TSP_Ireduce_scatter_sched_intra_recexch_step2() 80 MPII_Recexchalgo_get_count_and_offset(rank_for_offset, phase, k, nranks, ¤t_cnt, in MPIR_TSP_Ireduce_scatter_sched_intra_recexch_step2() 95 (is_dist_halving) ? MPII_Recexchalgo_reverse_digits_step2(rank, nranks, k) : rank; in MPIR_TSP_Ireduce_scatter_sched_intra_recexch_step2() 143 int nranks, rank, p_of_k, T; in MPIR_TSP_Ireduce_scatter_sched_intra_recexch() local 160 nranks = MPIR_Comm_size(comm); in MPIR_TSP_Ireduce_scatter_sched_intra_recexch() 169 for (i = 0; i < nranks; i++) { in MPIR_TSP_Ireduce_scatter_sched_intra_recexch() 177 MPIR_CHKLMEM_MALLOC(displs, int *, nranks * sizeof(int), in MPIR_TSP_Ireduce_scatter_sched_intra_recexch() 180 for (i = 1; i < nranks; i++) { in MPIR_TSP_Ireduce_scatter_sched_intra_recexch() 185 if (nranks == 1) { in MPIR_TSP_Ireduce_scatter_sched_intra_recexch() [all …]
|
/dports/net/mpich/mpich-3.4.3/src/mpi/topo/ |
H A D | cart_map.c | 30 int rank, nranks, i, size, mpi_errno = MPI_SUCCESS; in MPIR_Cart_map() local 36 nranks = 1; in MPIR_Cart_map() 38 nranks = dims[0]; in MPIR_Cart_map() 40 nranks *= dims[i]; in MPIR_Cart_map() 45 MPIR_ERR_CHKANDJUMP2(size < nranks, mpi_errno, MPI_ERR_DIMS, "**topotoolarge", in MPIR_Cart_map() 46 "**topotoolarge %d %d", size, nranks); in MPIR_Cart_map() 50 if (rank < nranks) in MPIR_Cart_map()
|
/dports/net/mpich2/mpich2-1.5/src/mpi/topo/ |
H A D | cart_map.c | 34 int rank, nranks, i, size, mpi_errno = MPI_SUCCESS; in MPIR_Cart_map() local 40 nranks = 1; in MPIR_Cart_map() 42 nranks = dims[0]; in MPIR_Cart_map() 44 nranks *= dims[i]; in MPIR_Cart_map() 49 MPIU_ERR_CHKANDJUMP2(size < nranks, mpi_errno, MPI_ERR_DIMS, "**topotoolarge", in MPIR_Cart_map() 50 "**topotoolarge %d %d", size, nranks); in MPIR_Cart_map() 54 if ( rank < nranks ) in MPIR_Cart_map()
|
/dports/net/mpich/mpich-3.4.3/test/mpi/datatype/ |
H A D | concurrent_irecv.c | 18 int errs = 0, nranks, rank, i, j, r = 0; in main() local 23 MPI_Comm_size(MPI_COMM_WORLD, &nranks); in main() 24 if (nranks != 3) in main() 27 MPI_Request reqs[nranks - 1]; in main() 39 MPI_Waitall(nranks - 1, reqs, MPI_STATUSES_IGNORE); in main()
|
/dports/net/openmpi3/openmpi-3.1.6/ompi/mca/osc/pt2pt/ |
H A D | osc_pt2pt_sync.c | 55 …inline bool ompi_osc_pt2pt_sync_array_peer (int rank, ompi_osc_pt2pt_peer_t **peers, size_t nranks, in ompi_osc_pt2pt_sync_array_peer() argument 58 int mid = nranks / 2; in ompi_osc_pt2pt_sync_array_peer() 61 if (0 == nranks || (1 == nranks && peers[0]->rank != rank)) { in ompi_osc_pt2pt_sync_array_peer() 77 return ompi_osc_pt2pt_sync_array_peer (rank, peers + mid, nranks - mid, peer); in ompi_osc_pt2pt_sync_array_peer()
|
/dports/net/openmpi/openmpi-4.1.1/ompi/mca/osc/rdma/ |
H A D | osc_rdma_sync.c | 51 …c inline bool ompi_osc_rdma_sync_array_peer (int rank, ompi_osc_rdma_peer_t **peers, size_t nranks, in ompi_osc_rdma_sync_array_peer() argument 54 int mid = nranks / 2; in ompi_osc_rdma_sync_array_peer() 57 if (0 == nranks || (1 == nranks && peers[0]->rank != rank)) { in ompi_osc_rdma_sync_array_peer() 69 return ompi_osc_rdma_sync_array_peer (rank, peers + mid, nranks - mid, peer); in ompi_osc_rdma_sync_array_peer()
|
/dports/net/openmpi/openmpi-4.1.1/ompi/mca/osc/pt2pt/ |
H A D | osc_pt2pt_sync.c | 55 …inline bool ompi_osc_pt2pt_sync_array_peer (int rank, ompi_osc_pt2pt_peer_t **peers, size_t nranks, in ompi_osc_pt2pt_sync_array_peer() argument 58 int mid = nranks / 2; in ompi_osc_pt2pt_sync_array_peer() 61 if (0 == nranks || (1 == nranks && peers[0]->rank != rank)) { in ompi_osc_pt2pt_sync_array_peer() 77 return ompi_osc_pt2pt_sync_array_peer (rank, peers + mid, nranks - mid, peer); in ompi_osc_pt2pt_sync_array_peer()
|
/dports/net/openmpi3/openmpi-3.1.6/ompi/mca/osc/rdma/ |
H A D | osc_rdma_sync.c | 53 …c inline bool ompi_osc_rdma_sync_array_peer (int rank, ompi_osc_rdma_peer_t **peers, size_t nranks, in ompi_osc_rdma_sync_array_peer() argument 56 int mid = nranks / 2; in ompi_osc_rdma_sync_array_peer() 59 if (0 == nranks || (1 == nranks && peers[0]->rank != rank)) { in ompi_osc_rdma_sync_array_peer() 71 return ompi_osc_rdma_sync_array_peer (rank, peers + mid, nranks - mid, peer); in ompi_osc_rdma_sync_array_peer()
|
/dports/net/mpich2/mpich2-1.5/src/armci/tests/mpi/ |
H A D | test_mpi_accs.c | 14 int itr, i, j, rank, nranks, peer, bufsize, errors = 0; in main() local 21 MPI_Comm_size(MPI_COMM_WORLD, &nranks); in main() 37 peer = (rank+1) % nranks; in main() 57 const double expected = (1.0 + rank) + (1.0 + ((rank+nranks-1)%nranks)) * (ITERATIONS); in main()
|