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

Application layer in tcp/ip model corresponds to for what, Application laye...

Application layer (layer 4) in TCP/IP model corresponds to? In OSI model, application layer (layer 4) in TCP/IP model corresponds to layer 6 and layer 7.

#titlesoftware interface.., draw circuit diagram and the truth table that r...

draw circuit diagram and the truth table that represent demultiplexer

Explain disadvantage of optimal page replacement algorithm, Explain Disadva...

Explain Disadvantage of Optimal Page Replacement Algorithm Optimal page replacement algorithm cannot be implemented in the general purpose operating system as it is impossible

Write a cgi program that prints date and time, Write a CGI program that pri...

Write a CGI program that prints date and time at which it was run. #!/bin/sh # # CGI script that prints the date and time at which it was run # # Output the documen

Internet programming, Futoshiki is a game played on an N by N (usually 5 by...

Futoshiki is a game played on an N by N (usually 5 by 5) grid and uses the symbols 1 .. N. The objective of the game is to place each symbol on the grid so that it only occurs once

Neural networks as perceptrons, Neural networks as perceptrons: Howeve...

Neural networks as perceptrons: However ANNs look like this in the general case:  Considered that the w, x, y and z represent real valued weights so all the edges in t

Explain elements of language grammer, Explain elements of language Gram...

Explain elements of language Grammer . As proposed through Noam Chomsky, a grammar G contains the following elements: a. A finite set N of non terminal symbols. b. A f

Multiple assign statements targeting the same wire, What logic is inferred ...

What logic is inferred when there are multiple assign statements targeting the same wire? It's illegal to specify multiple assign statements to the same wire in a synthesizable

How physical addressing is performed in wan, How physical addressing is per...

How physical addressing is performed in WAN?  WAN networks operate as similar to a LAN. All WAN technology describes the specific frame format a computer uses while sending an

Basic logic gates, Basic logic gates Introduce the basic logic gates i...

Basic logic gates Introduce the basic logic gates in terms of a) their function, b) their circuit symbol, c) their truth table and d) their equivalent in Boolean a

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