Improvements in Parallel Job Scheduling Using Gang Service

Authors:
Fabricio Alves Barbosa da Silva;Isaac D. Scherson
Affiliations:
-;-
Venue:
ISPAN '99 Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms and Networks
Year:
1999

Citing 0
Cited 3

Engineering grid applications and middleware for high performance

WOSP '07 Proceedings of the 6th international workshop on Software and performance
Achieving efficiency, quality of service and robustness in multi-organizational Grids

Journal of Systems and Software
Fuzzy expert system for load balancing in symmetric multiprocessor systems

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.01

Visualization

Abstract

Gang scheduling has been widely used as a practical solution to the dynamic parallel job scheduling problem. Parallel threads of a single job are scheduled for simultaneous execution on a parallel computer even if the job does not fully utilize all available processors. Non allocated processors go idle for the duration of the time quantum assigned to the threads. In this paper we propose a class of scheduling policies, dubbed Concurrent Gang, that is a generalization of gang-scheduling, and allows for the flexible simultaneous scheduling of multiple parallel jobs, thus improving the space sharing characteristics of gang scheduling. However, all the advantages of gang scheduling such as responsiveness, efficient sharing of resources, ease of programming, etc., are maintained.