Path: utzoo!attcan!uunet!lll-winken!lll-lcc!ames!ucsd!rutgers!bellcore!faline!thumper!ulysses!andante!alice!ark From: ark@alice.UUCP Newsgroups: comp.lang.c Subject: Re: implementing Dijkstra's guarded commands Keywords: in a serial environment, parallel to come Message-ID: <8044@alice.UUCP> Date: 15 Jul 88 14:38:25 GMT References: <515@muffin.cme-durer.ARPA> Organization: AT&T Bell Laboratories, Liberty Corner NJ Lines: 15 In article <515@muffin.cme-durer.ARPA>, libes@cme-durer.UUCP writes: > I am rendering an algorithm into C that was originally written using > Dijkstra's guarded commands. I am wondering if there is a nice way of > writing the C so that the algorithm preserves the possibility for > parallel execution Dijkstra's guarded commands don't really allow for parallel execution. If you say if C1 -> S1 | C2 -> S2 | C3 -> S3 fi then exactly one of S1, S2, and S3 will be executed (or the program will abort). Where's the parallelism?