Ann: Stackless Limbo Dancing Works Fine!

[Niki Spahiev]

Hello Fernando,

Tuesday, May 21, 2002, 11:16:19 PM, you wrote:

FP> On 5/21/02 12:07 AM, in article ueji35ihipuee3 at corp.supernews.com, "Andrew
FP> Henshaw" <andrew.henshaw at mail.com> wrote:
>> An Occam channel is very simple and was implemented efficiently in the
>> Transputer's microcode.  I suspect that having only a single transmitting
>> process and a single receiving process simplifies that task.  As I said
>> before, I believe that this holds for CSP also.
FP> I can't find my CSP book, but from memory I don't think this is correct.
FP> Through || (PAR), it is possible for several concurrent processes to attempt
FP> to read or to write on the same channel. Then the channel implementation
FP> needs a queue to hold all the blocked processes until a complementary event
FP> occurs, at which point one of the pending requests is matched to the event
FP> and the blocked process becomes runable.

IIRC transputers had 4 ports and special chip which can be programmed to produce
channel to any port of any transputer. So channels can't be shared.

-- 
Best regards,
 Niki


______________________________________
VEGA(TM) Internet Service Provider
      <http://www.vega.bg>
Scanned and protected by Inflex
Tova pismo e provereno i zashtiteno
ot programite "Inflex/Antivir".