Home
last modified time | relevance | path

Searched refs:nvc (Results 1 – 3 of 3) sorted by relevance

/petsc/src/vec/vec/utils/
H A Dvinv.c677 PetscInt i, n, n2, bs, j, k, *bss = NULL, nv, jj, nvc; in VecStrideGatherAll() local
693 nvc = 0; in VecStrideGatherAll()
698 nvc += bss[i]; in VecStrideGatherAll()
700 …PetscCheck(nvc <= bs, PETSC_COMM_SELF, PETSC_ERR_ARG_INCOMP, "Number of subvectors in subvectors >… in VecStrideGatherAll()
701 if (nvc == bs) break; in VecStrideGatherAll()
768 PetscInt i, n, n2, bs, j, jj, k, *bss = NULL, nv, nvc; in VecStrideScatterAll() local
784 nvc = 0; in VecStrideScatterAll()
789 nvc += bss[i]; in VecStrideScatterAll()
791 …PetscCheck(nvc <= bs, PETSC_COMM_SELF, PETSC_ERR_ARG_INCOMP, "Number of subvectors in subvectors >… in VecStrideScatterAll()
792 if (nvc == bs) break; in VecStrideScatterAll()
/petsc/src/ksp/pc/impls/bddc/
H A Dbddcgraph.c194 PetscInt i, nfc, nec, nvc, *idx, *mark; in PCBDDCGraphGetCandidatesIS() local
214 nvc = 0; in PCBDDCGraphGetCandidatesIS()
226 nvc += graph->cptr[i + 1] - graph->cptr[i]; in PCBDDCGraphGetCandidatesIS()
233 if (VerticesIS) PetscCall(PetscMalloc1(nvc, &idx)); in PCBDDCGraphGetCandidatesIS()
259 nvc = 0; in PCBDDCGraphGetCandidatesIS()
265 idx[nvc] = graph->queue[j]; in PCBDDCGraphGetCandidatesIS()
266 nvc++; in PCBDDCGraphGetCandidatesIS()
271 PetscCall(PetscSortInt(nvc, idx)); in PCBDDCGraphGetCandidatesIS()
272 PetscCall(ISCreateGeneral(PETSC_COMM_SELF, nvc, idx, PETSC_OWN_POINTER, &ISForVertices)); in PCBDDCGraphGetCandidatesIS()
/petsc/doc/manual/
H A Dstreams.md146 - nvc -O3 -march=native
149 Fig. {any}`fig_streams` shows the achieved bandwidth for gcc, icc, icx, and nvc using MPI and OpenM…
169 …ides better performance. No significant dips occur with the OpenMP binding using icc, icx, and nvc;
191 :alt: STREAMS benchmark nvc
194 STREAMS benchmark nvc
220 - We do not have any explanation why the improvement in speedup for gcc, icx, and nvc slows down be…