12.6 Concurrency Handling: Language and Runtime
System Aspects
At the same time, there is no great breakthrough in use of all this hardware and
software to cope with the problems of concurrency and parallelization in the most
effective way.
Each structure of the computer system can be considered from the three key
redundancies point of view—structure, time, and information. Algorithm and its
meta-representation such as this one on Fig. 12.9 is representing predicates, control,
and data dependencies.
All of them are mapped on hardware and all of them are required to be
(a) parallelized as much as possible and (b) made concurrent as less as possible.
Thus, the blue star of ith layer and green box of the same layer are potential
concurrency-handling-need points. Making them efficiently following through
further is a direct impact on the performance and reliability of the whole system
(Fig. 12.9).
Fig. 12.9 CDP: all three graphs are sources of concurrency implications
12.6 Concurrency Handling: Language and Runtime System Aspects
189
System Aspects
At the same time, there is no great breakthrough in use of all this hardware and
software to cope with the problems of concurrency and parallelization in the most
effective way.
Each structure of the computer system can be considered from the three key
redundancies point of view—structure, time, and information. Algorithm and its
meta-representation such as this one on Fig. 12.9 is representing predicates, control,
and data dependencies.
All of them are mapped on hardware and all of them are required to be
(a) parallelized as much as possible and (b) made concurrent as less as possible.
Thus, the blue star of ith layer and green box of the same layer are potential
concurrency-handling-need points. Making them efficiently following through
further is a direct impact on the performance and reliability of the whole system
(Fig. 12.9).
Fig. 12.9 CDP: all three graphs are sources of concurrency implications
12.6 Concurrency Handling: Language and Runtime System Aspects
189