By Topic

Improved Grid Metascheduler Design using the Plackett-Burman Methodology

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

3 Author(s)
Vanderster, D.C. ; Dept. of Electr. & Comput. Eng., Univ. of Victoria, Victoria, BC ; Dimopoulos, N.J. ; Sobie, R.J.

In the context of computational grids, a metascheduler is the service responsible for scheduling jobs across many geographically distributed processor clusters. Typically, these software systems are complex and difficult to understand, resulting in initial designs which are ad hoc and suboptimal. This paper shows how a formal design methodology can be to used to better understand the relationships between metascheduler parameters, and thereby to achieve a well-designed metascheduler. Using a Plackett-Burman design, the methodology is demonstrated in the design of a knapsack grid metascheduler. The design is performed usiing efficiency and delay as the target variables.

Published in:

High Performance Computing Systems and Applications, 2007. HPCS 2007. 21st International Symposium on

Date of Conference:

13-16 May 2007