Mpi functions and environment, Computer Networking

Assignment Help:

MPI contains hundreds of functions, a small subset of which is enough for most practical purposes. We shall talk about some of them in this unit.

Functions for MPI Environment:

int MPI_Init ( int *argc, char ** argv)

    It initializes the MPI environment. By that, No MPI function can be called before MPI_Init.

int MPI_Finalize (void)

It stops the MPI environment.  No MPI function can be called after MPI_Finalize. Each MPI process belongs to one or more groups (also known as communicator). Every process is recognized by its rank (0 to group size -1) within the given group. Initially, all processes belong to a default group known as MPI_COMM_WORLD group. Additional groups can be produced by the user as and when needed.  Now, we shall learn some functions related to communicators.

int MPI_Comm_size (MPI_Comm comm,  int *size)

returns variable size that have number of processes in group comm.

int MPI_Comm_rank (MPI_Comm comm,  int *rank)

returns rank of calling process in group comm.

Functions for Message Passing:

MPI processes cannot share memory space and single process cannot directly access other process's variables. Therefore, they need some type of communication between themselves. In MPI environment this communication is in the kind of message passing. A message in MPI has the following fields:

msgaddr: It can be each address in the sender's address space and refers to location in memory where message data begins.

count:  Number of occurrence of data items of message datatype obtained in message.

datatype:  Type of data in message. This field is beneficial in the sense that MPI supports heterogeneous computing and the different nodes may interpret count field differently. For example, if the message have a strings of 2n characters (count =2n), some machines may interpret it have 2n characters and some containing n characters depending upon the storage allocated per character (1 or 2). The basic datatype in MPI having of all basic parts in C and Fortran with two additional types namely MPI_BYTE and MPI_PACKED. MPI_BYTE denotes a byte of 8 bits.

dest or source : Receiving process or Rank of sending in communicator.

tag: Identifier for definite message or type of message. It let the programmer to deal with the arrival of message in an orderly way, even if the arrival of the message is not orderly.

comm.: Communicator. It is an group of a process and object wrapping context .It is allocated by system instead of user.

The functions used for messaging passing are:

int MPI_Send(void *msgaddr, int count,  MPI_Datatype datatype, int dest, int tag, MPI_Comm comm.)

on return, msg can be reused instantly.

int MPI_Recv(void *msgaddr, int count,  MPI_Datatype datatype, int dest, int tag, MPI_Comm comm.)

on return, msg contains requested message.

MPI message passing may be either collective or point-to-point.


Related Discussions:- Mpi functions and environment

Which layer defines bit synchronization, Physical layers defines with synch...

Physical layers defines with synchronizing the 1s and 0s on the wire.

Error detection in lrc - performance, LRC - Performance Detects ev...

LRC - Performance Detects every burst errors up to length n (number of columns) If two bits in one data unit are damaged as well as two bits in exactly same positions

Classify different types of ip routing, INTERNETWORKING - TCP/IP 1. Sta...

INTERNETWORKING - TCP/IP 1. State the following terminologies: a) Node b) Router c) Host d) Subnet e) Network 2. What do you understand by IEEE 802 Local Area network 3.

Osi reference model - fundamentals of networks, OSI Reference  Model ...

OSI Reference  Model Normal 0 false false false EN-IN X-NONE X-NONE

Explain control frame of claim token, Control Frame: claim_token Co...

Control Frame: claim_token Consider first station turned on Station notices no tokens Sends claim_token No competitors, so makes a ring of just itself P

use dijkstras shortest-path algorithm compute short path, Consider the fol...

Consider the following network example. With the indicated link costs along each link in the figure, use Dijkstra's shortest-path algorithm to compute the shortest path from x to a

What is a link, What is a Link? A link refers to the connectivity among...

What is a Link? A link refers to the connectivity among two devices. It contains the type of cables and protocols used in order for single device to be able to communicate with

#incident response scenario, assignment is for incident response In this ...

assignment is for incident response In this final week, you will provide a short procedures document (2–3 pages) concerning the steps by which to prepare for and execute expert te

The ip addressing scheme, An Internet address (IP address) is a unique 32-b...

An Internet address (IP address) is a unique 32-bit binary number given to a host and used for all interaction with the host. Each packet transmit across an Internet contains the 3

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd