loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2009 Fourth Balkan Conference in Informatics
Scheduling Gangs with Different Distributions in Gangs' Degree of Parallelism in a Multi-Site System
Thessaloniki, Greece
September 17-September 19
ISBN: 978-0-7695-3783-2
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.
Index Terms:
distributed systems, gang scheduling, modelling, simulation, migration, multi-site
Citation:
Zafeirios Papazachos, Helen Karatza, "Scheduling Gangs with Different Distributions in Gangs' Degree of Parallelism in a Multi-Site System," bci, pp.121-126, 2009 Fourth Balkan Conference in Informatics, 2009
Usage of this product signifies your acceptance of the Terms of Use.