Theory of Parallel Programming. II. Survey of Formal Models

Narin'yani, Alexander S.

doi:10.1007/978-1-4615-8249-6_2

Cited by 8 publications

(3 citation statements)

References 31 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The reverse is also true: the majority of asynchronous programming languages exist only as theoretical models or, at best, are under development. Therefore, one can familiarize oneself with them through reviews [55][56][57][58] and also from Chapter 4 of this book. The most essential contribution to the development of data-flow computation theory and to design for data-flow languages and computers has been made by a group of researchers from MIT headed by J. Dennis.…”

Section: Asynchronous Programmingmentioning

confidence: 99%

On Parallel Languages

Kotov¹

1984

Algorithms, Software and Hardware of Parallel Computers

View full text Add to dashboard Cite

The improvement of mechanisms for program representation of parallelism was. and still is, the central problem of parallel programming. In practice, this consists of two different problems:the development of methods for describing parallelism in programs modelling complex discrete systems and processes;the development of methods for the organization of computations on parallel multiprocessing computers.More specifically, the problem lies in the development of parallel programming languages containing facilities for the description of task parallelism and/or the definition of computational parallelism. Both problems have many traits in common from the point of view of the basic principles underlying the mechanism of parallel structure organization. Basically, the differences between them can be reduced to the differences between high-and low-level languages. Parallelism in programs and computationsThe discussion of problems associated with parallelism in programming requires a more precise definition of this concept, the separation of its abstract and concrete forms at various stages of programming, and at various levels of the program hierarchy.Difficulties arise from the very beginning : how to define the concepts of parallel computation (processes, statements, operations, etc.). The definitions introducing real or conditional time and leading to ideas such as "concurrent processes" or "processes that can be concurrent", lead to difficulties and ambiguities unless one considers trivial examples (e.g. a pair of processes which do not interact at all). The fact that formal theoretical definitions of parallelism based on time relations are complicated reflects these difficulties. There is another, wider possibility for defining parallelism : fragments or processes are referred to as parallel, if they are (or can be) implemented by different separate physical or virtual units. One can fully avoid the necessity of defining the parallelism relation and, instead, define the dependence relation of fragments or processes. This approach complements the above ones, and it can be characterized as "parallelism presumption": all the program fragments and actions are regarded as initially independent, i.e. parallel;

show abstract

Section: Asynchronous Programmingmentioning

confidence: 99%

On Parallel Languages

Kotov¹

1984

Algorithms, Software and Hardware of Parallel Computers

View full text Add to dashboard Cite

show abstract

“…If Pp(~)=0 then the row F~( ,~ ) is zero. Otherwise, the k-th bit of row ~(~ ) is the k-th bit of the section of H beginning with the i-th bit, if 0~K<~ (6), where ~(~) is the length of the section of H beginning with the i-th bit.…”

Section: Subroutine Of Processing Of Linear Arraysmentioning

confidence: 99%

“…Thus, at present, several multiprocessor systems exist and are in operation [i, 2] and numerous technical developments exist [3,4]. Mathematical models of parallelism have been proposed [5][6][7][8].…”

Section: Introductionmentioning

confidence: 99%

Possibility of maximum paralleling of problems on associative processors

Lebedinskii¹

1982

J Math Sci

View full text Add to dashboard Cite

For it a program is writ, ten which does not contain loops and has the following properties. The program's original data are a normal algorithm A (its notation) and a word ~ , while the results are a Boolean value ~ and a word ~ . If A is applicable to word ~ , then we can indicate a finite memory such that the program, having worked on this memory, yields the value true as % and A(~) as ~. However, if A is not applicable to ~ , then the program does not work on any (finite) memory and always yields the value false as ~ . If the program works on an infinite memory, then after its work ~ takes the value true if and only if A is applicable to ~ ; moreover, in the case of applicability ~ takes the value A~) The present paper contains a more detailed exposition of the result published in Zap. Nauchn. Sem. Leningr. Otd. Mat. Inst. Akad. Nauk USSR, 70 (1977).

show abstract