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

Illustrate character coded data, Q. Illustrate Character Coded Data? Th...

Q. Illustrate Character Coded Data? The input output happens in the form of ASCII data. These ASCII characters are entered as a string of data. For illustration to get two numb

An example of two stages network have switching elements, For two stages ne...

For two stages network the switching elements for M inlets with r blocks and N outlets with s blocks is given by (A) Ms + Nr                                (B)  Mr + Ns (

What is branch folding, What is branch folding? The instruction fetch u...

What is branch folding? The instruction fetch unit has implemented the branch instruction concurrently with the implementation of other instructions. This technique is referred

What are the disadvantages of fcfs scheduling algorithm, What are the disad...

What are the disadvantages of FCFS scheduling algorithm as compared to shortest job first (SJF) scheduling? Disadvantages: (i) Waiting time can be huge if short requests w

Explain about indirect addressing, Q. Explain about Indirect Addressing? ...

Q. Explain about Indirect Addressing? In this technique the operand field of instruction specifies the address of address of intended operand for example if instruction LOAD

Define both fork and vfork, How and when race conditions happen in process ...

How and when race conditions happen in process control? How can it be avoided? b. Differentiate among following functions giving related syntax: (i) fork and vfork (ii) w

Define exception, Define exception. The term exception is used to trans...

Define exception. The term exception is used to transfer to any event that causes an interruption

What is visualisation - search based tools, Q. What is Visualisation - sear...

Q. What is Visualisation - search based tools? Visualization is a common method in contract to search based tools. In this scheme visual aids are supplied as pictures to help p

Perform binary subtraction on following, Q Perform Binary Subtraction on fo...

Q Perform Binary Subtraction on following: 1) 1101-1000 2) 111.11-101.1 3) 1101.1-1010.01 Q Perform Binary Multiplication & Division on following: 1) 16*2.75 2) 1

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