Routines which handle dynamic processes, Computer Engineering

Assignment Help:

Q. Routines which handle dynamic processes?

number of routines which handle dynamic processes: 

  • int pvm_joingroup( char *group )

Enrolls calling process in a named group. group is a name of an existing group. Returns instance number. Instance numbers starts from 0 to number of group members minus 1. In PVM 3 a task can join more than one group. If a process leaves a group but then rejoins it that process may get a different instance number. 

  • int info = pvm_lvgroup( char *group )

Unenrolls calling process from a named group. 

  • int pvm_gettid( char *group, int inum )

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

  • int pvm_getinst( char *group, int tid )

Returns instance number in a group of PVM process. 

  • int size = pvm_gsize( char *group )

Returns number of members presently in named group. 

 int pvm_barrier( char *group, int count )

  Blocks calling process till all processes in a group have called it. count species the number of group members which must call pvm_barrier before they are all released.


Related Discussions:- Routines which handle dynamic processes

Digital electronics, design a ciruit which can work as a 4-bit binary adder...

design a ciruit which can work as a 4-bit binary adder as well as subtractor

Remote-load latency problem, Remote-load Latency Problem:  When one process...

Remote-load Latency Problem:  When one processor requires some remote loading of data by other nodes, then the processor need to wait for these two remote load operations. The long

Explain the numbering plan for isdn address structure, Explain the numberin...

Explain the numbering plan for ISDN address structure. The numbering plan for ISDN is evolved with using the following guidelines: 1. This is based on, and is an improvemen

Describe all elements of a state-chart diagram, a. Initial State: The first...

a. Initial State: The first or the default state the object is in. It is indicated by a solid circle. b. State: All the states an object can go in are mentioned in this. It is

Describe real and protected mode, Describe Real and protected mode: Op...

Describe Real and protected mode: Operation of Real mode interrupt:   When microprocessor completes executing the current instruction, it concludes whether an interrupt is act

Instruction pipelines, Instruction Pipelines As discussed previous, the...

Instruction Pipelines As discussed previous, the stream of instructions in the instruction implementation cycle, can be realized through a pipeline where overlapped implementat

How many two-input AND and OR gates are required to realize , How many two-...

How many two-input AND and OR gates are required to realize Y=CD+EF+G ? Ans. Y=CD+EF+G No. of two i/p AND gates=2 No. of two i/p OR gates = 2 One OR gate to OR CD and EF

What is analysis iteration, Analysis Iteration   To understand any prob...

Analysis Iteration   To understand any problem completely you have to repeat task which implies that analysis requires repetition. First, just get overview of problem, make a r

Hypothetical reliable data transfer protocol, the c code for hypothetical r...

the c code for hypothetical reliable data transfer protocol

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