Abstract
This paper evaluates the impact of task migration on gangscheduling of parallel jobs for distributed systems. With migration, it is possible to move tasks of a job from their originally assigned set of nodes to another set of nodes, during execution of the job. This additional flexibility creates more opportunities for filling holes in the scheduling matrix. We conduct a simulation-based study of the effect of migration on average job slowdown and wait times for a large distributed system under a variety of loads.We find that migration can significantly improve these performance metrics over an important range of operating points. We also analyze the effect of the cost of migrating tasks on overall system performance.
Cite
CITATION STYLE
Zhang, Y., Franke, H., Moreira, J. E., & Sivasubramaniam, A. (2000). The impact of migration on parallel job scheduling for distributed systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1900, pp. 242–251). Springer Verlag. https://doi.org/10.1007/3-540-44520-x_33
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
