Zuberek, W. M. (1987) Timed Petri nets in modelling and evaluation of multiprocessor systems. In: 1987 Int. Conference on Parallel Processing (ICPP’87), August, 1987, St.Charles, IL.
![[img]](https://research.library.mun.ca/style/images/fileicons/application_pdf.png) |
[English]
PDF
- Accepted Version
Available under License Creative Commons Attribution Non-commercial. Download (189kB) |
Abstract
Timed Petri nets discussed in this paper are extended Petri nets with exponentially distributed firing times. Interrupt arcs are introduced as an extension of inhibitor arcs to allow modelling of preemptions. Since the behavior of extended free- choice timed Petri nets can be represented by probabilistic Qs-tate graphs, stationary probabilities of states can be obtained by standard techniques used for analysis of continuous-time homogeneous Markov chains. An immediate application of such a model is performance analysis of queueing systems with exponentially distributed service and interarrival times, and in particular distributed computer systems. Places of Petri nets model systems queues, transitions represent servers, inhibitor arcs are used to model priorities of simultaneous events, and interrupt arcs provide preemption of servers. Simple models of multiprocessor systems are used as an illustration of modelling and performance evaluation.
| Item Type: | Conference or Workshop Item (Paper) |
|---|---|
| URI: | http://research.library.mun.ca/id/eprint/14792 |
| Item ID: | 14792 |
| Additional Information: | DOI number given in PDF is incorrect. |
| Department(s): | Science, Faculty of > Computer Science |
| Date: | August 1987 |
| Date Type: | Completion |
| Related URLs: |
Actions (login required)
 |
View Item |
Download statistics
Download statistics