This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Performance Modeling of Shared-Resource Array Processors
July 1981 (vol. 7 no. 4)
pp. 386-394
L.M. Ni, Department of Computer Science, Michigan State University
This paper presents a Markov chain model to analyze the performance of shared-resource array processors for multiple vector processing. Such a parallel processor contains multiple control units sharing a resource pool of processing elements and operating with multiple single-instruction multiple-data streams (MSIMD). In the steady state, the Markov model corresponds to a two-dimensional Markov chain, which can be expressed by a set of equilibrium equations. An iterative method is developed to solve the Markov chain after projecting the equilibrium equations onto a one-dimensional state space. The convergence rate of the iterative method can be greatly enhanced by choosing starting values corresponding to the approximated analytical results obtained earlier by the authors.
Index Terms:
vector processing, Array processor, Markov chain, multiple SIMD computer, performance evaluation, queueing network, resource sharing, system throughput
Citation:
L.M. Ni, null Kai Hwang, "Performance Modeling of Shared-Resource Array Processors," IEEE Transactions on Software Engineering, vol. 7, no. 4, pp. 386-394, July 1981, doi:10.1109/TSE.1981.234541
Usage of this product signifies your acceptance of the Terms of Use.