Modifier | Constructor and Description |
---|---|
protected |
GraphComm(long handle) |
protected |
GraphComm(long[] commRequest) |
Modifier and Type | Method and Description |
---|---|
GraphComm |
clone()
Duplicates this communicator.
|
GraphComm |
dup()
Duplicates this communicator.
|
GraphParms |
getDims()
Returns graph topology information.
|
DistGraphNeighbors |
getDistGraphNeighbors()
Gets the adjacency information for a distributed graph topology.
|
int[] |
getNeighbors(int rank)
Provides adjacency information for general graph topology.
|
GraphComm |
iDup()
Duplicates this communicator.
|
int |
map(int[] index,
int[] edges)
Compute an optimal placement.
|
accept, accept, closePort, connect, connect, create, createCart, createDistGraph, createDistGraph, createDistGraphAdjacent, createDistGraphAdjacent, createGraph, exScan, exScan, iExScan, iExScan, iScan, iScan, lookupName, lookupName, openPort, openPort, publishName, publishName, scan, scan, spawn, spawnMultiple, split, unpublishName, unpublishName
abort, allGather, allGather, allGatherv, allGatherv, allReduce, allReduce, allToAll, allToAllv, barrier, bcast, bSend, bSendInit, compare, createIntercomm, createKeyval, deleteAttr, disconnect, dup, free, freeKeyval, gather, gather, gatherv, gatherv, gatherv, getAttr, getErrhandler, getGroup, getInfo, getName, getRank, getRequest, getSize, getTopology, iAllGather, iAllGather, iAllGatherv, iAllGatherv, iAllReduce, iAllReduce, iAllToAll, iAllToAllv, iBarrier, iBcast, ibSend, iDup, iGather, iGather, iGatherv, iGatherv, iGatherv, iNeighborAllGather, iNeighborAllGatherv, iNeighborAllToAll, iNeighborAllToAllv, iProbe, iRecv, iReduce, iReduce, iReduceScatter, iReduceScatter, iReduceScatterBlock, iReduceScatterBlock, irSend, iScatter, iScatter, iScatterv, iScatterv, iScatterv, iSend, isInter, isNull, isSend, neighborAllGather, neighborAllGatherv, neighborAllToAll, neighborAllToAllv, pack, packSize, probe, recv, recvInit, reduce, reduce, reduceLocal, reduceScatter, reduceScatter, reduceScatterBlock, reduceScatterBlock, rSend, rSendInit, scatter, scatter, scatterv, scatterv, scatterv, send, sendInit, sendRecv, sendRecvReplace, setAttr, setErrhandler, setInfo, setName, setType, sSend, sSendInit, unpack
protected GraphComm(long handle) throws MPIException
MPIException
protected GraphComm(long[] commRequest)
public GraphComm clone()
Java binding of MPI_COMM_DUP
.
It is recommended to use dup()
instead of clone()
because the last can't throw an MPIException
.
public GraphComm dup() throws MPIException
Java binding of MPI_COMM_DUP
.
dup
in class Intracomm
MPIException
public GraphComm iDup() throws MPIException
The new communicator can't be used before the operation completes.
The request object must be obtained calling Comm.getRequest()
.
Java binding of MPI_COMM_IDUP
.
iDup
in class Intracomm
MPIException
public GraphParms getDims() throws MPIException
Java binding of the MPI operations MPI_GRAPHDIMS_GET
and MPI_GRAPH_GET
.
The number of nodes and number of edges can be extracted
from the sizes of the index
and edges
fields
of the returned object.
MPIException
public int[] getNeighbors(int rank) throws MPIException
Java binding of the MPI operations MPI_GRAPH_NEIGHBORS_COUNT
and MPI_GRAPH_NEIGHBORS
.
The number of neighbors can be extracted from the size of the result.
rank
- rank of a process in the group of this communicatorMPIException
public DistGraphNeighbors getDistGraphNeighbors() throws MPIException
MPIException
public int map(int[] index, int[] edges) throws MPIException
Java binding of the MPI operation MPI_GRAPH_MAP
.
The number of nodes is taken to be size of the index
argument.
index
- node degreesedges
- graph edgesMPIException