12.4 Parallelism and Concurrency Versus GLM
Using Arnold Rosenberg paper [3] and ERA paper [2], one might find that quite a
lot of mess we have found in discussing of concurrency and parallelism. Thus, if
one will use Intel official link:
http://software.intel.com/en-us/articles/how-to-sound-like-a-parallel-programmingexpert-part-1-introducing-concurrency-and-parallelism/
he might end up that concurrency and parallelism are synonyms. To clarify this
situation and preserve others from confusion, our model presented below called the
graph-logic model (Fig. 12.8) can be used clarifying this matter.
Every meta-program structure might be described using GLM (Graph Logic
Model) that provides a scheme to redevelop existing programs into their maximum
parallel and minimum concurrent form, limited only by available hardware
resources.
Note that GLM might be applied for any graph of the program or process model.
GLM uses logical operators from the set {AND, OR, XOR} for every program
or hardware scheme that it describes.
These operators are allocated for the input and output of each vertex.
A vertex might be an operator, instruction, or state. Vertex a in the example of
Fig. 12.8 may be described thus as
Fig. 12.7 Graph-logic model, helps to separate concurrency and parallelism
186
12 Proposed Runtime System Structure …
Using Arnold Rosenberg paper [3] and ERA paper [2], one might find that quite a
lot of mess we have found in discussing of concurrency and parallelism. Thus, if
one will use Intel official link:
http://software.intel.com/en-us/articles/how-to-sound-like-a-parallel-programmingexpert-part-1-introducing-concurrency-and-parallelism/
he might end up that concurrency and parallelism are synonyms. To clarify this
situation and preserve others from confusion, our model presented below called the
graph-logic model (Fig. 12.8) can be used clarifying this matter.
Every meta-program structure might be described using GLM (Graph Logic
Model) that provides a scheme to redevelop existing programs into their maximum
parallel and minimum concurrent form, limited only by available hardware
resources.
Note that GLM might be applied for any graph of the program or process model.
GLM uses logical operators from the set {AND, OR, XOR} for every program
or hardware scheme that it describes.
These operators are allocated for the input and output of each vertex.
A vertex might be an operator, instruction, or state. Vertex a in the example of
Fig. 12.8 may be described thus as
Fig. 12.7 Graph-logic model, helps to separate concurrency and parallelism
186
12 Proposed Runtime System Structure …