Compiling and running the pvm program, Computer Engineering

Assignment Help:

Now we will learn how to compile and run PVM programs. To compile the program change to directory pvm/lib/archname where archname is architecture name of your computer. Then the subsequent command: 

cc  program.c -lpvm3 -o prgram

shall compile a program termed as program.c. After compiling we should put the executable file in directory pvm3/bin/ARCH. As well as we need to compile program separately for each architecture in virtual machine. In case we employ dynamic groups we must also add -lgpvm3 to compile command. Then the executable file is able to be run. To achieve this first run PVM. After PVM is running executable file can be run from UNIX command line as any other program. 

PVM supplies an architecture-independent make and aimk which automatically concludes PVM_ARCH and links any OS (operating system) specific libraries to your application. To compile this C example type 

% aimk master.c

Now from one window initialize PVM and configure some hosts. In other window alter directory to $HOME/pvm3/bin/PVM_ARCH in addition type 

% master

It will ask for some tasks to be executed. Then specify number of tasks.


Related Discussions:- Compiling and running the pvm program

Define handshaking, Define Handshaking. Handshaking is a method commonl...

Define Handshaking. Handshaking is a method commonly used to accompany ever data item being transfer with the control signal that show the presence of data in the bus. The unit

Explain pass-1 algorithm of passes used in two-pass-assemble, Explain pass-...

Explain pass-1 algorithm of passes used in two-pass assembler? Pass I: (i) Separate the symbol, operand fields and mnemonic opcode (ii) Make the symbol table (iii)

Simplify the expression by using karnaugh map, Simplify   the   following  ...

Simplify   the   following   expression   into   sum   of   products   using   Karnaugh   map F(A, B, C, D) = ∑ (1,3,4,5,6,7,9,12,13) Ans. Simplification of the giv

Define deadlock, Define deadlock. A process requests resources; if the ...

Define deadlock. A process requests resources; if the resources are not available at that time, the method enters a wait state. Waiting processes might never again change state

What is the draw back of access-3 code, Q. What is the draw back of Access-...

Q. What is the draw back of Access-3 Code? Give suggestion to over come this drawback.

Determine the o/p when i/p A=11001 is applied to a NOT gate, When an input ...

When an input signal A=11001 is applied to a NOT gate serially, its output signal is ? Ans. First input applied will be LSB 00110, as A=11001 is serially applied to a NOT gate

How many select lines will a 32:1 multiplexer will have, How many select li...

How many select lines will a 32:1 multiplexer will have ? Ans. 5 select lines will be required for 32 inputs, as 2 5 = 32.

Write down the basic performance equation, Write down the basic performance...

Write down the basic performance equation? T=N*S/R T=processor time N=no.of instructions S=no of steps R=clock rate

Data phases - computer architecture, Data phases: After the address ph...

Data phases: After the address phase (particularly, starting with the cycle that DEVSEL# goes low) comes a burst of one or more data phases. In all the cases, initiator drives

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