"Timed Petri net models of sharedmemory busbased multiprocessors"
Zuberek, W.M.
Journal of Computers and Communications, vol.6, no.10, pp.114, 2018
(DOI 10.4236/jcc.2018.610001).
Abstract:
In sharedmemory busbased multiprocessors, when the number of processors
grows, the processors spend an increasing amount of time waiting for access
to the bus (and shared memory). This contention reduces the performance of
processors and imposes a limitation of the number of processors that can be
used efficiently in busbased systems. Since the multiprocessor's performance
depends upon many parameters which affect the performance in different ways,
timed Petri nets are used to model sharedmemory busbased multiprocessors
at the instruction execution level, and the developed models are used to study
how the performance of processors changes with the number of processors in
the system. The results illustrate very well the restriction on the number of
processors imposed by the shared bus. All performance characteristics
presented in this paper are obtained by discreteevent simulation of Petri
net models.
Keywords:
sharedmemory multiprocessors, busbased multiprocessors,
timed Petri nets, discreteevent simulation.
References:

Allen, A.A., Probability, Statistics and Queueing Theory with
Computer Science Applications (2 ed); Academic Press 1991.

Hamilton, S., ``Taking Moore's law into the next century''; IEEE
Computer, vol.32, no.1, pp.4348, 1999.

Jain, R., The Art of Computer Systems Performance Analysis;
J. Wiley Interscience, 1991.

Jesshope, C., ``Multithreaded microprocessors  evolution or revolution'';
in Advances in Computer Systems Architecture (LNCS 2823), pp. 2145,
SpringerVerlag 2003.

Lundstrom, M., ``Moore's law forever?''; Science, vol.299, pp.210211, 2003.

Milenkovic, A., ``Achieving high performance in busbased sharedmemory
multiprocessors''; IEEE Concurrency, vol.8, no.3, pp.3644, 2000.

Murata, T., ``Petri nets: properties, analysis and applications'';
Proceedings of IEEE, vol.77, no.4, pp.541580, 1989.

Mutlu, O., Stark, J., Wilkerson, C., Patt, Y.N., ``Runahead execution:
an effective alternative to large instruction windows''; IEEE Micro,
vol.23, no.6, pp.2025, 2003.

Patterson, D.A., Hennessy, J.L., Computer Architecture  A Quantitative
Approach (4th ed.); Morgan Kaufmann 2006.

Pooch, U.W., Wall, J.A., Discrete Event Simulation; CRC Press 1993.

PopovaZeugmann, L., Time and Petri Nets; SpringerVerlag 2013.

Ramamoorthy, C.V., Li, H.F., ``Pipeline architecture''; ACM Computing Surveys,
vol.9, no.1, pp.61102, 1977.

Reisig, W., Petri Nets  an Introduction (EATCS Monographs on
Theoretical Computer Science 4); SpringerVerlag 1985.

Suh, T., Lee, HH.S., Blough, D.M., ``Integrating cache coherence protocols
for heterogeneous multiprocessor system'' part 2; IEEE Micro, vol.24, no.5,
pp.5569, 2004.

Wilkes, M.V., ``The memory gap and the future of highperformance memories'';
ACM Architecture News, vol.29, no.1, pp.27, 2001.

Zuberek, W.M., ``Mtimed Petri nets, priorities,
preemptions, and performance evaluation of systems''; in: Advances
in Petri Nets 1985 (LNCS 222), pp.478498, SpringerVerlag 1986.

Zuberek, W.M., ``Dtimed Petri nets and modelling
of timeouts and protocols''; Transactions of the Society for Computer
Simulation, vol.4, no.4, pp.331357, 1987.

Zuberek, W.M., ``Timed Petri nets  definitions,
properties and applications''; Microelectronics and Reliability
(Special Issue on Petri Nets and Related Graph Models), vol.31, no.4,
pp.627644, 1991.

Zuberek, W.M., ``Modeling and analysis of simultaneous
multithreading'', Proc. 14th Int. Conf. on Analytical and Stochastic
Modeling Techniques and Applications (ASMTA07), a part of the 21st European
Conference on Modeling and Simulation (ECMS'07), Prague, Czech Republic,
pp.115120, 2007.

Zuberek, W.M., ``Performance analysis of sharedmemory
busbased multiprocessors using timed Petri nets''; in Petri Nets in
Science and Engineering, ed. R. CamposRodriguez, ch.5, pp.7591,
InTechOpen 2018.
Available in pdf.