Man page or keyword search:   man All Sections 1 - General Commands 2 - System Calls 3 - Subroutines, Functions 4 - Special Files 5 - File Formats 6 - Games and Screensavers 7 - Macros and Conventions 8 - Maintenence Commands 9 - Kernel Interface New Commands Server 4.4BSD AIX Alpinelinux Archlinux Aros BSDOS BSDi Bifrost CentOS Cygwin Darwin Debian DigitalUNIX DragonFly ElementaryOS Fedora FreeBSD Gentoo GhostBSD HP-UX Haiku Hurd IRIX Inferno JazzOS Kali Knoppix LinuxMint MacOSX Mageia Mandriva Manjaro Minix MirBSD NeXTSTEP NetBSD OPENSTEP OSF1 OpenBSD OpenDarwin OpenIndiana OpenMandriva OpenServer OpenSuSE OpenVMS Oracle PC-BSD Peanut Pidora Plan9 QNX Raspbian RedHat Scientific Slackware SmartOS Solaris SuSE SunOS Syllable Tru64 UNIXv7 Ubuntu Ultrix UnixWare Xenix YellowDog aLinux   31559 pages apropos Keyword Search (all sections) Output format html ascii pdf view pdf save postscript

MPI_GRAPH_MAP(3)					      MPI_GRAPH_MAP(3)

NAME
     MPI_Graph_map - Maps a process to graph topology information

SYNOPSIS
     C:

	  #include <mpi.h>

	  int MPI_Graph_map ( comm, nnodes, index,
	  edges, newrank )
	  MPI_Comm comm;
	  int	   nnodes;
	  int	  *index;
	  int	  *edges;
	  int	  *newrank;

     C++:

	  #include <mpi.h>

	  int Graphcomm::Map(
	  int		    nnodes,
	  const int	    index[],
	  const int	    edges[]) const

     Fortran:

	  INCLUDE "mpif.h" (or USE MPI)

	  INTEGER comm, nnodes, index(*), edges(*), newrank, ierror

	  CALL MPI_GRAPH_MAP(comm, nnodes, index(*),  edges(*), newrank, ierror)

STANDARDS
     This release implements the MPI 1.2 standard, as documented by the MPI
     Forum in the spring 1997 release of MPI:  A Message Passing Interface
     Standard.

DESCRIPTION
     The MPI_Graph_map routine maps a process to graph topology information.
     This routine accepts the following parameters:

     comm      Specifies the input communicator (handle).

     nnodes    Specifies the number of graph nodes (integer).

     index     Specifies an integer array specifying the graph structure (see
	       MPI_Graph_create(3)).

									Page 1

MPI_GRAPH_MAP(3)					      MPI_GRAPH_MAP(3)

     edges     Specifies an integer array specifying the graph structure.

     newrank   Returns the reordered rank of the calling process.  If the
	       calling process does not belong to the graph, newrank returns
	       MPI_UNDEFINED (integer).

     ierror    Specifies the return code value for successful completion,
	       which is in MPI_SUCCESS.	 MPI_SUCCESS is defined in the mpif.h
	       file.

SEE ALSO
     MPI_Graph_create(3)

									Page 2

Vote for polarhome