By Topic

Simulation-based average case analysis for parallel job scheduling

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)
Da Silva, F.A.B. ; Lab. ASIM, Univ. Pierre et Marie Curie, Paris, France ; Scherson, I.D.

This paper analyses the resource allocation problem in parallel job scheduling, with emphasis given to gang service algorithms. Gang service has been widely used as a practical solution to the dynamic parallel job scheduling problem. To provide a sound analysis of gang service performance, a novel methodology based on the traditional concept of competitive ratio is introduced. Dubbed dynamic competitive ratio, the new method is used to do an average case analysis based on simulation of resource allocation algorithms. These resource allocation algorithms apply to the gang service scheduling of a workload generated by a statistical model. Moreover, dynamic competitive ratio is the figure of merit used to evaluate and compare packing strategies for job scheduling under multiple constraints. It is shown that for the unidimensional case there is a small difference between the performance of best fit and first fit; first fit can hence be used without significant system degradation. For the multidimensional case, when memory is also considered, we conclude that the resource allocation algorithm must try to balance the resource utilization in all dimensions simultaneously, instead of given priority to only one dimension of the problem

Published in:

Simulation Symposium, 2001. Proceedings. 34th Annual

Date of Conference: