Point-to-point message passing, Computer Networking

Assignment Help:

In point-to-point message passing, single process sends/receives message to/from another process. There are four communication modes for sending a message:

i)    Buffered mode: Send can be started whether or not matching receives has been initiated, and send may finish before matching accept is initiated.

ii)  Synchronous mode: Send can be started whether or not matching receives has been initiated, but send will finished only after matching receives has been initiated.

iii) Ready mode: Send can be started only if matching receives has already been started.

iv)  Standard mode: May behave like either synchronous mode or buffered mode, depending on specific execution of MPI and availability of memory for buffer space.

MPI gives both blocking and non-blocking send and takes operations for all modes.

 Functions for a variety of communication modes:

Mode

Blocking

Non blocking

Standard

MPI_Send

MPI_Isend

Buffered

MPI_Bsend

MPI_Ibsend

Synchronous

MPI_Ssend

MPI_Issend

 Ready

MPI_Rsend

MPI_Irsend

MPI_Irecv and MPI_Recv are blocking and nonblocking functions for regardless of mode and receiving messages.

Besides send and receive functions, MPI gives some more useful functions for communications. Some of them are being given here.

MPI_Buffer_attach used to give buffer space for buffered mode. Nonblocking functions contain request argument used subsequently to determine whether requested operation has finished.

MPI_Test and MPI_Wait wait or test for completion of nonblocking communication.

MPI_Probe and MPI_Iprobe probe for incoming message without really receiving it. Information about message determined by probing can be used to decide how to take it.

MPI_Cancel cancels outstanding message demand, useful for cleanup at the end of a program or after major state of computation.


Related Discussions:- Point-to-point message passing

Calculate the modulation index and find the bandwidth, Consider a signal x(...

Consider a signal x(t) = 10 cos(2πfct + 4 cos 2πfmt). Assume frequency modulation. The message frequency fm = 2:3 kHz. Calculate the modulation index and find the bandwidth when

Debug igrp, As a system administrator, you require to debug igrp but are wo...

As a system administrator, you require to debug igrp but are worried that the "debug IP igrp transaction" command will flood the console. What is the command that you should use?

What is single-mode fiber, What is Single-mode fiber Single-mode fiber ...

What is Single-mode fiber Single-mode fiber is competent of higher bandwidth and greater cable run distances than multi-mode fiber. For the reason that of these characterist

Show the bidirectional transmission, Q. Show the Bidirectional Transmission...

Q. Show the Bidirectional Transmission? Bidirectional Transmission Each party must maintain S and R to track frames sent and expected Piggybacking hooking ACK wit

Repeater - network layer and routing, Repeater Repeater is  also named...

Repeater Repeater is  also named as active hub operates at physical  layer of OSI model. Repeater is an  electronic  device that simply regenerates the signal. Signals travell

Define directed path, QUESTION (a) Define what you understand by the fo...

QUESTION (a) Define what you understand by the following terms in Network Flows: i) UnDirected Path ii) Directed Path iii) Directed Cycle. iv) Tree In each of th

How does a token-passing protocol works, How does a Token-Passing Protocol ...

How does a Token-Passing Protocol works? The token-passing protocol relies on a control signal known as the token. A token is a 24-bit packet that circulates throughout the net

Ospf - open shortest path first , OSPF ( open Shortest Path First) Open...

OSPF ( open Shortest Path First) Open shortest  path first  is a routing  protocols  developed for internet protocols networks by the  interior  gateway protocols working group

Configuration and cable termination, how can I establish a home net work by...

how can I establish a home net work by using cables and wieless

Shortest path tree and minimum-spanning tree, We studied Dijkstra's link-st...

We studied Dijkstra's link-state routing algorithm for computing the unicast paths that are individually the shortest paths from the source to all destinations. The union of these

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