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

Asymptotic Analysis of Load Distribution for Size-Interval Task Allocation with Bounded Pareto Job Sizes

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)
Vesilo, R. ; Dept. of Electron. Eng., Macquarie Univ., Sydney, NSW, Australia

Server farms, consisting of a collection of hosts and a front-end router that dispatches incoming jobs to hosts, are now commonplace. When job service requirements (job sizes) are highly variable, the Size-Interval task assignment policy is an excellent rule for assigning jobs to hosts. For a long time it was believed that the size cutoff separating "short" jobs from "long " ones should be chosen to balance the load at the hosts in the server farm. However, recent literature has provided evidence that load balancing is not always optimal for minimizing mean response time. Previous collaborative work by the author presented simple sufficient criteria for determining which host should be underloaded in a two host system using Size-Interval task assignment. In this paper, we derive asymptotic closed-form expressions for the optimal size cutoff, separating short jobs from large jobs, and the optimal load point at the separation in a two-host system. The asymptotic expressions are for when the maximum job size in a Bounded Pareto distribution approaches infinity and are derived using perturbation analysis. We show that the asymptotics can be one of three forms depending on whether the system load (mean number of busy hosts) is less than 1, equal to 1 or greater than 1 with different mechanisms dominating in each case. Our results allow the effects of both load and tail index to be easily determined. Numerical analysis shows that the asymptotic expressions in most cases are very accurate.

Published in:

Parallel and Distributed Systems, 2008. ICPADS '08. 14th IEEE International Conference on

Date of Conference:

8-10 Dec. 2008

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.