Titlebook: CONPAR 81; Conference on Analys W. Brauer,P. Brinch Hansen,Wolfgang Händler Conference proceedings 1981 Springer-Verlag Berlin Heidelberg 1

违抗

Queue machines: An organization for parallel computation,, modularity with useful fault-tolerance properties, and simplified interconnection requirements. We define a Q-notation for program representation and discuss in general its capabilities and limitations in executing ordinary (sequential) and concurrent programs.

Hiatus

数量

Cellular algorithms for binary matrix operations,y matrixes, taking into account the cellprocessor architecture developed by T. Legendi. Moreover, on the basis of this solution cellular algorithms are given for coding and for the computation of the m-th power of a binary matrix.

Lipoprotein(A)

ingenue

interrupt

Language design approaches for parallel processors, considered which reflects neither the compiler’s detection mechanism nor the underlying hardware but enables the programmer to express the inherent parallelism of a solution to a problem. In this way a joint syntax can be developed for both types of parallel processors.

乐意

姑姑在炫耀

On language constructs for concurrent programs,nchronized or protected access to shared memory, as well as message-oriented approaches, where processes communicate via message channels, are considered. The duality of these two concepts is outlined. Moreover these constructs are compared to applicative constructs for concurrent programming such as data flow languages.

同义联想法

Analysis of concurrent algorithms,sses must be considered. This is done by using the communication sequences of the processes as the basis of the analysis. The technique is used for analyzing and comparing three concurrent algorithms for finding the root of a real function.

加入