ibis.mpj
Class Graphcomm

java.lang.Object
  extended by ibis.mpj.Comm
      extended by ibis.mpj.Intracomm
          extended by ibis.mpj.Graphcomm

public class Graphcomm
extends Intracomm

Communicator for virtal graph topologies.


Method Summary
 Object clone()
          Duplicate this communicator.
 GraphParms get()
           NOT IMPLEMENTED YET.
 int map(int[] index, int[] edges)
           NOT IMPLEMENTED YET.
 int[] neighbours(int rank)
           NOT IMPLEMENTED YET.
 
Methods inherited from class ibis.mpj.Intracomm
allgather, allgatherv, allreduce, alltoall, alltoallv, barrier, bcast, create, createCart, createGraph, gather, gatherv, reduce, reduceScatter, scan, scatter, scatterv, split
 
Methods inherited from class ibis.mpj.Comm
abort, attrGet, bsend, bsendInit, compare, createIntercomm, free, group, ibsend, iprobe, irecv, irsend, isend, issend, pack, pack, packSize, probe, rank, recv, recvInit, rsend, rsendInit, send, sendInit, sendrecv, sendrecvReplace, size, ssend, ssendInit, testInter, topoTest, unpack
 
Methods inherited from class java.lang.Object
equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
 

Method Detail

clone

public Object clone()
Description copied from class: Comm
Duplicate this communicator. The new communicator is "congruent" to the old one, but has a differnt context.

Overrides:
clone in class Intracomm
Returns:
copy of this communicator

get

public GraphParms get()
               throws MPJException
NOT IMPLEMENTED YET. Returns graph topology information. The number of nodes and number of edges can be extracted from sizes of the index and edges arrays.

Returns:
graphparms object
Throws:
MPJException

neighbours

public int[] neighbours(int rank)
                 throws MPJException
NOT IMPLEMENTED YET. Provides adjcency information for general graph topology. The number of neighbours 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:
MPJException

map

public int map(int[] index,
               int[] edges)
        throws MPJException
NOT IMPLEMENTED YET. Comput an optimal placement. The number of nodes is taken to be size of the index argument.

Parameters:
index - node degrees
edges - graph edges
Returns:
reordered rank of calling process
Throws:
MPJException


The Ibis project