High Performance Computer Applications

  • Santana-Castolo, Morales J
  • Torres-ramos S
N/ACitations
Citations of this article
30Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This article presents a multiobjective approach for scheduling large workflows in distributed datacenters. We consider a realistic scheduling scenario of distributed cluster systems composed of multi-core computers, and a multi-objective formulation of the scheduling problem to minimize makespan, energy consumption and deadline violations. The studied schedulers follow a two-level schema: in the higher-level, we apply a multiobjective heuristic and a multiobjective metaheuristic, to distribute jobs between clusters; in the lower-level, specific backfilling-oriented scheduling methods are used for task scheduling locally within each cluster, considering precedence constraints. A new model for energy consumption in multi-core computers is applied. The experimental evaluation performed on a benchmark set of large workloads that model different realistic high performance computing applications demonstrates that the proposed multiobjective schedulers are able to improve both the makespan and energy consumption of the schedules when compared with a standard Optimistic Load Balancing Round Robin approach.

Cite

CITATION STYLE

APA

Santana-Castolo, Morales, J. A., & Torres-ramos, S. (2016). High Performance Computer Applications, 595, 116–131. https://doi.org/10.1007/978-3-319-32243-8

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free