Stability analysis of buffer priority scheduling policies using Petri nets

Authors:
Chuang Lin;MingWei Xu
Affiliations:
Department of Computer Science and Technology, Tsinghua University, Beijing 100084, P.R. China;Department of Computer Science and Technology, Tsinghua University, Beijing 100084, P.R. China
Venue:
Journal of Computer Science and Technology
Year:
2003

Citing 6
Cited 0

Stochastic High-Level Petri Nets and Applications

IEEE Transactions on Computers
On deciding stability of scheduling policies in queueing systems

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Fast Bounds for Stochastic Petri Nets

International Workshop on Timed Petri Nets
Theory, Volume 1, Queueing Systems

Theory, Volume 1, Queueing Systems
Global stability of generalized additive fuzzy systems

IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
The concept of “stability” in asynchronous distributeddecision-making systems

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

Quantified Score

Hi-index	0.00

Visualization

Abstract

A Petri net approach to determining the conditions for stability of a re-entrant system with buffer priority scheduling policy is described in this paper. The concept of buffer boundedness based on the dynamic behavior of the markings in the system model is emphasized. The method is used to demonstrate the stability of the first buffer first served (FBFS) and the last buffer first served (LBFS) scheduling policies. Finally a sufficient condition for instability of systems with a positive feedback loop (PFL) is established, and an example is given.