2 citations found. Retrieving documents...
G. Barrett, M. Goldsmith, G. J., and Kay, A. The meaning and implementation of pri alt in occam. In Proceedings of the 9th occam user group technical meeting (1988), pp. 37--46.

 Home/Search   Document Details and Download   Summary   Related Articles   Check  

This paper is cited in the following contexts:
Southampton's Portable Occam Compiler (SPOC) - Debbage, Hill, Wykes, Nicole (1994)   (1 citation)  (Correct)

....the effect of branching to the code associated with the selected guard. The enable sequence and the disable sequence are each executed atomically. There is therefore no need to handle the case where a high priority guard becomes active during the disable sequence. Note that this reproduces the bug[4] in the transputer implementation associated with the interaction between PRI ALT and PRI PAR. 3 Translating Occam to C This section gives a brief overview of the components of the occam compilation system. Figure 1 illustrates the coupling between the various modules from which the compilation ....

G. Barrett, M. Goldsmith, G. J., and Kay, A. The meaning and implementation of pri alt in occam. In Proceedings of the 9th occam user group technical meeting (1988), pp. 37--46.


Carefully Scheduled Selection With Alt - Jones (1989)   (1 citation)  Self-citation (Jones)   (Correct)

.... c[i] x[i] P(i) I have left out the assembly code to make it clearer what happens. It is difficult to tell what he intended, but it is plain that something has gone wrong here. Suppose that n is at least three, and that the following sequence of events happens: favourite : 0 c[0] c[1], c[2] become ready how.many, available FROM 0 FOR 3] 3, 0, 1, 2] favourite : 1 c[1] is selected, and is no longer ready how.many, available FROM 0 FOR 2] 2, 0, 2] favourite : 0 c[0] is selected, and is no longer ready c[0] c[1] happen to become ready again how.many, available ....

....make it clearer what happens. It is difficult to tell what he intended, but it is plain that something has gone wrong here. Suppose that n is at least three, and that the following sequence of events happens: favourite : 0 c[0] c[1] c[2] become ready how.many, available FROM 0 FOR 3] 3, [0, 1, 2] favourite : 1 c[1] is selected, and is no longer ready how.many, available FROM 0 FOR 2] 2, 0, 2] favourite : 0 c[0] is selected, and is no longer ready c[0] c[1] happen to become ready again how.many, available FROM 0 FOR 3] 3, 0, 1, 2] favourite : 1 . Guess when c[2] is ....

[Article contains additional citation context not shown here]

Geoff Barrett, Michael Goldsmith, Geraint Jones, Andrew Kay, The meaning and implementation of PRI ALT in occam, in "occam and the transputer -- research and applications" (Proc 9th technical meeting of the occam user group), ed. Charlie Askew, Southampton, 1988.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC