论文信息 - A language design for concurrent processes

A language design for concurrent processes

In conventional programming languages, the sequence of execution is specified by rules such as: (1) The statement "GO TO L" is followed by the statement labelled "L" (Branching rule). (2) The last statement in the range of an iteration is followed, under certain conditions, by the first statement in the range (Looping rule). (3) The last statement of a subroutine is followed by the statement immediately after its CALL (Out-of-line code rule). ... (Other rules) (n) In other cases, each statement is followed by the statement immediately after it (Order rule).

L. G. Tesler | H. J. Enea | H. Enea | L. Tesler

[1] Herbert Hellerman,et al. Parallel Processing of Algebraic Expressions , 1966, IEEE Trans. Electron. Comput..

[2] David A. Fisher,et al. DETECTION OF IMPLICIT COMPUTATIONAL PARALLELISM FROM INPUT-OUTPUT SETS. , 1966 .

[3] Arthur J. Bernstein,et al. Analysis of Programs for Parallel Processing , 1966, IEEE Trans. Electron. Comput..

[4] John A. Gosden,et al. Explicit parallel processing description and control in programs for multi- and uni-processor computers , 1899, AFIPS '66 (Fall).

[5] S. Schlesinger,et al. POSE: a language for posing problems to a computer , 1967, CACM.

[6] Melvin E. Conway,et al. A multiprocessor system design , 1899, AFIPS '63 (Fall).

[7] Eugene D. Homer. An algorithm for selecting and sequencing statements as a basis for a problem-oriented programming system , 1966, ACM '66.

[8] James P. Anderson,et al. Program structures for parallel processing , 1965, Commun. ACM.

[9] Niklaus Wirth,et al. A note on “Program structures for parallel processing” , 1966, CACM.