Home
last modified time | relevance | path

Searched refs:npes (Results 1 – 25 of 435) sorted by relevance

12345678910>>...18

/dports/math/fftw3-float/fftw-3.3.9/mpi/
H A Dtestsched.c184 n = npes; in fill_comm_schedule()
189 n = npes + 1; in fill_comm_schedule()
192 add_pair_to_comm_schedule(sched, pe, npes % 2 == 0 ? npes - 1 : pe); in fill_comm_schedule()
214 n = npes; in fill1_comm_sched()
218 n = npes + 1; in fill1_comm_sched()
236 if (s != npes) { in fill1_comm_sched()
360 if (i != npes) { in check_comm_schedule()
414 if (npes < 10) in print_comm_schedule()
436 if (npes <= 0) { in main()
471 printf(" %*d", npes < 10 ? 1 : (npes < 100 ? 2 : 3), in main()
[all …]
/dports/math/fftw3/fftw-3.3.9/mpi/
H A Dtestsched.c184 n = npes; in fill_comm_schedule()
189 n = npes + 1; in fill_comm_schedule()
192 add_pair_to_comm_schedule(sched, pe, npes % 2 == 0 ? npes - 1 : pe); in fill_comm_schedule()
214 n = npes; in fill1_comm_sched()
218 n = npes + 1; in fill1_comm_sched()
236 if (s != npes) { in fill1_comm_sched()
360 if (i != npes) { in check_comm_schedule()
414 if (npes < 10) in print_comm_schedule()
436 if (npes <= 0) { in main()
471 printf(" %*d", npes < 10 ? 1 : (npes < 100 ? 2 : 3), in main()
[all …]
/dports/math/fftw3-long/fftw-3.3.9/mpi/
H A Dtestsched.c184 n = npes; in fill_comm_schedule()
189 n = npes + 1; in fill_comm_schedule()
192 add_pair_to_comm_schedule(sched, pe, npes % 2 == 0 ? npes - 1 : pe); in fill_comm_schedule()
214 n = npes; in fill1_comm_sched()
218 n = npes + 1; in fill1_comm_sched()
236 if (s != npes) { in fill1_comm_sched()
360 if (i != npes) { in check_comm_schedule()
414 if (npes < 10) in print_comm_schedule()
436 if (npes <= 0) { in main()
471 printf(" %*d", npes < 10 ? 1 : (npes < 100 ? 2 : 3), in main()
[all …]
/dports/math/fftw3-quad/fftw-3.3.9/mpi/
H A Dtestsched.c184 n = npes; in fill_comm_schedule()
189 n = npes + 1; in fill_comm_schedule()
192 add_pair_to_comm_schedule(sched, pe, npes % 2 == 0 ? npes - 1 : pe); in fill_comm_schedule()
214 n = npes; in fill1_comm_sched()
218 n = npes + 1; in fill1_comm_sched()
236 if (s != npes) { in fill1_comm_sched()
360 if (i != npes) { in check_comm_schedule()
414 if (npes < 10) in print_comm_schedule()
436 if (npes <= 0) { in main()
471 printf(" %*d", npes < 10 ? 1 : (npes < 100 ? 2 : 3), in main()
[all …]
/dports/math/fftw/fftw-2.1.5/mpi/
H A Dsched.c126 for (i = 0; i < npes; ++i) in free_comm_schedule()
168 if (npes % 2 == 0) in fill_comm_schedule()
169 n = npes; in fill_comm_schedule()
171 n = npes + 1; in fill_comm_schedule()
174 if (pe != npes - 1) in fill_comm_schedule()
186 if (pe_a != npes - 1 && pe_b != npes - 1) in fill_comm_schedule()
291 if (i != npes) { in check_comm_schedule()
352 if (i == npes) { in sort_comm_schedule()
387 if (j == npes) { in sort_comm_schedule()
404 if (npes < 10) in print_comm_schedule()
[all …]
H A Dtest_sched.c28 int npes = -1, sortpe = -1, steps; in main() local
31 npes = atoi(argv[1]); in main()
32 if (npes <= 0) { in main()
39 if (sortpe < 0 || sortpe >= npes) { in main()
45 if (npes != -1) { in main()
47 sched = make_comm_schedule(npes); in main()
58 print_comm_schedule(sched, npes); in main()
88 for (npes = 1; ; ++npes) { in main()
89 printf("npes = %d...",npes); in main()
97 fill_comm_schedule(sched,npes); in main()
[all …]
H A Dsched.h27 extern void free_comm_schedule(int **sched, int npes);
28 extern void empty_comm_schedule(int **sched, int npes);
29 extern int **make_comm_schedule(int npes);
30 extern void fill_comm_schedule(int **sched, int npes);
31 extern int check_comm_schedule(int **sched, int npes);
32 extern void invert_comm_schedule(int **sched, int npes);
33 extern void sort_comm_schedule(int **sched, int npes, int sort_pe);
34 extern void print_comm_schedule(int **sched, int npes);
/dports/math/fftw-float/fftw-2.1.5/mpi/
H A Dsched.c126 for (i = 0; i < npes; ++i) in free_comm_schedule()
168 if (npes % 2 == 0) in fill_comm_schedule()
169 n = npes; in fill_comm_schedule()
171 n = npes + 1; in fill_comm_schedule()
174 if (pe != npes - 1) in fill_comm_schedule()
186 if (pe_a != npes - 1 && pe_b != npes - 1) in fill_comm_schedule()
291 if (i != npes) { in check_comm_schedule()
352 if (i == npes) { in sort_comm_schedule()
387 if (j == npes) { in sort_comm_schedule()
404 if (npes < 10) in print_comm_schedule()
[all …]
H A Dtest_sched.c28 int npes = -1, sortpe = -1, steps; in main() local
31 npes = atoi(argv[1]); in main()
32 if (npes <= 0) { in main()
39 if (sortpe < 0 || sortpe >= npes) { in main()
45 if (npes != -1) { in main()
47 sched = make_comm_schedule(npes); in main()
58 print_comm_schedule(sched, npes); in main()
88 for (npes = 1; ; ++npes) { in main()
89 printf("npes = %d...",npes); in main()
97 fill_comm_schedule(sched,npes); in main()
[all …]
H A Dsched.h27 extern void free_comm_schedule(int **sched, int npes);
28 extern void empty_comm_schedule(int **sched, int npes);
29 extern int **make_comm_schedule(int npes);
30 extern void fill_comm_schedule(int **sched, int npes);
31 extern int check_comm_schedule(int **sched, int npes);
32 extern void invert_comm_schedule(int **sched, int npes);
33 extern void sort_comm_schedule(int **sched, int npes, int sort_pe);
34 extern void print_comm_schedule(int **sched, int npes);
/dports/math/parmgridgen/ParMGridGen-1.0/ParMGridGen/IMParMetis-2.0/ParMETISLib/
H A Dremap.c21 if (ctrl->npes != ctrl->nparts) in ReMapGraph()
65 npes = ctrl->npes; in ComputeTotalVReMap1()
69 order = (KeyValueType *)IMmalloc(sizeof(KeyValueType)*npes*npes, "ComputeTotalVReMap: order"); in ComputeTotalVReMap1()
91 for (i=1; i<npes; i++) { in ComputeTotalVReMap1()
101 idxset(npes, -1, map); in ComputeTotalVReMap1()
105 i = order[k].val/npes; in ComputeTotalVReMap1()
106 j = order[k].val%npes; in ComputeTotalVReMap1()
116 if (nmapped < npes) { in ComputeTotalVReMap1()
117 for (i=j=0; j<npes && nmapped<npes; j++) { in ComputeTotalVReMap1()
119 for (; i<npes; i++) { in ComputeTotalVReMap1()
[all …]
/dports/science/berkeleygw/BGW-2.0.0/MeanField/ParaBands/
H A Dkpoint_pool.f9023 integer :: npes = 0
52 this%npes = peinf%npes / this%npools
53 if (this%npes<1) then
54 this%npools = peinf%npes
55 this%npes = 1
63 ranks(:,1) = (/ (ii, ii = 0, this%npes-1) /) + this%ipool*this%npes
80 ranks = ranks + ipool*this%npes
89 ranks = ranks + ipool*this%npes
91 call blacs_gridmap(tmp_cntxt, ranks, this%npes, this%npes, 1) ! This will modify cntxt
98 npcol = this%npes/nprow
[all …]
/dports/math/parmetis/parmetis-4.0.3/libparmetis/
H A Dxyzpart.c74 idx_t npes=ctrl->npes, mype=ctrl->mype; in IRBinCoordinates() local
183 idx_t npes=ctrl->npes, mype=ctrl->mype; in RBBinCoordinates() local
306 idx_t i, j, k, nvtxs, nrecv, npes=ctrl->npes, mype=ctrl->mype, in SampleSort() local
325 allpicks = ikvwspacemalloc(ctrl, npes*npes); in SampleSort()
345 ikvsortii(npes*(npes-1), allpicks); in SampleSort()
350 for (i=1; i<npes; i++) in SampleSort()
476 idx_t npes=ctrl->npes, mype=ctrl->mype; in PseudoSampleSort() local
490 nlsamples = graph->gnvtxs/(npes*npes); in PseudoSampleSort()
491 if (nlsamples > npes) in PseudoSampleSort()
492 nlsamples = npes; in PseudoSampleSort()
[all …]
H A Dpspases.c24 idx_t i, npes, mype; in ParMETIS_SerialNodeND() local
32 npes = ctrl->npes; in ParMETIS_SerialNodeND()
35 if (!ispow2(npes)) { in ParMETIS_SerialNodeND()
67 sendcount = imalloc(npes, "PAROMETISS: sendcount"); in ParMETIS_SerialNodeND()
68 displs = imalloc(npes, "PAROMETISS: displs"); in ParMETIS_SerialNodeND()
69 for (i=0; i<npes; i++) { in ParMETIS_SerialNodeND()
103 idx_t npes = ctrl->npes, mype = ctrl->mype; in AssembleEntireGraph() local
108 gnvtxs = vtxdist[npes]; in AssembleEntireGraph()
121 for (i=0; i<npes; i++) { in AssembleEntireGraph()
138 for (i=1; i<npes+1; i++) in AssembleEntireGraph()
[all …]
H A Dmesh.c72 k = j/(npes-i); in ParMETIS_V3_Mesh2Dual()
126 iset(npes, 0, scounts); in ParMETIS_V3_Mesh2Dual()
132 ASSERT(pe < npes); in ParMETIS_V3_Mesh2Dual()
137 MAKECSR(i, npes, sdispl); in ParMETIS_V3_Mesh2Dual()
140 MAKECSR(i, npes, rdispl); in ParMETIS_V3_Mesh2Dual()
144 nrecv = rdispl[npes]/2; in ParMETIS_V3_Mesh2Dual()
155 for (i=0; i<npes; i++) { in ParMETIS_V3_Mesh2Dual()
179 iset(npes, 0, scounts); in ParMETIS_V3_Mesh2Dual()
202 MAKECSR(i, npes, sdispl); in ParMETIS_V3_Mesh2Dual()
205 nsend = sdispl[npes]; in ParMETIS_V3_Mesh2Dual()
[all …]
H A Dgkmpi.c140 MPI_Comm_size(comm, &npes); in gkMPI_Alltoallv()
147 for (i=0; i<npes; i++) { in gkMPI_Alltoallv()
157 for (i=0; i<npes; i++) { in gkMPI_Alltoallv()
181 MPI_Comm_size(comm, &npes); in gkMPI_Allgatherv()
186 for (i=0; i<npes; i++) { in gkMPI_Allgatherv()
194 for (i=0; i<npes; i++) { in gkMPI_Allgatherv()
216 MPI_Comm_size(comm, &npes); in gkMPI_Scatterv()
221 for (i=0; i<npes; i++) { in gkMPI_Scatterv()
229 for (i=0; i<npes; i++) { in gkMPI_Scatterv()
256 for (i=0; i<npes; i++) { in gkMPI_Gatherv()
[all …]
/dports/math/libmesh/libmesh-1.6.2/contrib/parmetis/libparmetis/
H A Dxyzpart.c74 idx_t npes=ctrl->npes, mype=ctrl->mype; in IRBinCoordinates() local
183 idx_t npes=ctrl->npes, mype=ctrl->mype; in RBBinCoordinates() local
306 idx_t i, j, k, nvtxs, nrecv, npes=ctrl->npes, mype=ctrl->mype, in SampleSort() local
325 allpicks = ikvwspacemalloc(ctrl, npes*npes); in SampleSort()
345 ikvsortii(npes*(npes-1), allpicks); in SampleSort()
350 for (i=1; i<npes; i++) in SampleSort()
476 idx_t npes=ctrl->npes, mype=ctrl->mype; in PseudoSampleSort() local
490 nlsamples = graph->gnvtxs/(npes*npes); in PseudoSampleSort()
491 if (nlsamples > npes) in PseudoSampleSort()
492 nlsamples = npes; in PseudoSampleSort()
[all …]
H A Dpspases.c24 idx_t i, npes, mype; in ParMETIS_SerialNodeND() local
32 npes = ctrl->npes; in ParMETIS_SerialNodeND()
35 if (!ispow2(npes)) { in ParMETIS_SerialNodeND()
67 sendcount = imalloc(npes, "PAROMETISS: sendcount"); in ParMETIS_SerialNodeND()
68 displs = imalloc(npes, "PAROMETISS: displs"); in ParMETIS_SerialNodeND()
69 for (i=0; i<npes; i++) { in ParMETIS_SerialNodeND()
103 idx_t npes = ctrl->npes, mype = ctrl->mype; in AssembleEntireGraph() local
108 gnvtxs = vtxdist[npes]; in AssembleEntireGraph()
121 for (i=0; i<npes; i++) { in AssembleEntireGraph()
138 for (i=1; i<npes+1; i++) in AssembleEntireGraph()
[all …]
H A Dmesh.c72 k = j/(npes-i); in ParMETIS_V3_Mesh2Dual()
126 iset(npes, 0, scounts); in ParMETIS_V3_Mesh2Dual()
132 ASSERT(pe < npes); in ParMETIS_V3_Mesh2Dual()
137 MAKECSR(i, npes, sdispl); in ParMETIS_V3_Mesh2Dual()
140 MAKECSR(i, npes, rdispl); in ParMETIS_V3_Mesh2Dual()
144 nrecv = rdispl[npes]/2; in ParMETIS_V3_Mesh2Dual()
155 for (i=0; i<npes; i++) { in ParMETIS_V3_Mesh2Dual()
179 iset(npes, 0, scounts); in ParMETIS_V3_Mesh2Dual()
202 MAKECSR(i, npes, sdispl); in ParMETIS_V3_Mesh2Dual()
205 nsend = sdispl[npes]; in ParMETIS_V3_Mesh2Dual()
[all …]
H A Dgkmpi.c140 MPI_Comm_size(comm, &npes); in gkMPI_Alltoallv()
147 for (i=0; i<npes; i++) { in gkMPI_Alltoallv()
157 for (i=0; i<npes; i++) { in gkMPI_Alltoallv()
181 MPI_Comm_size(comm, &npes); in gkMPI_Allgatherv()
186 for (i=0; i<npes; i++) { in gkMPI_Allgatherv()
194 for (i=0; i<npes; i++) { in gkMPI_Allgatherv()
216 MPI_Comm_size(comm, &npes); in gkMPI_Scatterv()
221 for (i=0; i<npes; i++) { in gkMPI_Scatterv()
229 for (i=0; i<npes; i++) { in gkMPI_Scatterv()
256 for (i=0; i<npes; i++) { in gkMPI_Gatherv()
[all …]
/dports/math/parmetis/parmetis-4.0.3/programs/
H A Dio.c24 idx_t npes, mype, ier; in ParallelReadGraph() local
40 if (mype == npes-1) { in ParallelReadGraph()
79 l = k/(npes-i); in ParallelReadGraph()
84 gkMPI_Bcast((void *)vtxdist, npes+1, IDX_T, npes-1, comm); in ParallelReadGraph()
99 gkMPI_Bcast((void *)vtxdist, npes+1, IDX_T, npes-1, comm); in ParallelReadGraph()
117 if (mype == npes-1) { in ParallelReadGraph()
190 if (mype == npes-1) { in ParallelReadGraph()
353 l = k/(npes-i); in ReadTestGraph()
555 l = k/(npes-i); in Mc_SerialReadGraph()
922 MPI_Bcast((void *)elmdist, npes+1, IDX_T, npes-1, comm); in ParallelReadMesh()
[all …]
H A Dotest.c23 idx_t mype, npes; in main() local
28 MPI_Comm_size(comm, &npes); in main()
61 MPI_Comm_size(comm, &npes); in TestParMetis()
85 for (nparts=2*npes; nparts>=npes/2 && nparts > 0; nparts = nparts/2) { in TestParMetis()
118 for (nparts=2*npes; nparts>=npes/2 && nparts > 0; nparts = nparts/2) { in TestParMetis()
170 nparts = npes; in TestParMetis()
193 nparts = npes; in TestParMetis()
213 nparts = npes; in TestParMetis()
246 for (nparts=2*npes; nparts>=npes/2; nparts = nparts/2) { in TestParMetis()
339 for (i=1; i<npes; i++) in ComputeRealCut()
[all …]
/dports/math/combblas/CombBLAS_beta_16_2/usort/include/usort/
H A DparUtils.tcc232 int npes; in Mpi_Allgather() local
548 int npes; in partitionW() local
956 if(partner>=npes) partner=npes-1; in HyperQuickSort()
1163 if(partner>=npes) partner=npes-1; in HyperQuickSort()
1291 if(kway>npes) kway = npes; in HyperQuickSort_kway()
1292 int blk_size=npes/kway; assert(blk_size*kway==npes); in HyperQuickSort_kway()
1470 if(kway>npes) kway = npes; in HyperQuickSort_kway()
1614 int npes; in sampleSort() local
1877 int npes; in sampleSort() local
2288 assert(!(npes & (npes-1))); in bitonicSort_binary()
[all …]
/dports/science/berkeleygw/BGW-2.0.0/BSE/
H A Ddistrib.f9055 peinf%nkpe=xct%nkpt_fi/peinf%npes
61 if (peinf%npes .le. xct%nkpt_fi) then
62 peinf%nblocks=xct%nkpt_fi/peinf%npes
100 SAFE_ALLOCATE(peinf%ikt, (peinf%npes))
101 SAFE_ALLOCATE(peinf%ibt, (peinf%npes))
113 ipe = mod(ipe,peinf%npes) + 1
129 ipe = mod(ipe,peinf%npes) + 1
188 Nplane = dNfft(3)/peinf%npes
190 Nplane = dNfft(3)/peinf%npes+1
253 if (peinf%npes.eq.1) then
[all …]
/dports/math/combblas/CombBLAS_beta_16_2/usort/src/
H A DparUtils.cpp22 int npes, rank; in splitCommBinary() local
26 MPI_Comm_size(orig_comm, &npes); in splitCommBinary()
40 for(int i=0; i<npes; i++) { in splitCommBinary()
71 int npes, rank; in splitCommBinaryNoFlip() local
75 MPI_Comm_size(orig_comm, &npes); in splitCommBinaryNoFlip()
89 for(int i = 0; i < npes; i++) { in splitCommBinaryNoFlip()
282 int npes; in AdjustCommunicationPattern() local
285 MPI_Comm_size(comm, &npes); in AdjustCommunicationPattern()
298 if (rank == npes-1) { in AdjustCommunicationPattern()
308 segment_p0[i] = (i*npes)/k; in AdjustCommunicationPattern()
[all …]

12345678910>>...18