Path: utzoo!utgpu!news-server.csri.toronto.edu!rpi!think.com!spool.mu.edu!uunet!europa.asd.contel.com!gatech!hubcap!fpst
From: becker!bdb@uunet.UU.NET (Bruce D. Becker)
Newsgroups: comp.parallel
Subject: Re: Byte order in tight coupled systems.
Message-ID: <1991Jun24.122015.19112@hubcap.clemson.edu>
Date: 24 Jun 91 04:12:38 GMT
Article-I.D.: hubcap.1991Jun24.122015.19112
References: <1991Jun18.173855.29052@hubcap.clemson.edu>
Sender: fpst@hubcap.clemson.edu (Steve Stevenson)
Organization: G. T. S., Toronto, Ontario, Canada
Lines: 35
Approved: parallel@hubcap.clemson.edu


In article <1991Jun18.173855.29052@hubcap.clemson.edu> andy@research.canon.oz.au (Andy Newman) writes:
|
|Basically we have a tightly coupled (i.e., shared memory) system
|with two processors, one little-endian, the other big-endian.
|We were going to fix it in hardware but that didn't work as
|expected so its up to us software people to attack it.
[lots of stuff deleted]

	You might want to think about trying to
	adapt Sun's XDR system to your problem.
	XDR is a data-representation language
	which has C-like syntax, and which was
	designed to handle exactly such problems.

	The source for compiler & library should
	be easily available at many FTP sites.


-- 
  ,u,	 Bruce Becker	Toronto, Ontario
a /i/	 Internet: bdb@becker.UUCP, bruce@gpu.utcs.toronto.edu
 `\o\-e	 UUCP: ...!utai!mnetor!becker!bdb
 _< /_	 "Ferget yer humanity, do the poot" - devo