Title : 
Performance Modeling of Shared-Resource Array Processors
         
        
            Author : 
Ni, Lionel M. ; Hwang, Kai
         
        
            Author_Institution : 
Department of Computer Science, Michigan State University
         
        
        
        
            fDate : 
7/1/1981 12:00:00 AM
         
        
        
        
            Abstract : 
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.
         
        
            Keywords : 
Array processor; Markov chain; multiple SIMD computer; performance evaluation; queueing network; resource sharing; system throughput; vector processing; Approximation methods; Computer networks; Convergence; Equations; Intelligent networks; Iterative methods; Performance analysis; Resource management; State-space methods; Steady-state; Array processor; Markov chain; multiple SIMD computer; performance evaluation; queueing network; resource sharing; system throughput; vector processing;
         
        
        
            Journal_Title : 
Software Engineering, IEEE Transactions on
         
        
        
        
        
            DOI : 
10.1109/TSE.1981.234541