Class mpi.Graphcomm
java.lang.Object
|
+----mpi.Comm
|
+----mpi.Intracomm
|
+----mpi.Graphcomm
- public class Graphcomm
- extends Intracomm
Method Summary
|
java.lang.Object
|
clone()
|
GraphParms
|
Get()
Returns graph topology information.
|
int
|
Map(int[] index,
int[] edges)
Compute an optimal placement.
|
int[]
|
Neighbours(int rank)
Provides adjacency information for general graph topology.
|
Methods inherited from class mpi.Intracomm
|
Allgather, Allgatherv, Allreduce, Alltoall, Alltoallv, Barrier, Bcast, clone, Creat, Create_cart, Create_graph, Gather, Gatherv, GetGraph, Reduce, Reduce_scatter, Scan, Scatter, Scatterv, Split |
Methods inherited from class mpi.Comm
|
Abort, Attr_delete, Attr_get, Attr_put, Bsend, Bsend_init, clone, Compare, Create_intercomm, dup, Errhandler_set, Errorhandler_get, Free, GetComm, GetIntercomm, Group, Ibsend, Iprobe, Irecv, Irsend, Isend, Issend, Pack, Pack_size, Probe, Rank, Recv, Recv_init, Rsend, Rsend_init, Send, Send_init, Sendrecv, Sendrecv_replace, Size, Ssend, Ssend_init, Test_inter, Topo_test, Unpack |
Methods inherited from class java.lang.Object
|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Graphcomm
public Graphcomm()
Graphcomm
public Graphcomm(long _handle)
Get
public GraphParms Get()
- Returns graph topology information.
returns: | object defining node degress and
edges of graph |
Java binding of the MPI operation MPI_GRAPHDIMS_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.
clone
public java.lang.Object clone()
- Overrides:
- clone in class Intracomm
Neighbours
public int[] Neighbours(int rank)
- Provides adjacency information for general graph topology.
rank | rank of a process in the group
of this communicator |
returns: | array of ranks of neighbouring
processes to one specified |
Java binding of the MPI operations MPI_GRAPH_NEIGHBOURS_COUNT
and MPI_GRAPH_NEIGHBOURS.
The number of neighbours can be extracted from the size of the result.
Map
public int Map(int[] index,
int[] edges)
- Compute an optimal placement.
index | node degrees |
edges | graph edges |
returns: | reordered rank of calling
process |
Java binding of the MPI operation MPI_GRAPH_MAP.
The number of nodes is taken to be size of the index argument.