Class GraphComm
-
Field Summary
Fields inherited from class mpi.Comm
handle, SELF, TYPE_SHARED, WORLD
-
Constructor Summary
Constructors -
Method Summary
Modifier and TypeMethodDescriptionclone()
Duplicates this communicator.dup()
Duplicates this communicator.dupWithInfo
(Info info) Duplicates this communicator with the info object used in the call.getDims()
Returns graph topology information.Gets the adjacency information for a distributed graph topology.int[]
getNeighbors
(int rank) Provides adjacency information for general graph topology.iDup()
Duplicates this communicator.int
map
(int[] index, int[] edges) Compute an optimal placement.Methods inherited from class mpi.Intracomm
accept, accept, closePort, connect, connect, create, createCart, createDistGraph, createDistGraph, createDistGraphAdjacent, createDistGraphAdjacent, createGraph, createGroup, exScan, exScan, iExScan, iExScan, iScan, iScan, lookupName, lookupName, openPort, openPort, publishName, publishName, scan, scan, spawn, spawnMultiple, split, splitType, unpublishName, unpublishName
Methods inherited from class mpi.Comm
abort, allGather, allGather, allGatherv, allGatherv, allReduce, allReduce, allToAll, allToAllv, allToAllw, barrier, bcast, bSend, bSendInit, callErrhandler, compare, createIntercomm, createKeyval, deleteAttr, disconnect, dup, dupWithInfo, free, freeKeyval, gather, gather, gatherv, gatherv, gatherv, getAttr, getErrhandler, getGroup, getInfo, getName, getRank, getRequest, getSize, getTopology, iAllGather, iAllGather, iAllGatherv, iAllGatherv, iAllReduce, iAllReduce, iAllToAll, iAllToAllv, iAllToAllw, 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
-
Constructor Details
-
GraphComm
- Throws:
MPIException
-
GraphComm
protected GraphComm(long[] commRequest)
-
-
Method Details
-
clone
Duplicates this communicator.Java binding of
MPI_COMM_DUP
.It is recommended to use
dup()
instead ofclone()
because the last can't throw anMPIException
. -
dup
Duplicates this communicator.Java binding of
MPI_COMM_DUP
.- Overrides:
dup
in classIntracomm
- Returns:
- copy of this communicator
- Throws:
MPIException
- Signals that an MPI exception of some sort has occurred.
-
iDup
Duplicates this communicator.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
.- Overrides:
iDup
in classIntracomm
- Returns:
- copy of this communicator
- Throws:
MPIException
- Signals that an MPI exception of some sort has occurred.
-
dupWithInfo
Duplicates this communicator with the info object used in the call.Java binding of
MPI_COMM_DUP_WITH_INFO
.- Overrides:
dupWithInfo
in classIntracomm
- Parameters:
info
- info object to associate with the new communicator- Returns:
- copy of this communicator
- Throws:
MPIException
- Signals that an MPI exception of some sort has occurred.
-
getDims
Returns graph topology information.Java binding of the MPI operations
MPI_GRAPHDIMS_GET
andMPI_GRAPH_GET
.The number of nodes and number of edges can be extracted from the sizes of the
index
andedges
fields of the returned object.- Returns:
- object defining node degress and edges of graph
- Throws:
MPIException
- Signals that an MPI exception of some sort has occurred.
-
getNeighbors
Provides adjacency information for general graph topology.Java binding of the MPI operations
MPI_GRAPH_NEIGHBORS_COUNT
andMPI_GRAPH_NEIGHBORS
.The number of neighbors can be extracted from the size of the result.
- Parameters:
rank
- rank of a process in the group of this communicator- Returns:
- array of ranks of neighbouring processes to one specified
- Throws:
MPIException
- Signals that an MPI exception of some sort has occurred.
-
getDistGraphNeighbors
Gets the adjacency information for a distributed graph topology.- Returns:
- adjacency information for a distributed graph topology
- Throws:
MPIException
- Signals that an MPI exception of some sort has occurred.
-
map
Compute an optimal placement.Java binding of the MPI operation
MPI_GRAPH_MAP
.The number of nodes is taken to be size of the
index
argument.- Parameters:
index
- node degreesedges
- graph edges- Returns:
- reordered rank of calling process
- Throws:
MPIException
- Signals that an MPI exception of some sort has occurred.
-