packing -unpacking data with parallel virtual machine , Computer Networking

Assignment Help:

 Packing and Unpacking Data

  • pvm_packs - Pack the active message buffer with arrays of prescribed data type:
  • int info = pvm_packf( const char *fmt, ... )
  • int info = pvm_pkbyte( char *xp, int nitem, int stride )
  • int info = pvm_pkcplx( float *cp, int nitem, int stride )
  • int info = pvm_pkdcplx( double *zp, int nitem, int stride )
  • int info = pvm_pkdouble( double *dp, int nitem, int stride )
  • int info = pvm_pkfloat( float *fp, int nitem, int stride )
  • int info = pvm_pkint( int *ip, int nitem, int stride )
  • int info = pvm_pkuint( unsigned int *ip, int nitem, int stride )
  • int info = pvm_pkushort( unsigned short *ip, int nitem, int stride )
  • int info = pvm_pkulong( unsigned long *ip, int nitem, int stride )
  • int info = pvm_pklong( long *ip, int nitem, int stride )
  • int info = pvm_pkshort( short *jp, int nitem, int stride )
  • int info = pvm_pkstr( char *sp )

fmt Printf-like format expression states what to pack. nitem is the total number of items to be packed (not the number of bytes). stride is the stride to be used when packing the items.

  • pvm_unpack - Unpacks the active message buffer into arrays of given data type. It has been executed for different data types:
  • int info = pvm_unpackf( const char *fmt, ... )
  • int info = pvm_upkbyte( char *xp, int nitem, int stride)
  • int info = pvm_upkcplx( float *cp, int nitem, int stride)
  • int info = pvm_upkdcplx( double *zp, int nitem, int stride)
  • int info = pvm_upkdouble( double *dp, int nitem, int stride)
  • int info = pvm_upkfloat( float *fp, int nitem, int stride)
  • int info = pvm_upkint( int *ip, int nitem, int stride)
  • int info = pvm_upkuint( unsigned int *ip, int nitem, int stride )
  • int info = pvm_upkushort( unsigned short *ip, int nitem, int stride )
  • int info = pvm_upkulong( unsigned long *ip, int nitem, int stride )
  • int info = pvm_upklong( long *ip, int nitem, int stride)
  • int info = pvm_upkshort( short *jp, int nitem, int stride)
  • int info = pvm_upkstr( char *sp )

Each of the pvm_upk* routines unpacks an array of the specify data type from the active receive buffer. The arguments for each one of the routines are a pointer to the array to be unpacked into, nitem which is the whole number of items to unpack, and stride which is the stride to make use of when unpacking. An exception is pvm_upkstr() which by definition unpacks a NULL terminated character string and therefore does not need nitem or stride arguments.


Related Discussions:- packing -unpacking data with parallel virtual machine

Routing protocol, implementation of energy aided shortest path routing prot...

implementation of energy aided shortest path routing protocol???

Network design by detailing infrastructure, i have an assigment due and wan...

i have an assigment due and want some one to do my assognment

Define network, Communication, Resource sharing and Media (When many host s...

Communication, Resource sharing and Media (When many host share their resources with every other OR when many devices connect with each other for resource sharing )

Distributed enrollment protocol dep, Introduction: This is a specialized p...

Introduction: This is a specialized protocol designed for CS5244. It provides a distributed means to access a BasicEnrollmentManager implementation through client-server communica

Distinguish between network devices computers and servers, The School of Co...

The School of Computing is planning to deploy a new network structure to accommodate the following scenario. Please make suggestions on how this LAN can be designed based on the fl

Assignement, I have an asignement regarding TCP tunning and optimization. C...

I have an asignement regarding TCP tunning and optimization. Can you help?

Explain FDDI media access control, FDDI Media Access Control Unlike CSM...

FDDI Media Access Control Unlike CSMA/CD networks such like Ethernet token-passing networks are deterministic--you are able to calculate the maximum time that will pass before

What is sliding window protocols, Q. What is Sliding Window protocols? ...

Q. What is Sliding Window protocols? Alternatives: Sliding Window protocols - One task begins prior to the other one ends                                     (concept of

Tree interconnection network, Tree interconnection network Tree inter...

Tree interconnection network Tree interconnection network(TIN)), processors are organized in a whole binary tree pattern.

Full form of httpd, Full form of HTTPd It stands for HTTP daemon. HT...

Full form of HTTPd It stands for HTTP daemon. HTTPd is the program run on a UNIX platform to establish a Web server. On other platforms, such as Microsoft Windows NT, the We

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