Dynamic process groups in parallel virtual machine , Computer Networking

Dynamic Process Groups

To generate and manage dynamic groups, a separate library libgpvm3.a must be connected with the user programs that make use of any of the set functions. Group management work is handled by a group server that is automatically in progress when the first group function is invoked. Any PVM task can connect or leave any group dynamically at any time without having to inform any other task in the affected groups. Tasks can shows messages to groups of which they are not members. Now we are giving some routines that manage dynamic processes:

  • int pvm_joingroup( char *group )

Enrolls the calling process in a named group. group is a group name of an presenting group. Returns instance number. Instance numbers run from 0 to the number of group members minus 1. In PVM 3, a task can connect multiple groups. If a process departs a group and then rejoins it, that process may receive a dissimilar instance number.

  • int info = pvm_lvgroup( char *group )

   Unenrolls the calling process from a named group.

  • int pvm_gettid( char *group, int inum )

Returns the tid of the process recognized by a group name and instance number.

  • int pvm_getinst( char *group, int tid )

Returns the instance number in a set of a PVM process.

  • int size = pvm_gsize( char *group )

Returns the number of members at present in the named group.

  • int pvm_barrier( char *group, int count )

Blocks the calling process up to all the processes in a group has called it. count shows the number of group members that must call pvm_barrier before they are all released.

  • int pvm_bcast( char *group, int msgtag )

Transmits the data in the active message buffer to a group of processes. msgtag is a message tag supplied by the user. It agree to the user's program to distinguish between dissimilar kinds of messages .It should be a nonnegative integer.

  • int info = pvm_reduce( void (*func)(), void *data, int count, int datatype, int msgtag, char *group, int rootginst)

 Performs a decrease operation over members of the particular group. func is function defining the operation performed on the global data. Predefined are, PvmMin, PvmMax ,PvmSum and PvmProduct. Users can describe their own function. data is pointer to the starting address of an array of local values. count shows the number of elements of datatype in the data array. Datatype is the kind of the entries in the data array. msgtag is the message tag supplied by the user. msgtag should be greater than 0. It allows the user's program to distinguish between different kinds of messages. group is the group name of an existing group. rootginst is the illustration number of group member who gets the result.

We are writing here programs that shows the use of these functions in the parallel programming:

Example 2: Hello.c

#include "pvm3.h" main()

{

int cc, tid, msgtag;

char buf[100];

printf("%x\n", pvm_mytid());

cc = pvm_spawn("hello_other", (char**)0, 0, "", 1, &tid);

if (cc == 1) {

msgtag = 1;

pvm_recv(tid, msgtag);

pvm_upkstr(buf);

printf("from t%x: %s\n", tid, buf);

} else

printf("can't start hello_other\n");

pvm_exit();

}

In this program, pvm_mytid( ), returns the TID of the running program (In this case, task id of the program hello.c). This program is intended to be invoked by hand; after printing its task id (obtained with pvm_mytid()), it starts a copy of another program called hello_other using the pvm_spawn() function. A successful spawn happens the program to implement a blocking receive using pvm_recv. After getting the message, the program prints the message sent by its counterpart, as well its task id; the buffer is take out from the message using pvm_upkstr. The final pvm_exit call dissociates the program from the PVM system.

hello_other.c

#include "pvm3.h"

main()

{

int ptid, msgtag;

char buf[100];

ptid = pvm_parent();

strcpy(buf, "hello, world from ");

gethostname(buf + strlen(buf), 64);

msgtag = 1; pvm_initsend(PvmDataDefault); pvm_pkstr(buf);

pvm_send(ptid, msgtag);

pvm_exit();

}

Program is a listing of the ''slave'' or spawned program; its first PVM action is to get the task id of the ''master'' using the pvm_parent call. This program then gets its hostname and transfers it to the master using the three-call sequence - pvm_initsend to initialize the send buffer; pvm_pkstr to place a string, architecture-independent manner and in a strongly typed, into the send buffer; and pvm_send to trasnfer it to the destination process shows by ptid, ''tagging'' the message with the number1.

Posted Date: 3/2/2013 7:30:28 AM | Location : United States







Related Discussions:- Dynamic process groups in parallel virtual machine , Assignment Help, Ask Question on Dynamic process groups in parallel virtual machine , Get Answer, Expert's Help, Dynamic process groups in parallel virtual machine Discussions

Write discussion on Dynamic process groups in parallel virtual machine
Your posts are moderated
Related Questions
Encoding Process c= uG u: binary data sequence of length 4( input) G: Generator matrix which is 7*4 c: Codeword     D

TCP creates a reliable data transfer service, in addition to IP''s unreliable best-effort service. Study the related sections of the text, and in your own words, summarize how TCP

Solve the following CPM/PERT Network Analysis problem: Given the following network and activity time estimates, determine earliest and latest activity times, slack, the expecte

Question : a) What does association refer to in IEEE 802.11? b) State the fundamental principles of 3GPP security. c) Explain the term "binding" in Mobile IPv6 d)

With a transaction server, the client requests remote procedures that reside on the server with an SQL database engine. These remote processes on the server execute a group of SQL

A stored procedure is a named collection of SQL statements and procedural logic that is compiled, verified and kept in a server database. It is typically treated like any other dat

The science and art of manipulating messages in order to create them secure is known as cryptography..... Two types are:- Symmetric key cryptography and Asymmetric key crypto

Types of VTs There are  several  option for  payload are actually mapped into the VT.  Locked mode VTs  bypass the pointers with a fixed  byte oriented mapping of limited flexi

Radio Waves - Frequency ranges: 3 KHz to 1 GHz - Omni directional - Susceptible to interference by other antennas utilizing same frequency or band - Ideal for long-di