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

Job relocation: a method to enhance the performance of gang scheduling on clusters of PCs

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)
Zhou, B.B. ; Sch. of Inf. Technol., Sydney Univ., NSW, Australia

Resource allocation and reallocation are very important issues affecting the performance of gang scheduling. Currently most gang scheduling systems adopt regular allocation policies. For many existing clusters of PCs, however, processors are interconnected via a fast Ethernet or a crossbar switch network and the location of processors is not a significant factor when communication costs are considered. Adopting regular allocation policies may cause unnecessary problems of fragmentation. We introduce a job-relocation method to alleviate the fragmentation problem.

Published in:

Parallel and Distributed Computing, Applications and Technologies, 2003. PDCAT'2003. Proceedings of the Fourth International Conference on

Date of Conference:

27-29 Aug. 2003

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.