🚀 go-pugleaf

In article <1992Aug11.121234.28784@hubcap.clemson.edu>, jek@cs.duke.edu (James E. Kittock) writes:
|> 
|> While working on this, I have come to the conclusion that the C
|> interface to PVM has a serious "want", namely, a routine to
|> automagically put a structure and all of its contents, *including* the
|> contents of any arrays/structures/unions pointed to by members of that
|> structure.

In my Stuttgart Parallel Processing Library (SPPL) this is possible.
The sending and receiving routines (sendd and recvd) have an
additional parameter which is a type description. Because the routine
for arbitrary graphs is not very efficient there exist two send
routines, one for data structures like trees and one for data
structures which contains cycles. DAG's can be send with the routine
for trees, but for each reference of an object there will be a copy of
the object. So you can send an arbitrary data structure with one
function call. The sendd function call is responsible for the
allocation of a message buffer, the copying of the scattered data into
this continous message buffer, the conversion of the data in a network
format and sending the message.

SPPL is a parallel processing library for distributed memory MIMD
computers and contains functions which can be used to send and receive
messages, start processes and synchronize etc. SPPL use a type
description of the message to collect the scattered data of the
message in a message-buffer and to convert the data to a network
format. The associated debugger use this information to display the
message in a readable format. This parallel debugger allows
interactive display and control of execution of SPPL programs. SPPL
uses currently TCP/IP to transfer messages.

--
Roland Zink Tel.:(0711)7816-382 email: Roland.Zink@informatik.uni-stuttgart.de
Univ. Stuttgart, IPVR, Breitwiesenstrasse 20, W-7000 Stuttgart 80, Germany