Modeling priority schemes

Authors:
G. Balbo;S. C. Bruell;S. Ghanta
Affiliations:
Dipartimento di Informatica, Universita' di Torino;Computer Science Department, University of Iowa;Computer Science Department, University of Minnesota
Venue:
SIGMETRICS '85 Proceedings of the 1985 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Year:
1985

Citing 8
Cited 1

A class of generalized stochastic Petri nets for the performance evaluation of multiprocessor systems

ACM Transactions on Computer Systems (TOCS)
Computer networks

Computer networks
Open, Closed, and Mixed Networks of Queues with Different Classes of Customers

Journal of the ACM (JACM)
The Operational Analysis of Queueing Network Models

ACM Computing Surveys (CSUR)
The MVA priority approximation

ACM Transactions on Computer Systems (TOCS)
Computational algorithms for closed queueing networks with exponential servers

Communications of the ACM
The MVA Pre-empt resume priority approximation

SIGMETRICS '83 Proceedings of the 1983 ACM SIGMETRICS conference on Measurement and modeling of computer systems
On the integration of queueing networks and generalized stochastic petri nets for the performance evaluation of computer systems (modeling, queueing theory)

On the integration of queueing networks and generalized stochastic petri nets for the performance evaluation of computer systems (modeling, queueing theory)

The evolution of software performance engineering: a survey

ACM '86 Proceedings of 1986 ACM Fall joint computer conference

Quantified Score

Hi-index	0.00

Visualization

Abstract

We develop Generalized Stochastic Petri Net models for several priority queueing disciplines. The building blocks of these models are explained and many variants are easily derivable from them. We then combine these building blocks with product-form queueing network models. Numerical results are provided that illustrate the effectiveness of the method.