By Topic

Probabilistic Scheduling Based on Queueing Model for Multi-user Network Applications

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 $13
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)
Zheng Xiao ; Coll. of Inf. Sci. & Eng., Hunan Univ., Changsha, China ; Zhao Tong ; Kenli Li

Multi-user network applications are often met in our normal life, especially as WEB comes up. And it is usually configured into a distributed system. In such distributed environment, task scheduling plays an important role. Unlike traditional scheduling, there are lots of uncertainties which consist in task arrival process, state of processing units, and network transmission. We investigate the dynamic scheduling problem which takes these uncertainties into account. In order to improve scheduling speed and alleviate the problem of imprecision of state estimation, the idea of probabilistic scheduling is put forward. Specifically, we build a queueing model in which all arrived tasks are pushed into a queue, and every processing unit has their local queues for task execution. Some parameters are computed using queueing theory. Based on these parameters this scheduling problem is defined as a non-linear programming problem. The robustness of the algorithm is analyzed, and the performance is validated by comparison with such classical algorithms as MinMin, MinMax, Suffrage, and ECT.

Published in:

Computer and Information Technology (CIT), 2012 IEEE 12th International Conference on

Date of Conference:

27-29 Oct. 2012