The notion of CPRS (concurrent processing which result sharing) graph decomposition is presented which is based on problem dynamics, and the validity of the CPRS scheme in a dataflow environment is explored. A dynamic dataflow architecture to execute programs under the new model of computation, called the CPRS architecture, is presented. An analytical modeling, based on a closed queueing network model, is used to study the effect of result sharing on the performance of the CPRS architecture. >
['S. Krishnaprasad', 'Behrooz Shirazi', 'Ali R. Hurson']
Exploiting problem dynamics through result sharing in dataflow environments