Edit

Share via

MPI Process Topology Functions

  • Article

In this section

  • MPI_Cart_coords
    Determines process coords in cartesian topology given rank in group.

  • MPI_Cart_create
    Makes a new communicator to which topology information is being attached.

  • MPI_Cart_get
    Retrieves cartesian topology information associated with a communicator.

  • MPI_Cart_map
    Maps process to cartesian topology information.

  • MPI_Cart_rank
    Determines process rank in communicator by its cartesian location.

  • MPI_Cart_shift
    Returns the shifted source and destination ranks, given a shift direction and amount.

  • MPI_Cart_sub
    Partitions a communicator into subgroups that form lower-dimensional cartesian subgrids.

  • MPI_Cartdim_get
    Retrieves cartesian topology information associated with a communicator.

  • MPI_Dims_create
    Creates a division of processors in a cartesian grid.

  • MPI_Dist_graph_create
    Returns a handle to a new communicator to which the distributed graph topology information is attached.

  • MPI_Dist_graph_create_adjacent
    Returns a handle to a new communicator to which the distributed graph topology information is attached.

  • MPI_Dist_graph_neighbors
    Returns the list of neighbors having edges into and out of the calling process, as well as the corresponding weights on the incoming and outgoing edges in a distributed graph topology.

  • MPI_Dist_graph_neighbors_count
    Obtains adjacency information of the calling process in a distributed graph topology. The information that is obtained by this function, on the number of incoming edges, outgoing edges, and a flag indicating if the distributed graph is weighted, matches the information provided in the call to MPI_Dist_graph_create_adjacent or MPI_Dist_graph_create (by the calling process in the case of MPI_Dist_graph_create_adjacent, or potentially by processes other than the calling process in the case of MPI_Dist_graph_create).

  • MPI_Graph_create
    Makes a new communicator to which topology information is being attached.

  • MPI_Graph_get
    Retrieves graph topology information associated with a communicator.

  • MPI_Graph_map
    Maps process to graph topology information.

  • MPI_Graph_neighbors
    Returns the neighbors of a node associated with a graph topology.

  • MPI_Graph_neighbors_count
    Returns the number of neighbors of a node associated with a graph topology.

  • MPI_Graphdims_get
    Retrieves graph topology information associated with a communicator.