By Topic

A Job Schedule Model Based on Grid Environment

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

4 Author(s)
Wu, H. ; Dept. of Inf. Manage., Chinese Culture Univ., Taipei ; Chong-Yen Lee ; Wuu-Yee Chen ; Tsang-Yean Lee

Factors such as CPU utilization, throughput, turnaround time, waiting time, and response time can influence system performance. Different operating systems use different scheduling algorithms to achieve their goals. System performance of grid computing is calculated from resources usages. Job scheduling is more important when jobs are not uniformly distributed in all grid nodes. In order to achieve performance optimization, we propose a maximum processor utilization and throughput (MPUT) scheduling algorithm which maximizes CPU utilization and throughput at the same time and minimizes turnaround time as well. The algorithm is used in all execute grid nodes to schedule their jobs and get good performance

Published in:

Complex, Intelligent and Software Intensive Systems, 2007. CISIS 2007. First International Conference on

Date of Conference:

10-12 April 2007