Sundaram, CRM and Narahari, Y (1991) An Analytical Study of the Time Variance in Parallelism in Dataflow Architectures. In: 1991 IEEE Region 10 International Conference on E3-Energy, Computer, Communication and Control Systems. TENCON '91, 28-30 August, New Delhi,India, Vol.2, 189-194.
Evaluating the performance of parallel computations on parallel machines is an issue of great importance in the design of parallel processing systems. In this paper, we use an integrated modelling framework comprising Product Form Queueing Networks (PFQN’s) and Generalized Stochastic Petri Nets (GSPN’s) to model and evaluate the effect of the variance in parallelism in parallel computations. We focus on dataflow computations and present an integrated PFQN-GSPN model for the execution of dataflow computations on the Manchester dataflow machine. We characterize the parallelism in dataflow computations through a 4-parameter characterization comprising the minimum parallelism, maximum parallelism, average parallelism and the variance in parallelism. This model can be efficiently solved. The numerical results indicate that the average parallelism is a good characterization of the dataflow computations only as long as the variance in parallelism is small. However, siginficant difference in performance measures will result when the variance in parallelism is comparable to or higher than the average parallelism.
|Item Type:||Conference Paper|
|Additional Information:||Copyright 1990 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.|
|Department/Centre:||Division of Electrical Sciences > Computer Science & Automation (Formerly, School of Automation)|
|Date Deposited:||25 May 2006|
|Last Modified:||19 Sep 2010 04:27|
Actions (login required)