
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
M. Granda, J.M. Drake, J.A. Gregorio, "Performance Evaluation of Parallel Systems by Using Unbounded Generalized Stochastic Petri Nets," IEEE Transactions on Software Engineering, vol. 18, no. 1, pp. 5571, January, 1992.  
BibTex  x  
@article{ 10.1109/32.120316, author = {M. Granda and J.M. Drake and J.A. Gregorio}, title = {Performance Evaluation of Parallel Systems by Using Unbounded Generalized Stochastic Petri Nets}, journal ={IEEE Transactions on Software Engineering}, volume = {18}, number = {1}, issn = {00985589}, year = {1992}, pages = {5571}, doi = {http://doi.ieeecomputersociety.org/10.1109/32.120316}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Software Engineering TI  Performance Evaluation of Parallel Systems by Using Unbounded Generalized Stochastic Petri Nets IS  1 SN  00985589 SP55 EP71 EPD  5571 A1  M. Granda, A1  J.M. Drake, A1  J.A. Gregorio, PY  1992 KW  performance measures; parallel systems; unbounded generalized stochastic Petri nets; unbounded places; state space; natural symmetries; finite graph; lumped states; unbounded places; open parallel systems; kbounded; steadystate solution; parallel machines; parallel programming; performance evaluation; Petri nets; stochastic processes VL  18 JA  IEEE Transactions on Software Engineering ER   
Methods of calculating efficiently the performance measures of parallel systems by using unbounded generalized stochastic Petri nets are presented. An explosion in the number of states to be analyzed occurs when unbounded places appear in the model. The state space of such nets is infinite, but it is possible to take advantage of the natural symmetries of the system to aggregate the states of the net and construct a finite graph of lumped states which can easily be analyzed. With the methods developed, the unbounded places introduce a complexity similar to that of safe places of the net. These methods can be used to evaluate models of open parallel systems in which unbounded places appear; systems which are kbounded but are complex and have large values of k can also be evaluated in an appropriate way. From the steadystate solution of the model, it is possible to obtain automatically the performance measures of parallel systems represented by this type of net.
[1] P. Brinch Hansen, "The programming language Concurrent Pascal,"IEEE Trans. Software Eng., vol. SE1, pp. 199207, June 1975.
[2] I. C. Pyle,The Ada Programming Language. London, UK: PrenticeHall, 1981.
[3] M. Ajmone Marsan, G. Balbao, and G. Conte,Performance Modeling of Multiprocessor Systems. Cambridge, MA: MIT Press, 1986.
[4] V. W. Mak and S. F. Lundstrom, "Predicting performance of parallel computations,"IEEE Trans. Parallel Distributed Syst., vol. 1, pp. 257270, July 1990.
[5] D. Towsley, C. G. Rommel, and J. A. Stankovic, "Analysis of forkjoin program response times on multiprocessors,"IEEE Trans. Parallel Distributed Syst., vol. 1, pp. 286303, July 1990.
[6] T. Murata, B. Shenker, and S. M. Shatz, "Detection of Ada static deadlocks using Petri Net invariants,"IEEE Trans. Software Eng., vol. 15, pp. 314326, Mar. 1989.
[7] C. Sauer and K. Chandy,Computer Systems Performance Modeling. Englewood Cliffs, NJ: PrenticeHall, 1981.
[8] J. L. Peterson,Petri Net Theory and the Modeling of Systems. Englewood Cliffs, NJ: PrenticeHall, 1981.
[9] M. K. Molloy, "On the integration of delay and throughput measures in distributed processing models," Ph.D. dissertation, Dep. Comput. Sci., Univ. of California, Los Angles, 1981.
[10] I. F. Akyildiz, "Product form approximations for queueing networks with multiple servers and blocking,"IEEE Trans. Computers, vol. 38, pp. 99114, Jan. 1989.
[11] P. Heidelberger and S. S. Lavenberg, "Computer performance evaluation methodology,"IEEE Trans. Computers, vol. C33, pp. 11951220, Dec. 1984.
[12] A. Thomasian and P. Bay, "Analytic queueing network models for parallel processing systems,"IEEE Trans. Comput., vol. C35, no. 12, pp. 10451054, Dec. 1986.
[13] F. Baskett, K. M. Chandy, R. R. Muntz, and F. G. Palacios, "Open, closed, and mixed networks of queues with different classes of customers,"J. ACM, vol. 22, no. 2, pp. 248260, 1975.
[14] M. Ajmone Marsan, G. Balbo, and G. Conte, "A class of generalized stochastic Petri nets for the performance evaluation of multiprocessor systems,"ACM Trans. Comput. Syst., vol. 2, pp. 93122, May 1984.
[15] Proc. 3rd Int. Workshop on Petri Nets and Performance Models(Kyoto, Japan), Dec. 1989.
[16] M. A. Marsan, G. Balbo, G. Chiola, and S. Donatelli, "On the productform solution of a class of multiplebus multiprocessor system models,"J. Syst. Software, vol. 1, no. 2, pp. 117124, 1986.
[17] A. A. Lazar and T. G. Robertazzi, "Markovian Petri net protocols with productform solution," inProc. INFOCOM'87(San Francisco, CA), Mar. 1987.
[18] G. Balbo, S. C. Bruell, and S. Ghanta, "Combining queueing networks and generalized stochastic Petri nets for the solution of complex models of system behavior,"IEEE Trans. Computers, vol. 37, pp. 12511268, Oct. 1988.
[19] K. Jensen, "Colored Petri nets," inPetri Nets: Central Models and Their Properties, W. Brauer, W. Reisig, and G. Rozenberg, Eds. Bad Honnef, W. Germany: SpringerVerlag, 1987, pp. 248299.
[20] C. Lin and C. Marinescu, "On stochastic highlevel Petri nets," inProc. Int. Workshop on Petri Nets and Performance Models(Madison, WI), Aug. 1987.
[21] J. G. Kemeny and J. L. Snell,Finite Markov Chains. Princeton, NJ: Van Nostrand, 1960.
[22] J. G. Kemeny, J. L. Snell, and A. W. Knapp,Denumerable Markov Chains. New York: SpringerVerlag, 1976.
[23] W. Henderson and P. G. Taylor, "Aggregation methods in exact performance analysis of stochastic Petri nets," inProc. 3rd Int. Workshop on Petri Nets and Performance Models(Kyoto, Japan), Dec. 1989, pp. 1218.
[24] C. Dutheillet and S. Haddad, "Regular stochastic Petri nets," inProc. 10th Int. Conf. on Application and Theory of Petri Nets(Bonn, Germany), June 1989.
[25] C. Dutheillet and S. Haddad, "Aggregation of states in colored stochastic Petri nets: application to a multiprocessor architecture," inProc. 3rd Int. Workshop on Petri Nets and Performance Models(Kyoto, Japan), Dec. 1989, pp. 4049.
[26] G. Florin and S. Natkin, "Oneplace unbounded stochastic Petri nets: Ergodic criteria and steadystate solutions,"J. Syst. Software, vol. 1, no. 2, pp. 103115, 1986.
[27] G. Florin and S. Natkin, "Necessary and sufficient ergodicity condition for open synchronized queueing networks,"IEEE Trans. Software Eng., vol. 15, pp. 367380, Apr. 1989.
[28] W. M. Zuberek, "Performance evaluation using unbounded timed Petri nets," inProc. 3rd Int. Workshop on Petri Nets and Performance Models(Kyoto, Japan), Dec. 1989, pp. 180186.
[29] M. Gonzalez Harbour, M. Granda, F. Vallejo, P. Diaz, and P. Incera, "Application of a rapidprototyping strategy to the programming of a multiprocessing system which controls a robotic environment," inProc. SIFIR'89. IEEE Int. Workshop on Sensorial Integration for Industrial Robots: Architectures and Applications(Zaragoza, Spain), Nov. 1989, pp. 371373.
[30] M. Granda and J. M. Drake (director), "Métodos para la evaluación de sistemas multiprocesadores y su aplicación a la programación de sistemas en tiempo real mediante prototipos rápidos," Ph.D. diss., Univ. Cantabria, Santander, Spain, Sept. 1989.
[31] E.çinlar,Introduction to Stochastic Processes. Englewood Cliffs, NJ: PrenticeHall, 1975.
[32] J. B. Dugan, "Extended stochastic Petri nets: applications and analysis," Ph.D. dissertation, Dept. Elec. Eng., Duke Univ., 1984.
[33] F. Vallejo and J. A. Gregorio, "Diseño de un programa ejecutivo para una arquitectura multiprocesadora de memoria compartida," Univ. Cantabria, Santander, Spain, 1988.
[34] E. Mediavilla and J. A. Gregorio, "Lenguajes de programación de tareas para un sistema multiprocesador," Univ. Cantabria, Santander, Spain, 1989.
[35] M. Granda, F. Vallejo, J. A. Gregorio, and J. M. Drake, "Analytical models for rapid prototyping of multiprocessor systems," inProc. 9th IASTED Int. Symp. Appl. Informatics(Innsbruck, Austria), Feb. 1991, pp. 318321.
[36] M. Granda, F. Vallejo, M. GlezHarbour, J. A. Gregorio, and J. M. Drake, "Strategy for programming of multiplemicroprocessor systems in industrial control applications," inProc. IMACSIFAC Symp. Modeling and Control of Techn. Systs.(Lille, France), May 1991, vol. 1, pp. 644650.