By Topic

Statistical performance analysis of strict priority and generalised processor sharing two-stage scheduling system under exponentially bounded burstiness input model

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $33
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
C. Li ; College of Computer Science and Technology, Zhejiang University, Hangzhou 310029, People's Republic of China ; S. Zhang ; W. Wang

Two-stage scheduling system with multiple arrival flows is widely used in many quality of service guarantee occasions. However, there is no effective, versatile method to get the performance results for this more complex service rule system. This paper analyses a two-stage scheduling system with strict priority and generalised processor sharing scheduling discipline. By using a vertical decomposition solution method, the statistical performance bounds on the backlog and delay of each flow are derived under the exponentially bounded burstiness input model. Using a discrete time Markov-modulated On-Off process example, the performance bound results are analysed.

Published in:

IET Networks  (Volume:1 ,  Issue: 3 )