A language design for concurrent processes

@inproceedings{Tesler1968ALD,
  title={A language design for concurrent processes},
  author={Lawrence G. Tesler and Horace Enea},
  booktitle={AFIPS '68 (Spring)},
  year={1968}
}
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… Expand
Parallelism, control and synchronization expression in a single assignment language
TLDR
The objects definition in the language is dealt with, in which a new attribute, called "environment", is introduced and discussed, and the flavour of the syntax and semantics of statements in the single assignment language is given. Expand
A parallel Prolog: The construction of a data driven model
An argument is presented for the implementation of a Prolog-like language using data driven execution, as a step towards the solution of the problems associated with multiprocessor machineExpand
Compilation of Nonprocedural Specifications into Computer Programs
The paper describes the compilation of a program specification, written in the very high level nonprocedural MODEL language, into an object, PL/1 or Cobol, procedural language program. NonproceduralExpand
A Fixed Point Approach to Applicative Multiprogramming
TLDR
The language, which in the first instance implicitly uses the notions of multiprogramming, is extended by more explicit constructs, such that a general reduction language and data flow language with explicit parallelism, communication and concurrency is derived. Expand
Incremental program testing in a very high level language
A testing and debugging methodology is presented which exploits the following properties of very high level languages: functionality, single assignment property, locality of reference, and aggregateExpand
Use of a Nonprocedural Specification Language and Associated Program Generator in Software Development
TLDR
The Model II language and the associated program generator are used to explain and illustrate the use of very high level nonprocedural languages for computer programming and the methodology incorporated in the existing program generator is reviewed. Expand
Petri net models of program execution in data flow environments
TLDR
A method for approximating the time required to execute a data flow program (assuming adequate computing resources) is described and this method is applied to the static program graph at compile time and yields a parameterized equation for execution time performance. Expand
Data Flow and Dependence Analysis for Instruction Level Parallelism
Instruction-level parallel architectures present their own set of opportunities and needs, requiring the development of a new class of compiler optimization techniques. Dynamic single assignment isExpand
Integrating parallel dataflow programming with the Ada tasking model
TLDR
Three extensions to standard Ada are proposed: parallel composition of statements, a parallel for-loop statement, and single-assignment types that can be written without explicit tasking, that are identical—except for two new reserved words—to sequential Ada programs that satisfy the same specifications. Expand
Dataflow analysis of array and scalar references
  • P. Feautrier
  • Computer Science
  • International Journal of Parallel Programming
  • 2005
TLDR
This paper presents an algorithm for analyzing the patterns along which values flow as the execution proceeds, and discusses several applications of the method: conversion of a program to a set of recurrence equations, array and scalar expansion, program verification and parallel program construction. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 12 REFERENCES
Parallel Processing of Algebraic Expressions
  • H. Hellerman
  • Computer Science
  • IEEE Trans. Electron. Comput.
  • 1966
TLDR
A compiler and machine organization which are capable of detecting opportunities for parallel processing in algebraic expressions and executing these by multiple processing units operating concurrently are described. Expand
An algorithm for selecting and sequencing statements as a basis for a problem-oriented programming system
TLDR
A variant of the algorithm outlined here has been coded and tested and is believed to be unique, wherein specific values of variables are not entered until run time. Expand
A multiprocessor system design
TLDR
Parallel processing is not so mysterious a concept as the dearth of algorithms which explicitly use it might suggest, but any or all of the processes can be performed simultaneously, if conflicts arising from multiple access to common storage can be resolved. Expand
POSE: a language for posing problems to a computer
TLDR
All clerical operations now required for FORTRAN programming have been automated so that the POSE programmer need not be concerned with these details, and the computer will assume another tedious burden previously associated with computer program development. Expand
Analysis of Programs for Parallel Processing
  • A. Bernstein
  • Computer Science
  • IEEE Trans. Electron. Comput.
  • 1966
A set of conditions are described which determine whether or not two successive portions of a given program can be performed in parallel and still produce the same results. The conditions are generalExpand
DETECTION OF IMPLICIT COMPUTATIONAL PARALLELISM FROM INPUT-OUTPUT SETS.
Abstract : This is the first report of an investigation designed to show how the implicit parallelism in programs written in present programming languages can be recognized and exploited by computersExpand
Explicit parallel processing description and control in programs for multi- and uni-processor computers
  • J. Gosden
  • Computer Science
  • AFIPS '66 (Fall)
  • 1966
TLDR
This paper discusses the development and current state of the art in parallel processing and describes a natural extension of the evolutionary approaches that is a general-purpose approach that is applicable to all types of data processing and computer configuration. Expand
A note on “Program structures for parallel processing”
TLDR
To abstract from Mr. Sprague's letter, he looks at each stage of developing new subtables to see if any pairs cf subtables are equal, i.e., the condition values and series of actions are identical for every corresponding rule of the pairs of subtables. Expand
Program structures for parallel processing
TLDR
The SillilO /WOgl'~ilii :is ~i l lerl iales for (~xec/llioll wl iel i :u io lher si,gi i ieli l is,<-;u,~li(!n(te(l : tw: i i l ing I/ ' () oli(,l'al ions)r(ic¢'s,~il~Ig lim). Expand
Better processing through better architecture Datamation Vol 13 (August 1967)pp
  • 1967
...
1
2
...