DocumentCode
3556827
Title
Exploiting problem dynamics through result sharing in dataflow environments
Author
Krishnaprasad, S. ; Shirazi, B. ; Hurson, A.R.
Author_Institution
Dept. of Comput. Sci. & Eng., Southern Methodist Univ., Dallas, TX, USA
fYear
1991
fDate
20-24 May 1991
Firstpage
108
Lastpage
115
Abstract
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
Keywords
distributed processing; performance evaluation; queueing theory; CPRS architecture; closed queueing network model; concurrent processing which result sharing; dataflow environments; dynamic dataflow architecture; graph decomposition; performance; problem dynamics; Analytical models; Computational modeling; Computer architecture; Concurrent computing; Performance analysis; Pipeline processing; Problem-solving; Queueing analysis; Resource management; Throughput;
fLanguage
English
Publisher
ieee
Conference_Titel
Distributed Computing Systems, 1991., 11th International Conference on
Conference_Location
Arlington, TX
Print_ISBN
0-8186-2144-3
Type
conf
DOI
10.1109/ICDCS.1991.148651
Filename
148651
Link To Document