By Topic

Performance analysis of parallel job scheduling in distributed systems

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
$33 $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)
H. D. Karatza ; Dept. of Informatics, Aristotle Univ. of Thessaloniki, Greece ; R. C. Hilzer

This paper studies parallel job scheduling in a distributed system. A simulation model is used to address performance issues associated with scheduling. Five policies are used to schedule parallel jobs over a variety of workloads. Fairness is required among competing jobs. We examine a case where the distribution of the number of parallel tasks per job and also the distribution of task service demand vary with time. Simulated results indicate that although all scheduling methods have merit, one method significantly improves the overall performance and also guarantees fairness in terms of individual job execution.

Published in:

Simulation Symposium, 2003. 36th Annual

Date of Conference:

30 March-2 April 2003