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

Analysis of JSQ policy on soft real-time scheduling in cluster

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

1 Author(s)
Zhu, Weiping ; Dept. of Comput. Sci. & Electr. Eng., Queensland Univ., Qld., Australia

The "join the shortest queue" (JSQ) policy is studied in this paper, under the context of soft real-time scheduling, and an approximate analytical model is proposed. The result obtained from the approximate analysis is compared against the simulation one, which shows that the approximate analysis is highly accurate. Thus, approximate analysis can be applied to the development of soft real-time systems.

Published in:

High Performance Computing in the Asia-Pacific Region, 2000. Proceedings. The Fourth International Conference/Exhibition on  (Volume:1 )

Date of Conference:

14-17 May 2000

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.