Cart (Loading....) | Create Account
Close category search window
 

Threshold-based priority policies for parallel-server systems with affinity scheduling

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
$31 $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

4 Author(s)
Squillante, M.S. ; IBM Res. Div., Thomas J. Watson Res. Center, Yorktown Heights, NY, USA ; Xia, C.H. ; Yao, D.D. ; Li Zhang

We study the dynamic scheduling of multiclass parallel-server stochastic networks and propose a general class of threshold-based priority policies. A number of examples are considered to illustrate the use of our algorithm for determining the placement of thresholds and to quantify the benefits of the proposed policies. We derive approximate formulas for the queue lengths under our threshold-based priority policies and we illustrate how these formulas can be used to obtain optimal threshold values

Published in:

American Control Conference, 2001. Proceedings of the 2001  (Volume:4 )

Date of Conference:

2001

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.