Marco Ajmone Marsan
- 1 AJMONE MARSAN, M. Bounds on bus and memory interference in a class of multiple bus multiprocessor systems. In Proceedings of 3rd International Conference on Distributed Computing Systems (Ft. Lauderdale, Fla., Oct. 18-22), IEEE, New York, 1982, pp. 792-798.Google Scholar
- 2 AJMONE MARSAN, M., BALBO, G., AND CONTE, G. Comparative performance analysis of single bus multiprocessor architectures. IEEE Trans. Comput. C-31, 12 (Dec. 1982), 1179-1191.Google Scholar
- 3 AJMONE MARSAN, M. AND GERLA, M. Markov models for multiple bus multiprocessor systems. IEEE Trans. Comput. C-32, 3 (March 1982), 239-248.Google Scholar
- 4 AJMONE MARSAN M. AND GREGORETTI, F. Memory interference model for a multimicroprocessor system with a shared bus and a single external common memory. Euromicro J. 7, 2 (1981), 124-133.Google Scholar
- 5 Cox, D.R. The analysis of non-Markovian stochastic processes by the inclusion of supplementary variables. Proc. Camb. Phil. Soc., 51 (1955), 313-319.Google Scholar
- 6 MERLIN, J. A., AND FARBER, D.J. Recoverability of communication protocols--implications of a theoretical study IEEE Trans. Commun. COM-24, 9 (Sept. 1976).Google Scholar
- 7 MOLLOY, M.K. On the integration of delay and throughput measures in distributed processing models. Ph.D. dissertation, Univ. of California, Los Angeles (1981). Google Scholar
- 8 MOLLOY, M.K. Performance analysis using stochastic Petri nets. IEEE Trans. Comput. C-31, 9 (Sept. 1982), 913-917.Google Scholar
- 9 NATKIN, S. Reseaux de Petri Stochastiques. Ph.D. dissertation, CNAM-PARIS, (June 1980).Google Scholar
- 10 NOE, J. D., AND NUTT, G .J . Macro E-nets representation of parallel systems. IEEE Trans. Cornput. C-22, 8 (Aug. 1973), 718-727.Google Scholar
- 11 PETERSON, J .L . Petri nets. ACM Comput. Surv. 9, 3 (Sept. 1977), 223-252. Google Scholar
- 12 PETRI, C.A. Communication with automata. Ph.D. dissertation, Tech. Rep. RADC-TR-65-377, Rome Air Development Center, Rome, NY (1966).Google Scholar
- 13 SYMONS, F. Z.W. Introduction to numerical Petri nets, a general graphical model of concurrent processing systems. A.T.R., 14, 1 (Jan. 1980), 28-33.Google Scholar
- 14 VARGA, R.S. Matrix Iterative Analysis. Prentice Hall, Englewood Cliffs, N. J. (1962).Google Scholar
- 15 ZUBEREK, W.M. Timed Petri nets and preliminary performance evaluation. In Proceedings of the 7th Annual Symposium on Computer Architecture (La Baule, France, May 6-8), ACM and IEEE, New York, 1980, pp. 88-96. Google Scholar
Index Terms
- A class of generalized stochastic Petri nets for the performance evaluation of multiprocessor systems
Recommendations
Discrete Time Stochastic Petri Nets
Basic graph models of processes, such as Petri nets, have usually omitted the concept of time as a parameter. Time has been added to the Petri net model in two ways. The timed Petri net (TPN) uses a fixed number of discrete time intervals. The ...
Generalized Stochastic Petri Nets: A Definition at the Net Level and its Implications
The class of Petri nets obtained by eliminating timing from generalized stochastic Petri net (GSPN) models while preserving the qualitative behavior is identified. Structural results for those nets are derived, obtaining the first structural analysis of ...
New NP-Complete Problems in Performance Evaluation of Concurrent Systems Using Petri Nets
Timed Petri nets are useful in performance evaluation of concurrent systems. The maximum computation rate is achieved for minimal cycle time of timed Petri net. It is known that minimal cycle time problem for P-invariant Petri nets is NP-complete. In ...
Comments