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

Computer cluster scheduling algorithm based on time bounded dynamic programming

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

2 Author(s)
Grudenic, I. ; Fac. of Electr. Eng. & Comput., Dept. of Electron., Microelectron., Comput. & Intell. Syst., Univ. of Zagreb, Zagreb, Croatia ; Bogunovic, N.

Computer clusters are currently the most used distributed computer architecture. Efficient utilization of computer cluster depends on a scheduling policy that is applied. Scheduling of jobs in computer cluster is a complicated task due to frequent changes in the workload. In this paper we present scheduling algorithm that is based on EASY backfilling scheduling strategy. Dynamic programming with time restriction is used to calculate as good schedule as possible within given time constraints. Algorithm is evaluated on several computer cluster workloads and is shown to outperform original backfilling strategy.

Published in:

MIPRO, 2011 Proceedings of the 34th International Convention

Date of Conference:

23-27 May 2011

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.