The following are collective functions that are invoked by all processes in the group associated with comm.
[] Rationale.
Note that there is a chicken-and-egg aspect to MPI in that a
communicator is needed to create a new communicator. The base
communicator for all MPI communicators is predefined outside of MPI,
and is MPI_COMM_WORLD. This model was arrived at after
considerable debate, and was chosen to increase ``safety'' of programs
written in MPI.
( End of rationale.)
MPI_COMM_DUP(comm, newcomm)
[ IN comm] communicator (handle)
[ OUT newcomm] copy of comm (handle)
int MPI_Comm_dup(MPI_Comm comm, MPI_Comm *newcomm)
MPI_COMM_DUP(COMM, NEWCOMM, IERROR)
INTEGER COMM, NEWCOMM, IERROR
MPI_COMM_DUP Duplicates the existing communicator comm with associated key values. For each key value, the respective copy callback function determines the attribute value associated with this key in the new communicator; one particular action that a copy callback may take is to delete the attribute from the new communicator. Returns in newcomm a new communicator with the same group, any copied cached information, but a new context (see section Functionality ).
[] Advice to users.
This operation is used to provide a parallel library call with a duplicate communication space that has the same properties as the original communicator. This includes any attributes (see below), and topologies (see chapter Process Topologies ). This call is valid even if there are pending point-to-point communications involving the communicator comm. A typical call might involve a MPI_COMM_DUP at the beginning of the parallel call, and an MPI_COMM_FREE of that duplicated communicator at the end of the call. Other models of communicator management are also possible.
This call applies to both intra- and inter-communicators.
( End of advice to users.)
[] Advice
to implementors.
One need not actually copy the group information, but only add a new reference
and increment the reference count. Copy on write can be used for the cached
information. ( End of advice to implementors.)
MPI_COMM_CREATE(comm, group, newcomm)
[ IN comm] communicator (handle)
[ IN group] Group, which is a subset of the group of
comm (handle)
[ OUT newcomm] new communicator (handle)
int MPI_Comm_create(MPI_Comm comm, MPI_Group group, MPI_Comm *newcomm)
MPI_COMM_CREATE(COMM, GROUP, NEWCOMM, IERROR)
INTEGER COMM, GROUP, NEWCOMM, IERROR
This function creates a new communicator newcomm with communication group defined by group and a new context. No cached information propagates from comm to newcomm. The function returns MPI_COMM_NULL to processes that are not in group. The call is erroneous if not all group arguments have the same value, or if group is not a subset of the group associated with comm. Note that the call is to be executed by all processes in comm, even if they do not belong to the new group. This call applies only to intra-communicators.
[] Rationale.
The requirement that the entire group of comm participate in the call stems from the following considerations:
MPI_COMM_CREATE provides a means to subset a group of processes for the
purpose of separate MIMD computation, with separate communication space.
newcomm, which emerges from MPI_COMM_CREATE can be used in
subsequent calls to MPI_COMM_CREATE (or other communicator
constructors) further to subdivide a computation into parallel
sub-computations. A more general service is provided by
MPI_COMM_SPLIT, below.
( End of advice to users.)
[] Advice
to implementors.
Since all processes calling MPI_COMM_DUP or
MPI_COMM_CREATE provide the same group argument, it
is theoretically possible to agree on a group-wide unique context with
no communication. However, local execution of these functions requires
use of a larger context name space and reduces error checking.
Implementations may strike various compromises between these
conflicting goals, such as bulk allocation of multiple contexts in one
collective operation.
Important: If new communicators are created without synchronizing the
processes involved then the communication system should be able to cope with
messages arriving in a context that has not yet been allocated at the
receiving process.
( End of advice to implementors.)
MPI_COMM_SPLIT(comm, color, key, newcomm)
[ IN comm] communicator (handle)
[ IN color] control of subset assignment (integer)
[ IN key] control of rank assigment (integer)
[ OUT newcomm] new communicator (handle)
int MPI_Comm_split(MPI_Comm comm, int color, int key, MPI_Comm *newcomm)
MPI_COMM_SPLIT(COMM, COLOR, KEY, NEWCOMM, IERROR)
INTEGER COMM, COLOR, KEY, NEWCOMM, IERROR
This function partitions the group associated with comm into disjoint subgroups, one for each value of color. Each subgroup contains all processes of the same color. Within each subgroup, the processes are ranked in the order defined by the value of the argument key, with ties broken according to their rank in the old group. A new communicator is created for each subgroup and returned in newcomm. A process may supply the color value MPI_UNDEFINED, in which case newcomm returns MPI_COMM_NULL. This is a collective call, but each process is permitted to provide different values for color and key.
A call to MPI_COMM_CREATE(comm, group, newcomm) is equivalent to
a call to
MPI_COMM_SPLIT(comm, color, key, newcomm),
where all
members of group provide color~ =~0 and
key~=~ rank in
group, and all processes that are not members of group provide
color~ =~ MPI_UNDEFINED.
The function MPI_COMM_SPLIT allows
more general partitioning of a group
into one or more subgroups with optional reordering.
This call applies only intra-communicators.
The value of color must be nonnegative.
[] Advice to users.
This is an extremely powerful mechanism for dividing a single communicating group of processes into k subgroups, with k chosen implicitly by the user (by the number of colors asserted over all the processes). Each resulting communicator will be non-overlapping. Such a division could be useful for defining a hierarchy of computations, such as for multigrid, or linear algebra.
Multiple calls to MPI_COMM_SPLIT can be used to overcome the requirement that any call have no overlap of the resulting communicators (each process is of only one color per call). In this way, multiple overlapping communication structures can be created. Creative use of the color and key in such splitting operations is encouraged.
Note that, for a fixed color, the keys need not be unique. It is MPI_COMM_SPLIT's responsibility to sort processes in ascending order according to this key, and to break ties in a consistent way. If all the keys are specified in the same way, then all the processes in a given color will have the relative rank order as they did in their parent group. (In general, they will have different ranks.)
Essentially, making the key value zero for all processes of a given color
means that one doesn't really care about the rank-order of the processes in
the new communicator.
( End of advice to users.)
[] Rationale.
color is restricted to be nonnegative, so as not to confict with the value assigned to MPI_UNDEFINED.
( End of rationale.)


Thanks for shopping at On-line Angular Book Store. This is your shopping cart. Here you can edit the items, go back to the store, clear the cart, or check out.
back to store clear cart
check out using PayPal


Select a character
Play!
Congratulations!
You won!
Play again
Game Over :(
Press spacebar to restart


Here is a summary of my background in coding/web developing experience.
In school I have learnt-
Creating this website has been one of my biggest, self assigned projects, and I have made it entirely on my own, with information gleamed off the internet.
In school I have learnt-
- C++
- mySQL database
- Networking
- python (Source website: https://www.w3schools.com/python/ )
- HTML (Source website: https://www.w3schools.com/html/ )
- CSS (Source website: https://www.w3schools.com/css/)
- PHP (Source: Various websites on the topic of form validation and storing inputted data in SQL database)
- flash (animation, basics)
- word
- excel
- powerpoint
Creating this website has been one of my biggest, self assigned projects, and I have made it entirely on my own, with information gleamed off the internet.