Scheduling Gangs with Different Distributions in Gangs' Degree of Parallelism in a Multi-Site System

Authors:
Zafeirios Papazachos;Helen Karatza
Affiliations:
-;-
Venue:
BCI '09 Proceedings of the 2009 Fourth Balkan Conference in Informatics
Year:
2009

Citing 0
Cited 4

Performance evaluation of bag of gangs scheduling in a heterogeneous distributed system

Journal of Systems and Software
Gang scheduling in a two-cluster system implementing migrations and periodic feedback

Simulation
Scheduling of frequently communicating tasks

International Journal of Communication Systems
Improving CompactMatrix phase in gang scheduling by changing transference condition and utilizing exchange

The Journal of Supercomputing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Gang scheduling is considered to be a highly effective task scheduling policy for distributed systems. Gangs are jobs which consist of a number of interacting tasks which are scheduled to run simultaneously on distinct processors. Simulation experiments are conducted to address performance issues which concern the impact of the variability in gangs’ degree of parallelism in the case of implemented migrations. A simulation model consisting of two sites is used to provide results on the performance of the system.