🚀 go-pugleaf

In article <ACD5092596684DB87@jake-6f.ip.realtime.net> hplus@bga.com (Jon Watte) writes:
>From: hplus@bga.com (Jon Watte)
>Subject: Re: Message passing speed on BeBox
>Date: Sun, 19 Nov 1995 16:17:41 -0600

>In article <umisef.40.30AE344D@halls1.cc.monash.edu.au>,
>umisef@halls1.cc.monash.edu.au (Bernd MEYER - Bernie) writes:

>> Let me join David in wondering why the number of messages is so small.
>> I just did a small test on my linux-laptop. I started two processes that
>> were alternately writing into and reading from a named pipe (as in:

>This is not the kind of messaging Be times. Messages are addressed packets
>of structured data. You create a message, you add typed, named, parameters
>(data) to it, you send the message to one of many receivers, the receipient
>receives and decodes the message.

Well, that isn't all that different from sending stuff into a pipe
with 

   fprintf(pipefd,"%d\n",value);

or reading it with 

   fscanf(pipefd,"%d",&value);

I might try sending a sructure through that pipe, instead of having
the printf and scanf functions there. It should speed things up 
tremendously.

>There are lower-level primitives in the Be OS, including raw shared memory
>plus semaphores, and "ports" which work a lot like message queues.

Yep. Same in Unix. Most versions these days provide SysV IPC, which has
all that. I don't know how to use it, though, so I can't time the stuff.

>Using
>ports, in the simplest fashion, I get 5000 query/reply pairs per second.
>This is real-time seconds; I don't know if anything else is happening on
>the machine as well (though I doubt it)

As I mentioned in my previous post, using the Byte Benchmarks and the
new scheduler for linux, you can get more than 30000 cycles on a fast
machine, sending around a single "long" through a pipe.  

Bernie