
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
J. Sztrik, D. Kouvatsos, "Asymptotic Analysis of a Heterogeneous Multiprocessor System in a Randomly Changing Environment," IEEE Transactions on Software Engineering, vol. 17, no. 10, pp. 10691075, October, 1991.  
BibTex  x  
@article{ 10.1109/32.99194, author = {J. Sztrik and D. Kouvatsos}, title = {Asymptotic Analysis of a Heterogeneous Multiprocessor System in a Randomly Changing Environment}, journal ={IEEE Transactions on Software Engineering}, volume = {17}, number = {10}, issn = {00985589}, year = {1991}, pages = {10691075}, doi = {http://doi.ieeecomputersociety.org/10.1109/32.99194}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Software Engineering TI  Asymptotic Analysis of a Heterogeneous Multiprocessor System in a Randomly Changing Environment IS  10 SN  00985589 SP1069 EP1075 EPD  10691075 A1  J. Sztrik, A1  D. Kouvatsos, PY  1991 KW  asymptotic queuing theoretic approach; FCFS; heterogeneous multiprocessor computer system; randomly changing environment; stochastic times; random environment; service rates; busy period length; bus; exponentially distributed random variable; steadystate performance measures; system throughput; mean delay time; expected waiting time; reliability; multiprocessing systems; performance evaluation; queueing theory; stochastic processes VL  17 JA  IEEE Transactions on Software Engineering ER   
An asymptotic queuing theoretic approach is proposed to analyze the performance of an FCFS (firstcome, firstserved) heterogeneous multiprocessor computer system with a single bus operating in a randomly changing environment. All stochastic times in the system are considered to be exponentially distributed and independent of the random environment, while the access and service rates of the processors are subject to random fluctuations. It is shown under the assumption of 'fast' arrivals that the busy period length of the bus converges weakly, under appropriate normalization, to an exponentially distributed random variable. As a consequence, main steadystate performance measures such as system throughput, mean delay time, expected waiting time, and mean number of active processors can be approximately determined. The reliability of the proposed method is validated by comparing the new approximations with known exact results.
[1] M. Ajmone Marsan, G. Balbao, and G. Conte,Performance Modeling of Multiprocessor Systems. Cambridge, MA: MIT Press, 1986.
[2] V. V. Anisimov, O. K. Zakusilo, and V. S. Donchenko,Elements of Queueing Theory and Asymptotic Analysis of Systems. Kiev, USSR: Visha Skola, 1987 (in Russian).
[3] V. V. Anisimov and J. Sztrik, "Asymptotic analysis of some controlled finitesource queueing systems,"Acta Cybern., vol. 9, pp. 2738, 1989.
[4] D. P. Gaver, P. A. Jacobs, and G. Latouche, "Finite birthanddeath models in randomly changing environments,"Advances in Appl. Probability, vol. 16, pp. 715731, 1984.
[5] E. Gelenbe,Multiprocessor Performance. New York: Wiley, 1989.
[6] I. B. Gertsbakh, "Asymptotic methods in reliability theory: a review,"Advances in Appl. Probability, vol. 16, pp. 147175, 1984.
[7] I. B. Gertsbakh,Statistical Reliability Theory. New York: Marcel Dekker, 1989.
[8] B. Hajek, "Birthanddeath processes on the integers with phases and general boundaries,"J. Appl. Probability, vol. 19, pp. 488499, 1982.
[9] M. Ishigaki, H. Takagi, Y. Takahashi, and T. Hasewaga, "Throughput and fairness analysis of prioritized multiprocessor bus arbitration protocols," IBM Res. Lab., Tokyo, Res. Rep. RT 0051 08/17/90, 1990.
[10] J. Keilson, U. Sumita, and M. Zachman, "Rowcontinuous finite Markov chains structure and algorithms," Grad. School of Management, Univ. Rochester, Tech. Rep. No. 8115, 1981.
[11] M. Neuts,MatrixGeometric Solutions in Stochastic ModelsAn Algorithmic Approach. Baltimore, MD: John Hopkins Univ. Press., 1981.
[12] S. Nogami and S. Sumita, "Approximate analysis of memory contention in a multiprocessor system with a single bus,"Electron. and Commun. in Japan, vol. 27, no. 8, pt. 1, pp. 6574, 1989.
[13] P. Purdue, "TheM/M/1 queue in a Markovian environment,"OperationsRes. vol. 22, pp. 562569, 1974.
[14] C. Rosenberg, R. Mazumdar, and L. Kleinrock, "On the analysis of exponential queueing systems with randomly changing arrival rates: stability conditions and finite buffer scheme with a resume level,"Perform. Eval., vol. 11, pp. 283293, 1990.
[15] B. Sengupta, "A queue with service interruptions in an alternating random environment"Operations Res., vol. 38, pp. 308318, 1990.
[16] W. Torres, "Calculation extinction probabilities for the birthanddeath chain in a random environment,"J. Appl. Probabilityvol. 16, pp. 709720, 1979.
[17] U. Yechiali, "A queueingtype birthanddeath process defined on a continuoustime Markov chain,"Operations Res., vol. 21, pp. 604609, 1973.